Seventeen Mongolian Raiders stole a sack of gold coins. After diving the spoils evenly, three coins remained. A scuffle ensued as to who would get each of the additional coins. As a result, one of the raiders was killed. Figuring their problem may be solved, the remaining raiders divided the fortune evenly a second time. This time, ten coins remained. Again, a fight broke out over who would or wouldn't be a coin short. Another raider was slain during the dispute. Increasingly hopeful, the
radiers lucky enough to be alive divided the coin among themselves yet again. This time, the coins divided evenly.
What is the fewest number of gold coins that cold have been present in the sack that was stolen by the raiders?
radiers lucky enough to be alive divided the coin among themselves yet again. This time, the coins divided evenly.
What is the fewest number of gold coins that cold have been present in the sack that was stolen by the raiders?
-
3930
-
PERL is a computer language.
The script I wrote simply tried all positive integers until it found one that worked.
The script I wrote simply tried all positive integers until it found one that worked.
Report Abuse