would this work?
dividing it by 1/5 each time and minusing 1?
On a desert island, five men and a monkey gather coconuts all day, then sleep.
The first man awakens and decides to take his share. He divides the coconuts into five equal shares with one left over. He gives the extra one the, hides his share and goes back to sleep. Later the second man awakens and takes his fifth from the remaining pike; he too finds one extra one and gives it to the monkey. Each of the remaining three men does likewise in turn. Find the minimum number of coconuts originally present.
I need a full explanation + answer please.
I tried starting off with
Would I do this but adding 1 each time?
Using the fact that the difference between the amount of coconuts after each step must be an integer, and the difference is multiplied by 4/5 after each step, the first difference must be divisible by 5^4 so that the last difference is an integer. The smallest such difference is 625, which gives you an initial coconut count of 3121.
Hello, Mukilab!
This is a classic problem: "The Monkey and the Coconuts".
It has a long (but very elementary) solution.
The original problem concluded with:On a desert island, five men gather coconuts all day, then sleep.
The first man awakens and decides to take his share.
He divides the coconuts into five equal shares with one left over.
He gives the extra one to the monkey, hides his share,
puts the remaining coconuts in a pile, and goes back to sleep.
Later the second man awakens and takes his fifth from the remaining pile.
He too finds one extra one and gives it to the monkey.
Each of the remaining three men does likewise in turn.
Find the minimum number of coconuts originally present.
. . In the morning, the five men innocently divided the remaining coconuts.
. . This time the division came out even; no coconut for the monkey,.
Let = the original number of coconuts.
The first man divided them into 5 equal piles with one left over: .
He hid his coconuts and put the coconuts in a pile.
The second man divided them into five piles with one left over: .
He hid his coconuts and put the coconuts in a pile.
The third man divided them into five piles with one left over: .
He hid his coconuts and put the coconuts in a pile.
The fourth man divided them into five piles with one left over: .
He hid his coconuts and put the coconuts in a pile.
The fifth man divided them into five piles with one left over: .
He hid his coconuts and put the coconuts in a pile.
In the morning, they divided them into five equal piles: .
From [6]: .
Since is an integer, is a multiple of 4: .
Then we have: .
Substitute into [5]: .
We have: .
Since is an integer, must be a multiple of 4: .
Then we have: .
Substitute into [4]: .
Then: .
Since is an integer, must be a multiple of 4: .
Then we have: .
Substitute into [3]: .
Then: .
Since is an integer, must be a multiple of 4: .
Then we have: .
Substitute into [2]: .
Then: .
Since is an integer, is a multiple of 4: .
Then we have: .
Substitute into [1]: .
. . . . and we have: .
The least occurs when
. . Therefore: .