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

Re: double mersenne prime

Expand Messages
  • David Broadhurst
    ... But that s ludicrous, even by your low standards of coherence, since Fermat s little theorem shows that (2^n - 1 - (n+2))/n is not an integer when n is
    Message 1 of 3 , Jun 29, 2009
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      sta staf <sta_staf@...> wrote:

      > sory i mean n+1 is the second odd after n
      > is personel expersion (sory)

      > p = (2^n)-1 : is mersenne numbre :
      > if (p - (n+2)) /n = prime ...

      But that's ludicrous, even by your low
      standards of coherence, since Fermat's
      little theorem shows that
      (2^n - 1 - (n+2))/n
      is not an integer when n is prime.

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