View Single Post
Old 2021-11-26, 05:21   #3
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

34×53 Posts
Default

Quote:
Originally Posted by kijinSeija View Post

q=29;Wq=(2^q+1)/3;S0=(2^(q-2)+1)/3;print(q," ",Wq);print(Mod(S0,Wq));S=S0;for(i=1,q-1,S=Mod(S^2-2,Wq);print(S))

This is a viable test or not ?
This looks promising. Prove it, if you can.

You might write the code as:

Code:
wag(q)=W=(2^q+1)/3;S0=S=Mod((2^(q-2)+1)/3,W);for(i=2,q,S=S^2-2);S==S0;

Last fiddled with by paulunderwood on 2021-11-26 at 08:20
paulunderwood is offline   Reply With Quote