pirates with total 2009 coins, each 1 more than the younger
Source: JBMO 2009 Shortlist N2
October 14, 2017
JBMOnumber theory
Problem Statement
A group of pirates of different age owned total of coins. Initially each pirate (except the youngest one) had one coin more than the next younger.
a) Find all possible values of .
b) Every day a pirate was chosen. The chosen pirate gave a coin to each of the other pirates. If , find the largest possible number of coins a pirate can have after several days.