Every week we feature a Brain Teaser or a thought-provoking question.
If you have one that you would like to share with fellow engineers please email it to firstname.lastname@example.org.
So, here is this week’s,
A gang of 17 thieves steals a bag of gold coins. In trying to share the coins equally, there are three coins remaining. In the ensuing fight over these three coins, one of the gang members is killed. In the next attempt to equally distribute the coins, there are 10 coins remaining. Again the gang fights, and another member dies. The third attempt is successful.
What is the smallest number of coins stolen?
The correct answer will be posted a week following this posting.
You must be logged in to post a comment Login