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

2 SPRP tests

Expand Messages
  • paulunderwooduk
    Hi, referencing: http://www.gpgpgpu.com/gecco2009/6.pdf from: http://www.mersenneforum.org/showthread.php?p=235821#post235821 it is nice to see that a 350-SPRP
    Message 1 of 3 , Nov 6, 2010
    View Source
    • 0 Attachment
      Hi,

      referencing:
      http://www.gpgpgpu.com/gecco2009/6.pdf
      from:
      http://www.mersenneforum.org/showthread.php?p=235821#post235821
      it is nice to see that a 350-SPRP test combined with a 3958281-SPRP test id good for all n<170,584,961.

      Compare with CC's page:
      http://primes.utm.edu/glossary/xpage/StrongPRP.html
      "If n < 9,080,191 is both a 31 and 73-SPRP, then n is prime"

      Paul
    • Chris Caldwell
      From: primenumbers@yahoogroups.com [mailto:primenumbers@yahoogroups.com] On Behalf Of paulunderwooduk ... test id good for all n
      Message 2 of 3 , Nov 6, 2010
      View Source
      • 0 Attachment
        From: primenumbers@yahoogroups.com [mailto:primenumbers@yahoogroups.com]
        On Behalf Of paulunderwooduk
        > ... referencing: http://www.gpgpgpu.com/gecco2009/6.pdf
        > it is nice to see that a 350-SPRP test combined with a 3958281-SPRP
        test id good for all n<170,584,961.

        Excellent--I hope these are continually improved because they are useful
        for very small numbers.
      • Andrey Kulsha
        ... A table lookup is still faster IMHO. Best regards, Andrey [Non-text portions of this message have been removed]
        Message 3 of 3 , Nov 6, 2010
        View Source
        • 0 Attachment
          > Excellent--I hope these are continually improved because they are useful
          > for very small numbers.

          A table lookup is still faster IMHO.

          Best regards,

          Andrey

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