Text
In the optimal solution of the Tower of Hanoi, with the discs numbered from (the smallest) upward, on move number you move the disc whose number is , where is the exponent of the largest power of dividing . Which disc is moved on move ?
Solution
Factor the power of in : so . The disc moved is (Disc , the smallest, moves on every odd move; the larger discs move ever more rarely.)