Hello fellow group members,
After a long time I rear my head by posting a proof for a Wagstaff
number primality test.
This test is similar to the well known Lucas Lehmer test and aslo
uses the iteration s -> S^2-2. Let p>3 and prime, W_p=(1/3)(2^p+1)
then primality is given if and only if S_p = S_2 for S_0 = 6.
The complete proof in a pdf file is in the file section of this forum
(last entry in the list) or you could pick it up on below URL.
http://www.mersenneforum.org/showpost.php?p=144516&postcount=1
I would appreciate feedback especially from David as I really dipped
deep into theory.
I really hope we can move some entries from Henri Lifchitz's list.
best regards
Anton