__The Monkeys and Coconuts Problem__

**Source:**

https://tomcircle.wordpress.com/2013/03/30/monkeys-coconuts-problem/

This famous problem was said to be created by the Nobel Physicist (Quantum Physics) Prof Paul Dirac, which he told another Chinese Nobel Physicist Prof Li ZhengDao (aka T.D. Lee 李政道)。

Prof Li wanted to test the Chinese young students in the first China Gifted Children University of 13 year-old kids, but none of them could solve this problem.

The first 2 solutions were given by Prof Paul Richard Halmos, the 3rd solved by myself using the Singapore Modelling Math (a modified graphical version of Arithmetics “算术” from the traditional Chinese Math taught in late 1960s Singapore Chinese Secondary 1 “中学数学”).

**1st Solution: Higher Math (Sequence) **

https://tomcircle.wordpress.com/2013/03/30/solution-1-monkeys-coconuts/

**2nd Solution: Linear Algebra (Eigenvalue and Eigenvector)**

https://tomcircle.wordpress.com/2013/03/30/solution-2-monkeys-coconuts/

Prof Halmos did not explain well his eigenvalue equation. I try below to explain his beautiful solution.

Notice the 5 iterations (from inner brackets to outer brackets) of the linear transformation

It means:

Let x (the coconuts) be the vector under the transformation of S(x), which simply is

“* coconuts less 1, then give 4/5 of remaining coconuts to next monkey”*.

Since **before** and **after** each iteration (transformation), the coconut ‘state’ remains unchanged (analogy: a balloon before and after the ‘transformation’ **deflation** is still a balloon), because the next iteration is still the same as before as:

“* coconuts less 1, then give 4/5 of remaining coconuts to next monkey”*.

By Linear Transformation definition:

where the transformation matrix A here is S(x).

The ‘unchanged’ transformation implies the vector x is **unaffected**, its eigenvector (x) after S(x) is neither shortened nor lengthened by the eigenvalue .

that is

Hence,

Solving this equation, we get

But coconuts cannot have -4 quantity!

This whole expression must give a whole number for coconuts, then the inner x divided by must be also a whole number.

That is possible only if x is multiple of

The solution (x = – 4) is therefore amongst the multiples of .

We write in Modular math expression:

The minimum positive x :

** [QED]**

**Note:**

I have a revelation just now on the “Monkeys & coconuts” — subconscious at work 🙂

is *really* the answer from Prof Halmos’s 2nd solutions, because it tells us that we need, *at the initial stage*,

**to ‘borrow’ 4**” ( the meaning of

**– 4**) more coconuts to be divided into 5 groups.

If go 6 iterations, then

In General, for **m** monkeys (iterations) is

or

https://tomcircle.wordpress.com/2013/03/30/solution-2-monkeys-coconuts/

Ref: Intrinsic meaning of eigenvectors and eigenvalues

**3rd Solution: Singapore Modelling Math for PSLE (Primary 6)**

https://tomcircle.wordpress.com/2013/03/30/solution-3-best-monkeys-coconuts/

**4th Solution:**

From the 2nd solution, we can deduce the general solution for:

**m** Monkeys (iterations)

**c** number of Coconut groups at each iteration

**r** Remaining coconuts at each iteration (r < c) thrown to sea

The initial quantity of coconuts (x) :

Verify: m =7, c = 6 , r =3

Minimum

Ref: here is another version of the same problem:

http://qedinsight.wordpress.com/2011/05/13/the-coconut-problem/

**Application:**

This problem can be extended to the division of heritage (H units of assets) of a richman to m closed relatives, at each iteration divide H into c groups, left 1 unit for Charity.

Then

If 3 relatives, divide into 2 groups left 1 unit to Charity,

Minimum units

1st: wife : 7/2 = **3** …1

2nd: son: 7 – 3 -1 = 3 => 3/2= **1**…1

3rd: grand-son: 3-1-1= 1 => 1/2 = **0 ** …1

Left: 7 – 3 – 1- 0 – (1+1+1) = 0

If 1 unit = $1,000,000

The min. heritage is __$7 million__:

Wife gets $3 m,

Son gets $1 m,

nothing for Grandson (not to spoil him),

Charity benefits $3 m.