Show that, in the process of transferring a tower under the restrictions of the preceding excercise, we will actually encounter every properly stacked arrangement of n disks on three pegs. Tower of hanoi problem. Solution Let call the three pegs Src (Source), Aux (Auxiliary) and Dst (Destination). To better understand and appreciate the following solution you should try solving the puzzle for small number of disks, say, 2,3, and, perhaps, 4. However one solves the problem, sooner or later the bottom disk will have to be moved from Src to Dst. At this point in time all the remaining disks will have to be stacked in decreasing size order on Aux. After moving the bottom disk from Src to Dst these disks will have to be moved from Aux to Dst. Therefore, for a given number N of disks, the problem appears to be solved if we know how to accomplish the following tasks:.

1. Similar and Nonsimilar Shapes Name Find the pairs of shapes that are similar. What makes
them similar? Navigating through Geometry in Grades 3-5 Copyrighte 2001 by the National
Council of Teachers of Mathematics. Inc. wwwnc All rights reserved
Solution
Two shapes are Similar when the only difference is size (and possibly the need to move, turn or
flip one around).
Similar = 1, 3, 4, 6
non-Similar = 2, 5