Preview Activity

Print preview

Highlight workspace

Worksheet Preview Activity

Let’s get a feel for the sequence from the Towers of Hanoi puzzle. Use Figure 4.1.1 to answer the following questions.

🔗

1. Towers of Hanoi data.

(a)

What is the smallest number of moves required to transport 2 disks to another pillar?

🔗

(b)

What is the smallest number of moves required to transport 3 disks to another pillar?

🔗

(c)

What is the smallest number of moves required to transport 4 disks to another pillar?

🔗

(d)

To find the smallest number of moves required to transport 5 disks to another pillar, let’s try to relate this task to the task of moving 4 disks. How many moves do each of the following tasks require?

Move the 4 smallest disks to the second pillar: moves.
🔗

🔗
Move the largest disk to the third pillar: moves.
🔗

🔗
Move the 4 smallest disks to the third pillar (on top of the largest disk): moves.
🔗

🔗