Does anyone know any usefull routines, for proving primes of the form 2^p-1.
These are othwise known as Mersenne primes, since the exponent p is always prime too.

To learn more about them see:
http://mersenneforum.org/

Or see my section here:
http://www.mersenneforum.org/forumdisplay.php?f=16