Five seamen were marooned on an island as a punishment for stealing supplies from their ship.
After many hours of searching for food, they found a coconut grove and spent the entire day harvesting coconuts. Tired of the days work, they decided to sleep, without counting the coconuts, and to do the sharing the next day.
The first seamen woke up during the night and divided the coconuts into five equal shares and found one extra coconut, which he threw into the sea. Then, he hid one share and combined the other four into one heap, without waking the others.
A little while later, the second seamen woke up and did the same dividing exercise. He too found one extra coconut, which he threw away, hid his share and combined the rest into one heap.
The same operation was repeated by the rest three seamen, without one another's knowledge.
The next day, the five men saw a heap that was definitely much smaller. But, unwilling to admit their mistake, each kept quite and divided the remaining coconuts equally among themselves.
So, how coconuts were actually harvested on the previous day, if it is assumed that the seamen spent 10 hours harvesting coconuts with each harvesting no more than 250 coconuts in an hour.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let the original number of coconuts be C 0 .
If we assign C i as the number of coconuts 'left' by the i-th seamen after his 'distribution', we get the equation.
C i = 5 4 ( C i − 1 − 1 )
Thus, we get the number of coconuts left in the heap on the second day as
C 5 = 5 5 1 ( 1 0 2 4 C 0 − 8 4 0 4 )
and the final share for each seamen as
S = 5 C 5 = 1 5 6 2 5 1 ( 1 0 2 4 C 0 − 8 4 0 4 )
This gives the Diophantine equation
1 0 2 4 C 0 − 1 5 6 2 5 S = 8 4 0 4
Using Euclidean Algorithm we get the solutions as
C 0 = 1 5 6 2 5 n + 3 1 2 1 , S = 1 0 2 4 n + 2 0 4
The solutions are positive for n = 0 , 1 , 2 . . .
However, for n = 1 , 2 , . . , the values of C 0 > 1 5 0 0 0 = 1 2 × 5 × 2 5 0 which is the maximum possible number of harvested coconuts.
Hence, using n = 0 , we have the solution as C 0 = 3 1 2 1