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

Cullen Proof

Expand Messages
  • Jon Perry
    First of all please let me apologise for my p.2^p+1 is never prime for p prime failed proof. A re-examination clearly demonstrated the logical flaw. However, I
    Message 1 of 1 , May 2, 2003
    • 0 Attachment
      First of all please let me apologise for my p.2^p+1 is never prime for p
      prime failed proof. A re-examination clearly demonstrated the logical flaw.

      However, I set about the puzzle with renewed vigour, and have discovered
      that if (p,p+2) are twin primes then p+2 divides p.2^p+1. Here goes:

      p.2^p+1 = (p+2).2^p - [ 2^(p+1) - 1]

      If p+2 is a prime, then p+1 = p+2-1, hence 2^(p+1)-1 = 2^((p+2)-1)-1 ==
      0mod(p+2)

      Q.E.D.

      Jon Perry
      perry@...
      http://www.users.globalnet.co.uk/~perry/maths/
      http://www.users.globalnet.co.uk/~perry/DIVMenu/
      BrainBench MVP for HTML and JavaScript
      http://www.brainbench.com
    Your message has been successfully submitted and would be delivered to recipients shortly.