>
> Do you have a canonical reference on the Strong Lehmer test. As a
> number theorist, I should have heard of it, but to my embarrassment, I
> have not! {blush}
>
> Look: http://mersennewiki.org/index.php/Pocklington%27s_Theorem
in our case f=p. It doesn't mention, but in my number theory book it's
called strong Lehmer test. What I've forgotten that to take a final gcd in
the code, however up to p=10000 and for all r<p there is no counterexample,
but I don't like unproven items, so modified the code at google group.
For the weaker Lehmer test, see
http://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer_testIn fact, what I've used from old gmp versions is also in mpir-1.1.0, so that should be no problem. The newer version of gmp is using a fast checking if a number is a power of two or not for negative inputs. But I'm just shifting in this case the exponent to get an odd number. The gcd function for unsigned int type numbers is not critical, but I replaced my own gcd, because that's faster than Lehmer's binary gcd. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
