What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?

We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.