Thread: Proth primes View Single Post
2019-07-31, 12:23   #4
Dylan14

"Dylan"
Mar 2017

22×112 Posts

Quote:
 Originally Posted by Chara34122 I'm interested. Besides, today I've found one: 305147*2^1030527+1 (310226 digits long) from http://irvinemclean.com/maths/sierpin3.htm . How can I check it for being a Fermat, GF, xGF divisor?
You could use pfgw to test the number for Fermat divisibility. You’ll want to use the -gxo flag (which does the tests without testing to see if the number is prime). An appropriate command line for Windows would be

Code:
pfgw64 -gxo -q”305147*2^1030527+1”