*Navigation Panel:*

Go backward to Discovering the Mathematics, Continued

Go up to The Tower of Hanoi

Switch to text-only version (no graphics)

Go to University of Toronto Mathematics Network
Home Page

### The Answer

The minimum number of moves it takes to move *n* disks is
.

This page last updated: May 26, 1998

Original Web Site Creator / Mathematical Content Developer:
Philip Spencer

Current Network Coordinator and Contact Person:
Joel Chan - mathnet@math.toronto.edu

*Navigation Panel:*