Question: Use mathematical induction to verify the formula derived in Example for the number of moves required to complete the Tower of Hanoi puzzle
Example: The Tower of Hanoi A popular puzzle of the late nineteenth century invented by the French mathematician Édouard Lucas, called the Tower of Hanoi, consists of three pegs mounted on a board together with disks of different sizes. Initially these disks are placed on the first peg in order of size, with the largest on the bottom (as shown in Figure). The rules of the puzzle allow disks to be moved one at a time from one peg to another as long as a disk is never placed on top of a smaller disk. The goal of the puzzle is to have all the disks on the second peg in order of size, with the largest on the bottom.
![2192_1.png](https://secure.tutorsglobe.com/CMSImages/2192_1.png)