Re: new Mersenne Divisors conj.
- --- In email@example.com,
"djbroadhurst" <d.broadhurst@...> wrote:
> http://primes.utm.edu/notes/proofs/MerDiv2.html proves thatHenri has remarked (off list) that he had already given
> if p = 3 mod 4 and p is prime,
> then 2p+1 is prime iff 2p+1|2^p-1
> Bill claims that
> if p = 1 mod 4 and p is prime,
> then 2p+1 is prime iff 2p+1|2^p+1
> and his facsimile proof looks good to me.
essentially the same proof as Bill, in 1998:
It's always good to see clear minds agreeing.