tege at swox.com
Fri Jun 3 12:47:48 CEST 2005
"Sayan Chakraborti" <sayanchak at peacefulaction.org> 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
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 http://swox.com/gmp/projects.html and
http://swox.com/gmp/tasks.html for suggestions of possible
More information about the gmp-discuss