Mersenne Numbers

[Hans Aberg]

At 12:47 +0200 2005/06/03, Torbjorn Granlund wrote:
>"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
>   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.

One might try the newsgroup sci.math, also asking for number theory 
lists interested in Mersenne numbers; or try to Google a number 
theory list. One should be aware of that announcements (not inquires) 
of new mathematical software, at least in the past, was accepted to 
the otherwise tightly moderated newsgroup sci.math.research. It might 
be the case that an announcement with a question of where to donate 
the code slips through the moderator.
-- 
   Hans Aberg