Four men and a monkey spend the day gathering coconuts on a tropical island. After they have all gone to sleep at night, one of the men awakens and, not trusting the others, decides to take his share. He divides the coconuts into four equal piles, except for one remaining coconut, which he gives to the monkey. He then hides his share, puts the other piles together, and goes back to sleep. Each of the other men awakens during the night and does likewise, and every time there is one coconut left over for the monkey. In the morning all the men awake, divide what's left of the coconuts into four, and again there is one left over that is given to the monkey. Find the minimum number of coconuts that could have been in the original pile.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
Four men and a monkey spend the day gathering coconuts on a tropical island.
After they have all gone to sleep at night, one of the men awakens and, not
trusting the others, decides to take his share. He divides the coconuts into four
equal piles, except for one remaining coconut, which he gives to the monkey.
He then hides his share, puts the other piles together, and goes back to sleep.
Each of the other men awakens during the night and does likewise, and every
time there is one coconut left over for the monkey. In the morning all the men
awake, divide what's left of the coconuts into four, and again there is one left
over that is given to the monkey. Find the minimum number of coconuts that
could have been in the original pile.
Transcribed Image Text:Four men and a monkey spend the day gathering coconuts on a tropical island. After they have all gone to sleep at night, one of the men awakens and, not trusting the others, decides to take his share. He divides the coconuts into four equal piles, except for one remaining coconut, which he gives to the monkey. He then hides his share, puts the other piles together, and goes back to sleep. Each of the other men awakens during the night and does likewise, and every time there is one coconut left over for the monkey. In the morning all the men awake, divide what's left of the coconuts into four, and again there is one left over that is given to the monkey. Find the minimum number of coconuts that could have been in the original pile.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Sequence
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,