Brainy Puzzles
Puzzle Solvers: Interesting brainy puzzles shared by fellow puzzlers
405 Members
Join this group to post and comment.
Ankita Katdare • May 29, 2012

The Monkey and the Coconut Puzzle - Anyone?

Ten people land on a deserted island. There they find lots of coconuts and a monkey. During their first day they gather coconuts and put them all in a community pile. After working all day they decide to sleep and divide them into ten equal piles the next morning.
That night one castaway wakes up hungry and decides to take his share early. After dividing up the coconuts he finds he is one coconut short of ten equal piles. He also notices the monkey holding one more coconut. So he tries to take the monkey's coconut to have a total evenly divisible by 10. However when he tries to take it the monkey conks him on the head with it and kills him.
Later another castaway wakes up hungry and decides to take his share early. On the way to the coconuts he finds the body of the first castaway, which pleases him because he will now be entitled to 1/9 of the total pile. After dividing them up into nine piles he is again one coconut short and tries to take the monkey's slightly bloodied coconut. The monkey conks the second man on the head and kills him.
One by one each of the remaining castaways goes through the same process, until the 10th person to wake up gets the entire pile for himself. What is the smallest number of possible coconuts in the pile, not counting the monkeys?
Ufffff, finally I think I got 1, after a lot of trying...... Is it 2519 coconuts????? (not counting the 1 in monkey's hand.)
da_joker • May 29, 2012
around 100 i guess
Anoop Kumar • May 29, 2012
Its simple and class 8th question LCM of all numbers -1😀
akash.kasina • May 31, 2012
there are totally 2520 coconuts(2519 for the last person,1 in hands of the monkey)
😀
AbraKaDabra: Can we get a confirmation?
Ankita Katdare • Jun 5, 2012
Prashanth_p@cchi Yep. That is the right answer - 2519.
The solution for the answer is the LCM (Lowest Common Multiple) of 10,9,8,7,6,5,4,3,2,1 -1. LCM would give the least number which is divisible by all of these number and subtracting one would give us the number of coconuts which were initially there.