> > And below M36000000, there are 159,975 exponents (again repeating Brian)
> > with at least 10 million digits.
>
> Fine, but are the efforts being made in that region centrally registered?
Not to my knowledge - seems pointless since few programs currently
available can cope with exponents in the 30 millions. Prime95 v19 is
still some way off, the early pre-pre-pre-release I have (as part of
the QA team) won't accept exponents that big for factoring
assignments, though it can attempt LL tests!
Of course it's very quick to generate lists of prime numbers in the
30 millions by sieving. I stopped at 36 million because I thought
that would yield more than enough work to start with!
Out of interest, I also wrote a quick-and-dirty program to check for
small (< 2^32) factors of Mersenne numbers, ran that against my list
of primes & eliminated 28,468 of the 159,975 candidates. (A 15-minute
run on a PII-350). I need to check these & will post the files on my
ftp server when I've done so.
Regards
Brian Beesley
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
