21464Re: Lucas super-pseudoprime puzzle
- May 24, 2010--- In email@example.com,
"mikeoakes2" <mikeoakes2@...> wrote:
>> n is a solution if and only if it is an oddYes. So far I have run the faster test up to n = 9*10^9.
>> square-free composite integer such that for each prime p|n
>> n = +/- 1 mod p-1 ... 
>> n = +/- 1 mod p+1 ... 
> It might be interesting to program this test as it might be
> significantly faster for large n, not so?
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.
- << Previous post in topic Next post in topic >>