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

100% prime nonsense

Expand Messages
  • David Broadhurst
    ... Indeed, Norman :-) Moreover, it is very easy to find a 252-digit prime factor of Rachid s 100% prime nonsense , using Richard Brent s 40-digit prime
    Message 1 of 9 , Jun 27, 2009
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      Norman Luhn <nluhn@...> joked:

      > > 2^131072-1 (A NEW Mersenne prime with 39457 digits)
      > > is 100% PRIME

      > Ops , I found the factor
      > 5704689200685129054721
      > with 22 digits.

      Indeed, Norman :-)

      Moreover, it is very easy to "find" a 252-digit prime
      factor of Rachid's "100% prime nonsense", using
      Richard Brent's 40-digit prime factor of 2^131072 - 1:

      p40 = 4659775785220018543264560743076778192897;
      print(lift(Mod(2,p40)^131072))
      1

      p252 = (2^1024 + 1)/(45592577*6487031809*p40);
      print(lift(Mod(2,p252)^131072))
      1

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