This is my last post and so I will prove the least number of moves to complete a Towers of Hanoi of stack n is T(n) = 2*T(n-1) + 1 using mathematical induction.
P(n): It will take twice the number of moves plus one to move the entire stack of n discs from one pole to a single other stack.
Base Case: n = 1
It will take exactly 1 move to shift a single disc to another
Induction Step:
Assume P(n) is true and n is a natural number, then it will take T(n) moves to move n stack of discs from one pole to another. Then for n+1 stacks of discs, it is necessary to move n stack of disc to a different pole before moving the final disc. After moving said disc, it is necessary to move all the n stack disc back onto the (n+1)th disc. This means that it takes T(n+1) = 2*T(n)+1 turns to move n+1 discs onto another pole. Since P(n) implies P(n+1), then P(n) is true for all natural numbers.