Sailors, stranded on an island, collect all the coconuts they can find. They agree to divide up the coconuts in the morning. But each, in turn, gets up in the night to take his share from the pile. At each division, one is given to a monkey to keep him quiet. In the morning, none are surprised at how the pile has shrunk. They give another coconut to the monkey and divide what remains. What is the smallest number of coconuts such that all divisions come out even? In classic examples of this problem, there are 3 sailors and 4 divisions or 5 sailors and 6 divisions. Sometimes the monkey does not get his coconut in the morning.


    Education Levels:


      EUN,LOM,LRE4,work-cmr-id:397862,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/CoconutsSailorsAndAMonkey/,ilox,learning resource exchange,LRE metadata application profile,LRE


      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0


      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467