Browse · harp
Printimc
algebra intermediate
Problem
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)
Solution
Let be the number of coins. After the pirate takes his share, of the original amount is left. Thus, we know that must be an integer. Simplifying, we get . Now, the minimal is the denominator of this fraction multiplied out, obviously. We mentioned before that this product must be an integer. Specifically, it is an integer and it is the amount that the pirate receives, as he receives all of what is remaining. Thus, we know the denominator is canceled out, so the number of gold coins received is going to be the product of the numerators, .
Final answer
D