Dynamic Manipulations

Stan Wagon ()
Additional contact information
Stan Wagon: Macalester College, Department of Mathematics and Computer Science

Chapter 5 in Mathematica in Action, 2010, pp 141-167 from Springer

Abstract: Abstract The diagram illustrates the first eight and the next-to-last moves of a very surprising puzzle. Take a round cake with icing only on the top. Cut out a piece making an angle of 1 radian at the center, turn it upside-down, and reinsert it into the cake. Then move 1 radian clockwise and do the same with a second piece. Continue this process in the clockwise direction. The question is: Will all the icing ever return to the top? Because 1 is not commensurable with π, the natural inclination is to say NO. But in fact the icing does return to the top after 84 moves. And no matter what angle is chosen for the pieces, the icing returns to the top in finitely many moves.

Keywords: Vector Field; Option Inspector; Shadow Seed; True Trajectory; Show Equality (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-75477-2_6

Ordering information: This item can be ordered from
http://www.springer.com/9780387754772

DOI: 10.1007/978-0-387-75477-2_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().