(14*10^11-41)/99
*** VFYPR 1.13F F_max=100000 S_min=100000 h=0 a=0 C=0 J=0 D=0
N=(14*10^11-41)/99
N=14141414141
Factor: 2^2 divides N - 1
Factor: 2 divides N + 1
Factor: 3^2 divides N + 1
Factor: 5 divides N - 1
Factor: 7 divides N - 1
Factor: 41 divides N - 1
Factorization results: F1=0.3703 F2=0.1237
F1=5740
F2=18
Pass: gcd(3^((N-1)/2) - 1, N) = 1: R20=14141414139
Pass: 3^(N-1) = 1 (mod N): R20=1
Fail: gcd(U{(N+1)/2}, N) not = 1: d=17 p=1 q=-4 R20=0
Pass: gcd(U{(N+1)/2}, N) = 1: d=17 p=3 q=-2 R20=8242449012
Pass: U{N+1} = 0 (mod N): d=17 p=3 q=-2 R20=0
Pass: gcd(U{(N+1)/3}, N) = 1: d=17 p=3 q=-2 R20=2267746005
Pass: gcd(3^((N-1)/5) - 1, N) = 1: R20=12435979405
Pass: gcd(3^((N-1)/7) - 1, N) = 1: R20=13728603784
Pass: gcd(3^((N-1)/41) - 1, N) = 1: R20=7317607937
BLS tests passed: F1=0.3703 F2=0.1237
Main divisor test: F1=0.3703 F2=0.0940 G=0.4643 S=0.0000 T=1
G=51660
Main divisor test passed: 1/1
Final divisor test: F=0.3703 G=0.4643 H=1.2050 t=-1 a=1
Final divisor test passed: 3/3 r=3 i=0
*** N is prime!
Time: 0 sec
(14*10^1631-41)/99
== BPI:B263201C4DAFA ============================================
TITANIX 2.1.0 - Primality Certificate
Started 07.08.2001 at 08:14:38 AM
Running time 20h 10mn 21s
Candidate certified prime
=================================================================
Proved prime with Titanix by Hans Rosenthal.
The zipped file "141_815.zip" is 262 KB.
When unpacked the file "Titanix-B263201C4DAFA-001.out" is 616 KB
and is available on demand by simple email request.
(14*10^6343-41)/99
Proved prime by David Broadhurst dd. December 22, 2002.
Announced at http://groups.yahoo.com/group/primeform/message/2937
Details of the proof that this SUPP is prime can be found in
http://groups.yahoo.com/group/primeform/files/KP/hd6342kp.txt (broken link)
Thanks to Jim Fougeron for showing the way, with his
BLS verification of the primality of (17*10^4885-71)/99
first proven by Hans Rosenthal and Marcel Martin,
using the ECPP implementation Primo.
Also thanks to OpenPfgw and Marcel Martin for their
contributions to steps 1 and 2 of the present proof.
Step 3 was the use of the Konyagin-Pomerance cubic
given in Theorem 4.1.6 of the Crandall-Pomerance book,
“ Prime Numbers: A Computational Perspective ”.
The method used depends crucially on the first (and
hence last) digit being unity. Moreover one needs a
good spectrum of divisors of (exponent-1):
print(divisors(6342))
[1, 2, 3, 6, 7, 14, 21, 42, 151, 302, 453, 906, 1057,
2114, 3171, 6342]
And then a lot of factoring work on the corresponding
cyclotomic decomposition is needed (and good luck too!).
David Broadhurst
(14*10^14689-41)/99
By Hans Rosenthal
PFGW 1.1 test for probable primality in bases
3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61 and 251
(14*10^14689-41)/99 is 3-PRP! (55.360000 seconds)
(14*10^14689-41)/99 is 5-PRP! (54.820000 seconds)
(14*10^14689-41)/99 is 7-PRP! (54.760000 seconds)
(14*10^14689-41)/99 is 11-PRP! (54.870000 seconds)
(14*10^14689-41)/99 is 13-PRP! (54.870000 seconds)
(14*10^14689-41)/99 is 17-PRP! (54.870000 seconds)
(14*10^14689-41)/99 is 19-PRP! (54.760000 seconds)
(14*10^14689-41)/99 is 23-PRP! (54.820000 seconds)
(14*10^14689-41)/99 is 29-PRP! (54.810000 seconds)
(14*10^14689-41)/99 is 31-PRP! (54.760000 seconds)
(14*10^14689-41)/99 is 37-PRP! (54.870000 seconds)
(14*10^14689-41)/99 is 41-PRP! (54.920000 seconds)
(14*10^14689-41)/99 is 43-PRP! (54.810000 seconds)
(14*10^14689-41)/99 is 47-PRP! (54.810000 seconds)
(14*10^14689-41)/99 is 53-PRP! (54.820000 seconds)
(14*10^14689-41)/99 is 59-PRP! (54.810000 seconds)
(14*10^14689-41)/99 is 61-PRP! (54.820000 seconds)
(14*10^14689-41)/99 is 251-PRP! (54.760000 seconds)
[ TOP OF PAGE]
Patrick De Geest - Belgium - Short Bio - Some Pictures
E-mail address : pdg@worldofnumbers.com