Loading ...
Sorry, an error occurred while loading the content.
 

Re: new Mersenne Divisors conj.

Expand Messages
  • djbroadhurst
    ... Henri has remarked (off list) that he had already given essentially the same proof as Bill, in 1998: http://www.primenumbers.net/Henri/us/NouvTh1us.htm
    Message 1 of 4 , Jan 16, 2010
      --- In primenumbers@yahoogroups.com,
      "djbroadhurst" <d.broadhurst@...> wrote:

      > http://primes.utm.edu/notes/proofs/MerDiv2.html proves that
      > 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.

      Henri has remarked (off list) that he had already given
      essentially the same proof as Bill, in 1998:

      http://www.primenumbers.net/Henri/us/NouvTh1us.htm

      It's always good to see clear minds agreeing.

      David
    Your message has been successfully submitted and would be delivered to recipients shortly.