Quote:
Originally Posted by storm5510
I was learning to use the ABC2 input type for PFGW early this morning when I came up with these:
Code:
10*2^135091 is 3PRP! (0.0290s+0.0015s)
10*2^217371 is 3PRP! (0.0676s+0.0011s)
10*2^256231 is 3PRP! (0.0805s+0.0011s)
I am not sure about the meaning of "3" in this instance. I know how to calculate the number of digits in 2 ^{p}1. How that translates to something in this format, I do now know.
Thanks.

These are roughly 4200, 7000 and 8500 digits. You can get the exact values with pari/GP with
length(decimal(10*2^135091)).
"3PRP" means it passes Fermat's Little Theorem test: 3^(N1)=1 mod N, which is necessary but not sufficient for a prime. With PFGW you can specify small bases with the
b switch.