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

Re: [PrimeNumbers] trial division

Expand Messages
  • Josechu Gonzalez
    The small Darío Alpern s applet in this page: http://www.alpertron.com.ar/ECM.HTM also certifies it is a prime in a fraction of second. (On a 1.13 GHz
    Message 1 of 4 , May 2, 2007
    • 0 Attachment
      The small Darío Alpern's applet in this page:

      http://www.alpertron.com.ar/ECM.HTM

      also certifies it is a prime in a fraction of second. (On a 1.13 GHz
      Pentium.)


      Josechu



      On 5/2/07, aldrich617 <aldrich617@...> wrote:
      >
      > Trial division can be an easy and predictable way to verify
      > primality if the number is not too large. I am hoping that
      > someone who has a commercial factoring program will check
      > the time it takes to verify that 1986619529684749961 is prime.
      > My little homemade program takes about 160 seconds on a
      > pentium3 866 Dell. This prime is only special in that it
      > appears on a proved +1 mod 10 sequence. If this were not known
      > it would take my program 640 seconds to resolve.
      >
      > aldrich
      >
      >
      >


      [Non-text portions of this message have been removed]
    Your message has been successfully submitted and would be delivered to recipients shortly.