  The Frame-Stewart conjecture states the least number of moves to solve a
generalized Tower of Hanoi problem, of n disks and p pegs. In this paper, we
prove a weaker version of the Frame-Stewart conjecture.
