RE: [PrimeNumbers] RE: Anyone like to prove primality of a Mersenne cofactor?
Well I would do, but Primo doesn't seem to like wine. Has anyone had any
success with that, or does anyone know of a Linux ECPP tool with comparable
Paul Leyland wrote:
> Will Edgington and I try to keep our tables of Mersenne factorizations
> up to date by synchronizng every week or so. The latest indicated that
> another Mersenne number had been completely factored. Neither Will nor
> I have the resources at the moment to prove the 2193-digit cofactor of
> M(7417) is prime. It's certainly a strong pseudoprime.
> If anyone would care to complete the proof, please let Will and me know
> the result. The known prime factors of M(7417) are 118673, 16269026327
> and 3888241452787718190543521.
> Apologies for not crediting the person who found the largest of the
> three factors given above. I don't know who he or she is.
> *Yahoo! Groups Sponsor*
> Unsubscribe by an email to: firstname.lastname@example.org
> The Prime Pages : http://www.primepages.org/
> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service
- These are the 6 smallest unproven probably prime
Mersenne cofactors known to me:
- --- In email@example.com, "Jon Perry" <perry@g...> wrote:
> How's the factorization of 2^(2^n)-1 coming along?About as well as the factorization of 2^(2^n)+1 (the Fermat numbers).
2^(2^n)-1 == prod(i=0,n-1,2^(2^i)+1)
So, completely factored up to 2^(2^12)-1.
2^(2^13)-1, not yet factored.