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

Fw: [PrimeNumbers] testing if 32 bit integer is prime number

Expand Messages
  • Ignacio Larrosa Cañestro
    I can send you a simple source code, in the old-fashioned TurboPascal 6.0, for Wheel factorization. It works with numbers less than 2^63 ~=9.233*10^18. For 32
    Message 1 of 1 , Oct 2, 2001
    • 0 Attachment
      I can send you a simple source code, in the old-fashioned TurboPascal
      6.0, for Wheel factorization. It works with numbers less than 2^63
      ~=9.233*10^18.

      For 32 bits, it is quick enough, actually instantaneus on a PIII-500.

      For R(19)=1111111111111111111 (prime) it spend about two minutes.

      Saludos,

      Ignacio Larrosa Cañestro
      A Coruña (España)
      ignacio.larrosa@...
      ICQ #94732648
    Your message has been successfully submitted and would be delivered to recipients shortly.