Re: Quickly finding large primes
 From: willo_thewisp@xxxxxxxxxxx
 Date: 20 Apr 2006 20:45:34 0700
Besides the proof is trivial that given
p^2  2 = 0 mod p
factors of p^2  2 can only be primes with a quadratic residue of 2.
Of course, the proof is *also* trivial that given
p^2  2 = 0 mod p
then p *equals* 2.
I think it's funny that James is too dumb to notice this!
.
 References:
 Quickly finding large primes
 From: jstevh
 Re: Quickly finding large primes
 From: David Eather
 Re: Quickly finding large primes
 From: jstevh
 Quickly finding large primes
 Prev by Date: Re: Tiny table AES implementation
 Next by Date: Re: Quadratic residue method for finding primes
 Previous by thread: Re: Quickly finding large primes
 Next by thread: Re: Quickly finding large primes
 Index(es):
Relevant Pages
