CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Products to download and subscription Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Seven Dwarves Problem!"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange High school Topic #256
Reading Topic #256
jman_red
guest
Jul-30-03, 08:38 AM (EST)
 
"Seven Dwarves Problem!"
 
   The seven dwarves are sitting around a table while Snow White is gone shopping. Each dwarve has a cup with milk in it, and the total amount of milk at the table is 3 cups. Happy, sitting at the head of the table, takes his milk and gives it all away to the other dwarves, so that each other dwarf gets the same amount of Happy's milk. Then the dwarf to the right of happy does the same, evenly giving away his milk. Every dwarf does this until it comes back to happy, when they all examine their cups and realize that they have the same amount they started with!


A: how much milk did each dwarf have?
B: how many different milk combinations are possible?
(show proof)

Good luck!
Much Trickier than it'seems!


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Vladimir
Member since Jun-22-03
Jul-31-03, 06:16 PM (EST)
Click to EMail Vladimir Click to view user profileClick to add this user to your buddy list  
1. "RE: Seven Dwarves Problem!"
In response to message #0
 
   LAST EDITED ON Jul-31-03 AT 06:36 PM (EST)
 
I find your puzzle contradictory. Either each dwarf is giving up in each step only the milk he or she had at the start of the exchange and then the solution is trivial (contradiction with "much trickier than it'seems" ). Or each dwarf is giving up in each step all the milk he or she currently has. Then the 7th dwarf has his or her cup empty at the end of the exchange and this state is indentical with the initial state (contradiction with "each dwarf has a cup with milk in it", meaning no cup is empty). Please specify how the dwarfs give up their milk.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Vladimir
Member since Jun-22-03
Aug-05-03, 00:34 AM (EST)
Click to EMail Vladimir Click to view user profileClick to add this user to your buddy list  
2. "RE: Seven Dwarves Problem!"
In response to message #0
 
   LAST EDITED ON Aug-11-03 AT 05:41 AM (EST)
 
Hi jman_red

You think I am trying to be funny, don't you? (I am.)

Suppose that each dwarf gives up in each step all the milk he or she currently has. Call xi the amount of milk the i-th dwarf starts with. Create a 7 dimensional vector space above the ring of 7 dwarfs. The 7th dwarf must end up with no milk, which must be identical with the initial state. Therefore, x7 = 0. The following vector obviously is the solution, because the dwarfs just cycle the milk around the table with no change (what else can you expect from dwarfs with no babysitter?)

|x> = |x1, x2, x3, x4, x5, x6, x7> = |x1, 5/6·x1, 4/6·x1, 3/6·x1, 2/6·x1, 1/6·x1, 0>

Since

S7i=1 xi = 3
21/6·x1 = 3
x1 = 6/7

|x> = |6/7, 5/7, 4/7, 3/7, 2/7, 1/7, 0>

and this is the only solution. But you want the proof. Well, you asked for it. Let me define 7 linear operators on the vector space of 7 dwarfs as follows:

F1|x> = |0, x2 + x1/6, x3 + x1/6, x4 + x1/6, x5 + x1/6, x6 + x1/6, x7 + x1/6>
F2|x> = |x1 + x2/6, 0, x3 + x2/6, x4 + x2/6, x5 + x2/6, x6 + x2/6, x7 + x2/6>
...
F7|x> = |x1 + x7/6, x2 + x7/6, x3 + x7/6, x4 + x7/6, x5 + x7/6, x6 + x7/6, 0>

Each of these operators corresponds to one step in the milk exchange and their product F to the one full round:

F|x> = F7F6F5F4F3F2F1|x>

Next, I have to define a metric on the the vector space of 7 dwarfs - this will make it a Banach metric space of 7 dwarfs. The usual euclidian metric d will do:

d2(|x>, |y>) = S7i=1 (xi - yi)2

For arbitrary 2 vectors |x> and |y> such that

S7i=1 xi = S7i=1yi (= 3)

the operators F1, F2, ..., F7 produce vectors such that

|u> = Fk|x>
|v> = Fk|y>

S7i=1 ui = S7i=1vi (= 3)

For the operator F1, the distance of the vectors |u> = F1|x> and |v> = F1|y> is

d2(F1|x>, F1|y>) = S7i=2 (xi + x1/6 - yi - y1/6)2 =

= S7i=2 (xi - yi)2 + 2/6·(x1 - y1) S7i=2 (xi - yi) + 1/6·(x1 - y1)2 =

= S7i=2 (xi - yi)2 - 1/6·(x1 - y1)2 £ d2(|x>, |y>)

where the equal sign is valid only for x1 = y1. In the last step I used:

S7i=1 (xi - yi) = 0
S7i=2 (xi - yi) = -(x1 - y1)

Similarly for the other operators F2, F3, ..., F7:

d2(Fk|x>, Fk|y>) = Si¹k (xi - yi)2 - 1/6·(xk - yk)2 £ d2(|x>, |y>)

