9004Re: [PrimeNumbers] RE: Largest Ordinary Prime?
- Sep 30, 2002On Mon, 30 Sep 2002, David Broadhurst wrote:
> Ordinary it ain't, since it was possible, with a hugeAlso, major efficiency gains can be realized for simple arithmetic with a
> effort by Paul Underwood, Bouk de Water, Paul Leyland
> and myself, to factorize 30.08% of N+1=2^15*(2^64680-1)
> and hence to prove N prime using Konyagin-Pomerance.
number with such a sparse binary representation. Whether the code
actually exploited those efficiencies I don't know.
- << Previous post in topic Next post in topic >>