Number Theory

    

An Algorithm for General Solution of Monkey and Coconut Problem

Authors: Prem kumar

In this paper I discuss an algorithm which will solve a very famous puzzle involving a monkey, few men and some coconuts. The puzzle involves a group of n men who have an unknown number of coconuts among them. At night, while the others are asleep, one of the men divides the coconuts in n parts and hides his share. While dividing, he discovers that there is one extra coconut, which he gives away to a monkey. Exactly the same thing happens with the rest of the men, one by one. They all hide their share, are left with one extra coconut that cannot be divided, which they give to the monkey. The next morning they again divide the coconuts together equally among themselves, with no extra coconut remaining this time. The puzzle is to find out the initial number of coconuts.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2016-03-16 11:45:12
[v2] 2016-04-14 03:21:54

Unique-IP document downloads: 463 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus