# 31

This number is a prime.

Single Curio View: (Seek other curios for this number)

The minimal number of moves required in a Tower of Hanoi puzzle containing five discs. The general solution to this puzzle requires a Mersenne number (i.e., 2^n - 1) of moves, where *n*is the number of discs.

Submitted: 1999-09-02 23:40:00; Last Modified: 2009-07-23 00:39:31.

Printed from the PrimePages <t5k.org> © G. L. Honaker and Chris K. Caldwell