Discussion group for PrimeFormGW (PFGW) primality-testing program. Use the list to discuss anything prime-related. Theory, algorithms,
methods, and other computer programs are suitable topics.
OpenPFGW v1.2 - Official Release Feb 11, 2005 Win32 (95/98/ME/NT/2000/XP)
Linux binary Static linked Linux binary
FULL Source code Builds under Win32 and Linux, and other x86 systems
Download the correct version for your OS and unzip to a location of your choice. The packages include full instructions, information, and a tutorial. Open a command prompt or a shell, and you're ready to go!
Following the same construction as for 180, I got: AP189: pp97^2 + 24*61#*i, for i=-126...62 where pp97=97#/61# q[-93]=1 (mod 315) q[0]=1 (mod 763048) Bits
... Jaroslaw Wroblewski <Jaroslaw.Wroblewski@...> wrote:> ... Yes, it's difficult to reconcile all the desiderata. As I emphasized, your successful AP180 came
Oooops, I am very very sorry, I take it back. I forgot that N must be a square and in this case it is not. This construction is incorrect. So the last bid is
AP193: 113#/61# + 18*61#*i for i =-126...66 q[0]=1 (mod 480720240) 9.088221267417938382229896738704326597987823 E4986 bits Taking p[0] as a square is not as