Ononot — The number of moves in the Tower of Hanoi for n disks is Tn

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursioneasy

0:00.0

The number of moves in the Tower of Hanoi for $n$ disks is $T_n = 2T_{n-1} + 1$ with $T_1 = 1$ . What is $T_3$ ?