|
|
|
|
|
|
|
|
Date: Wed 2/10/99 3:22 AM
From: Don Bowen
I first read this problem in a book a few hours ago. After going to bed I began thinking about it & believed I had solved it. (Flip the biggest one to the top and then flip the whole stack) The final flip would place two pancakes at once. I got up & wrote down a formula that I believed would work. 2n-2= maximum flips. I logged on and found your site. I know that my theory is correct, but is my formula?
Regards,
Don
Copyright © 1996-2009 Alexander Bogomolny
| 33062582 |  |
