MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

JBMO SL 2009 — Pirate Coin Distribution

1925SpecialistCombinatoricsAlgebraSequences & Series

2009 Shortlist JBMO · 2009

A group of $n>1$ pirates of different ages owned a total of 2009 coins. Initially each pirate (except the youngest one) had one coin more than the next younger. a) Find all possible values of $n$. b) Every day a pirate was chosen. The chosen pirate gave a coin to each of the other pirates. If $n=7$, find the largest possible number of coins a pirate can have after several days.
0 students attempted0% solvedRating 1925

Related practice paths

AIME PracticeInteger-answer practice for deeper multi-step problems.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.