Mersenne Numbers

Torbjorn Granlund tege at
Fri Jun 3 12:47:48 CEST 2005

"Sayan Chakraborti" <sayanchak at> writes:

  I have written a small function and a demo program which tests the primality
  for Mersenne Numbers.
  It takes a number p as argument. If p is a prime it evaluates 2^p -1, the
  corresponding Mersenne Number, and tests its primality using a deterministic
  Lucas-Lehmer Test.
  I would like to contribute this piece of code. I would also be happy to work
  on other primality and factorization functions. Will it be of use to GMP?
Unfortunately, such functions fall outside of what we aim at
providing with GMP.

Please see and for suggestions of possible
volunteer projects.


More information about the gmp-discuss mailing list