Hi,
In Chapter 2.V "Primality Tests Based on Lucas Sequences"
of Paulo Ribenboim's "Little Book of Bigger Primes" book,
2nd Edition, 2004, page 63, it is said that this kind of
primality tests "require the knowledge of prime factors
of N+1", meaning that they apply only to numbers of the
form N-1, like Mersenne numbers with LLT:
s(0)=4 , s(n+1)=s(n)^2-2
s(q-2)=0 (mod Mq) ==> Mq is prime
Do you know if that means the Lucas sequences and LLT are
never used for proving the primality of numbers of the
form N+1, like Fermat numbers, because it's impossible,
or because it's possible but inefficient ?
In that last case, do you have exemples ?
Thanks
T.Rex
Carpe Diem
Acc�dez au courrier �lectronique de La Poste : www.laposte.net ;
3615 LAPOSTENET (0,34�/mn) ; t�l : 08 92 68 13 50 (0,34�/mn)
_______________________________________________
Prime mailing list
[EMAIL PROTECTED]
http://hogranch.com/mailman/listinfo/prime