where the equal sign is valid only for xk = yk. Let k be the index for which the difference between xk and yk is maximum:

(xk - yk)2 = max{(xi - yi)2}, i = 1, 2, ..., 7

The difference for this index will be still a maximum after the application of the operators F1, ..., Fk-1 (if any). Denote

|u> = Fk-1...F1|x>
|v> = Fk-1...F1|y>

(uk - vk)2 = max{(ui - vi)2}, i = 1, 2, ..., 7

d2(Fk|u>, Fk|v>) = Si¹k (ui - vi)2 - 1/6·(uk - vk)2 = d2(|u>, |v>) - 7/6·(uk - vk)2 £

£ d2(|u>, |v>) - 1/6·d2(|u>, |v>) = 5/6·d2(|u>, |v>)

For the full round operator F I get

d2(F|x>, F|y>) = d2(F7F6F5F4F3F2F1|x>, F7F6F5F4F3F2F1|y>) £

£ d2(FkFk-1......F1|x>, FkFk-1......F1|y>) £

£ 5/6·d2(Fk-1......F1|x>, Fk-1......F1|y>) £

£ 5/6·d2(|x>, |y>)

I proved that for vectors |x> and |y> such that

S7i=1 xi = S7i=1yi (= 3)

the full round operator F on the Banach metric space of 7 dwarfs is a contracting operator with the coefficient of contraction a £ Ö(5/6) < 1. According to the fixed-point theorem, a contracting operator on the Banach metric space has a unique fixed point such that

|xF> = F|xF>

Moreover, if |x0> is an arbitrary vector in the Banach metric space of 7 dwarfs such that

S7i=1 x0i = 3

the sequence |x0>, |x1>, |x2>, ... defined by

|xk+1> = F|xk>

is convergent with respect to the metric d:

lim d(|xk>, |xF>) = 0 for k ® ¥

Q.E.D.

Could we do this for an infinite number of dwarfs ?


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Andy
guest
Oct-04-07, 10:05 AM (EST)
 
3. "RE: Seven Dwarves Problem!"
In response to message #0
 
   Another way to solve this is to make a 7x7 transition matrix for each of the dwarves' charity. Multiply these together to form a new 7x7 matrix, and find its eigenvectors. The solution is given by an eigenvector with an eigenvalue of 1.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
mr_homm
Member since May-22-05
Oct-04-07, 06:40 AM (EST)
Click to EMail mr_homm Click to send private message to mr_homm Click to view user profileClick to add this user to your buddy list  
4. "RE: Seven Dwarves Problem!"
In response to message #3
 
   I didn't notice this puzzle before. Here is a solution that generates Vladimir's answer and proves it is unique (without using contracting operators on Banach spaces, although swatting this particular fly with that particular sledgehammer WAS rather funny):

Since the last dwarf (suppose it's Dopey) empties his cup at the last step, he must have had an empty cup to start with. He has received milk at the some step and has never given any yet, so he still has milk in his cup just before the last step. Therefore, each of the other dwarves receives some of his milk, and so they cannot have empty cups after the last step. Therefore, Dopey has the only empty cup.

Now suppose there is more than one solution, x_1, ... x_7 and y_1, ... y_7. In each solution Dopey has an empty cup (i.e. x_7 = y_7 = 0), and there is a dwarf (Grumpy) with the greatest ratio r = x_i/y_i . We know r>1, since if the solutions are different and no ratio exceeds 1, then the total quantity of milk cannot be the same in both solutions as required. Since the process is linear, any linear combination of solutions will be another solution, provided there is a nonnegative amount of milk in each cup and that the total is 3 cups. Then z_k = (r*y_k - x_k)/(r-1) is a solution in which Grumpy has no milk, all other quantities of milk are nonnegative, and the total quantity of milk is still as specified. This is a contradiction, since only Dopey has an empty cup.

Therefore, there is a unique solution. Now since the process returns to its starting value after 7 steps, the cycle will repeat, so if one starts the problem at step k and goes to step k+7, the problem will be precisely the same. Since the solution is unique, then the distribution of milk after k steps must be precisely the same as it was originally, but shifted k places around the cycle. But this means that the dwarf who is giving away his milk at each step is giving the SAME amount as Happy did originally. Therefore, each dwarf has a quantity of milk that is increasing in equal increments until it is his turn to give it all away.

Thus the quantities of milk at the start DECREASE in equal increments and end at zero. Therefore, they must be 6x, 5x, 4x, 3x, 2x, 1x, and 0. Since the sum is 21x, which must be 3 cups, x=1/7, and so the solution is 6/7, 5/7, 4/7, 3/7, 2/7, 1/7, 0.

--Stuart Anderson


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Ron Jones
guest
Oct-05-07, 01:57 PM (EST)
 
5. "RE: Seven Dwarves Problem!"
In response to message #4
 
   You should have stated that each dwarf started with a non-negative quantity of milk. The fact that one cup is empty is obvious but contradicted by the original statement.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK