Solve infinitely many cases of the four-peg Tower of Hanoi problem by proving that equality holds in the relation of exercise 17. exercise 17: If W n is the minimum number of moves needed to transfer...

Solve infinitely many cases of the four-peg Tower of Hanoi problem by proving that equality holds in the relation of exercise 17.

exercise 17:

If W_n
is the minimum number of moves needed to transfer a tower of n disks from one peg to another when there are four pegs instead of three, show that

(Here T_n
= 2ⁿ
− 1 is the ordinary three-peg number.) Use this to find a closed form f(n) such that