AMC 12 2013a Problem 17
- Paper
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?
\textbf{(A)} \ 720 \textbf{(B)} \ 1296 \textbf{(C)} \ 1728 \textbf{(D)} \ 1925 \textbf{(E)} \ 3850
Dataset text AMC 12 2000 to 2025. Quoted with source.
Show the answer
D
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.