A group of pirates agree to divide a treasure chest of gold coins among themselves as follows. The pirate to take a share takes of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the pirate receive?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Work backwards: each step multiplies by 12 and divides by 1 to 11. Twelves supply every 2 and 3, so the last share needs 5, 5, 7, 11.
Solution
Going forward, the pile keeps shrinking by awkward fractions. Going backwards from the last pirate is easier.
- What each pirate leaves. Pirate takes of the pile, so he leaves of it. Pirate leaves , pirate leaves , and so on, down to pirate , who leaves . Pirate takes , which is everything left.
- Call the last share . Pirate gets the whole final pile, coins.
- Step backwards. Pirate left of his pile, so his pile was times as big: . Pirate left , so his pile was that times . Keep going:
| Pile just before pirate | Number of coins |
|---|---|
| 12 | |
| 11 | |
| 10 | |
| 9 | |
| 1 |
4. What must be true. Every pile must be a whole number. (Then each pirate's share, the pile before him minus the pile after, is whole too.) The starting pile grows when grows, so the smallest start means the smallest .
5. The 2s and 3s take care of themselves. Each brings two 2s and one 3. The numbers we divide by bring fewer. For example, contains only eight 2s and four 3s, while eleven 12s bring twenty-two 2s and eleven 3s. The same holds at every row of the table.
6. The other primes do not. We also divide by , , and . Twelves never contain , or , so itself must supply them: two 5s (one for , one for ), one and one . So is a multiple of
7. 1925 works. With every factor in the table cancels, so every pile is a whole number.
The twelfth pirate receives coins.
Why this works
When the rule is "take a fraction of what is left", work with what is left, not with what is taken. Walking backwards turns each step into "multiply by 12, divide by a small number." Then the whole question is which prime factors the 12s cannot supply: here and .
Alternative approach
Use the answer choices. The last share is what is left of after all its 2s and 3s are cancelled by twelves, so it cannot be even or a multiple of . Choices (A) , (B) , (C) and (E) are all even. Only (D) is left.
The trap
Taking 12 to the 11th power coins without cancelling, or forgetting that dividing by both 5 and 10 needs two factors of 5.
Concise solution
Let be the initial number of coins. When pirate takes of the pile, the pile shrinks to of its size. After pirates through have gone, the chest holds
and pirate takes of this, i.e. all of it.
Every pirate's share is a whole number exactly when the pile is a whole number after each step; the tightest requirement is the final one, that be an integer (the earlier piles are this quantity multiplied back by fractions with smaller denominators, and one checks they stay integral for the found below).
Factor: and . So must supply , and the smallest choice is .
Then the twelfth pirate receives
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.4)
Techniques
Set up the equation/formula and compute; no special trick needed · Start from the end state / desired conclusion and reverse