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

sufficent test for primes mod 4 = 3

Expand Messages
  • Bernhard Helmes
    A beautifull day, i have develloped a test for prime numbers mod 4 = 3. It recognize all primes mod 4 = 3 below 10^9. It uses complex numbers and needs only a
    Message 1 of 1 , Apr 30, 2008
    • 0 Attachment
      A beautifull day,

      i have develloped a test for prime numbers mod 4 = 3.
      It recognize all primes mod 4 = 3 below 10^9.
      It uses complex numbers and needs only a fermat test.
      If you are interested you will find it under

      http://www.devalco.de/helmes_test.htm

      I will try to generalize it.

      Best greetings from the primes
      Bernhard Helmes
    Your message has been successfully submitted and would be delivered to recipients shortly.