Prove by induction that the minimum possible number of moves needed to solve the Towers of Hanoi satisfies the same recurrence.