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

i give a way to find primes 2^p+3

Expand Messages
  • Norman Luhn
    Hi all ! One year ago i had found a fast PRP for primes 2^p+3. I get no comments. We must modify the Luca-Lehmer Test. S=14 For T=1 TO p-1 S=(S^2-2) mod 2^p+3
    Message 1 of 1 , May 1, 2002
      Hi all !

      One year ago i had found a fast PRP for primes 2^p+3.
      I get no comments. We must modify the Luca-Lehmer
      Test.

      S=14
      For T=1 TO p-1
      S=(S^2-2) mod 2^p+3
      NEXT T

      IF the result S=14 then is 2^p+3 a PRP (Prime!)

      You can try it and verify it!!!

      Best wishes

      Norman




      __________________________________________________________________

      Gesendet von Yahoo! Mail - http://mail.yahoo.de
      Sie brauchen mehr Speicher für Ihre E-Mails? - http://premiummail.yahoo.de
    Your message has been successfully submitted and would be delivered to recipients shortly.