(13*10^3-31)/99 *** VFYPR 1.13F F_max=100000 S_min=100000 h=0 a=0 C=0 J=0 D=0 N=(13*10^3-31)/99 N=131 *** N is prime! Time: 0 sec
(13*10^25-31)/99 *** VFYPR 1.13F F_max=100000 S_min=100000 h=0 a=0 C=0 J=0 D=0 N=(13*10^25-31)/99 N=1313131313131313131313131 Factor: 2 divides N - 1 Factor: 2^2 divides N + 1 Factor: 3 divides N - 1 Factor: 5 divides N - 1 Factor: 7 divides N - 1 Factor: 11 divides N + 1 Factor: 13^2 divides N - 1 Factor: 37 divides N - 1 Factor: 73 divides N - 1 Factorization results: F1=0.3309 F2=0.0681 F1=95858490 F2=44 Pass: gcd(3^((N-1)/2) - 1, N) = 1: R20=31313131313131313129 Pass: 3^(N-1) = 1 (mod N): R20=1 Pass: gcd(U{(N+1)/2}, N) = 1: d=17 p=1 q=-4 R20=92507488150401470583 Pass: U{N+1} = 0 (mod N): d=17 p=1 q=-4 R20=0 Pass: gcd(3^((N-1)/3) - 1, N) = 1: R20=40023725922007176475 Fail: gcd(3^((N-1)/5) - 1, N) not = 1: R20=0 Pass: gcd(7^((N-1)/5) - 1, N) = 1: R20=70897469440398720906 Pass: 7^(N-1) = 1 (mod N): R20=1 Pass: gcd(7^((N-1)/7) - 1, N) = 1: R20=78370731419034083832 Pass: gcd(U{(N+1)/11}, N) = 1: d=17 p=1 q=-4 R20=1960149759602877627 Pass: gcd(7^((N-1)/13) - 1, N) = 1: R20=96677157618836330393 Pass: gcd(7^((N-1)/37) - 1, N) = 1: R20=56474313012188565133 Pass: gcd(7^((N-1)/73) - 1, N) = 1: R20=19373161974357541664 BLS tests passed: F1=0.3309 F2=0.0681 Main divisor test: F1=0.3185 F2=0.0681 G=0.3866 S=0.0000 T=1 G=2108886780 Main divisor test passed: 1/1 Final divisor test: F=0.3309 G=0.3866 H=1.0485 t=-1 a=1 Final divisor test passed: 3/3 r=3 i=0 *** N is prime! Time: 0 sec