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

21464Re: Lucas super-pseudoprime puzzle

Expand Messages
  • djbroadhurst
    May 24, 2010
      --- In primenumbers@yahoogroups.com,
      "mikeoakes2" <mikeoakes2@...> wrote:

      >> n is a solution if and only if it is an odd
      >> square-free composite integer such that for each prime p|n
      >> n = +/- 1 mod p-1 ... [1]
      >> n = +/- 1 mod p+1 ... [2]

      > It might be interesting to program this test as it might be
      > significantly faster for large n, not so?

      Yes. So far I have run the faster test up to n = 9*10^9.
      Confirmation of the claim that the next solution has
      n > 10^10 should not take much longer.

      I did not see Jacobs, Rayes and Trevisan remark
      on the fact that n cannot be divisible 3, so
      please pat yourself on the back, Mike.

      David
    • Show all 33 messages in this topic