20151013, 02:31  #34 
Aug 2002
371_{8} Posts 
Now caught up to 1200 digits (though both verification workers are busy with larger numbers). I am now working on the following:
Code:
1100000000804064323 6106991767...83 1214 1100000000804080571 (2^44232^4277*32)/30 1330 1100000000804065308 2^44232^757*31 1332 1100000000804065548 2^44232^1205*31 1332 1100000000804065560 2^96892^1828*31 2917 1100000000804065535 2^96892^202*31 2917 Last fiddled with by pakaran on 20151013 at 02:32 
20151013, 09:24  #35 
Sep 2002
Database er0rr
3,533 Posts 
Code:
./pfgw64 V i tc q"2^44232^1205*31" h"helper_09" PFGW Version 3.4.4.64BIT.20101104.x86_Dev [GWNUM 26.4] CPU Information (From Woltman v25 library code) Intel(R) Core(TM) i74770K CPU @ 3.50GHz CPU speed: 3500.00 MHz, 4 cores CPU features: RDTSC, CMOV, Prefetch, MMX, SSE, SSE2, SSE4.1, SSE4.2 L1 cache size: unknown L2 cache size: 256 KB, L3 cache size: 8 MB L1 cache line size: unknown L2 cache line size: 64 bytes TLBS: 64 Primality testing 2^44232^1205*31 [N1/N+1, BrillhartLehmerSelfridge] Reading factors from helper file helper_09 Running N1 test using base 3 Generic modular reduction using generic reduction FFT length 448 on A 4425bit number Running N+1 test using discriminant 13, base 2+sqrt(13) Generic modular reduction using generic reduction FFT length 448 on A 4425bit number Calling N+1 BLS with factored part 27.68% and helper 0.23% (83.29% proof) 2^44232^1205*31 is Fermat and Lucas PRP! (0.1944s+0.0257s) Code:
n=2^44232^1205*31 F=1 G=2^1205*11*67033 Code:
gp < CHG.GP Reading GPRC: /etc/gprc ...Done. GP/PARI CALCULATOR Version 2.7.2 (released) amd64 running linux (x8664/GMP6.0.0 kernel) 64bit version compiled: Sep 19 2014, gcc version 4.9.1 (Debian 4.9.114) threading engine: pthread (readline v6.3 disabled, extended help enabled) Copyright (C) 20002014 The PARI Group PARI/GP is free software, covered by the GNU General Public License, and comes WITHOUT ANY WARRANTY WHATSOEVER. Type ? for help, \q to quit. Type ?12 for how to get moral (and possibly technical) support. parisize = 8000000, primelimit = 500000 *** Warning: new stack size = 134217728 (128.000 Mbytes). realprecision = 15008 significant digits (15000 digits displayed) Welcome to the CHG primality prover!  Input file is: TestSuite/_09.in Certificate file is: TestSuite_09.out Found values of n, F and G. Number to be tested has 1332 digits. Modulus has 369 digits. Modulus is 27.684648779108303772% of n. NOTICE: This program assumes that n has passed a BLS PRPtest with n, F, and G as given. If not, then any results will be invalid! Square test passed for G >> F. Using modified right endpoint. Search for factors congruent to 1. Running CHG with h = 10, u = 4. Right endpoint has 226 digits. Done! Time elapsed: 17748ms. Running CHG with h = 10, u = 4. Right endpoint has 213 digits. Done! Time elapsed: 15741ms. Running CHG with h = 9, u = 3. Right endpoint has 190 digits. Done! Time elapsed: 12148ms. Running CHG with h = 7, u = 2. Right endpoint has 157 digits. Done! Time elapsed: 8517ms. Running CHG with h = 7, u = 2. Right endpoint has 116 digits. Done! Time elapsed: 4680ms. A certificate has been saved to the file: TestSuite_09.out Running David Broadhurst's verifier on the saved certificate... Testing a PRP called "TestSuite/_09.in". Pol[1, 1] with [h, u]=[7, 2] has ratio=4.670568865392464778 E251 at X, ratio=8.148375158710707375 E240 at Y, witness=5. Pol[2, 1] with [h, u]=[7, 2] has ratio=0.5573927723486209173 at X, ratio=2.3698841451812667437 E82 at Y, witness=5. Pol[3, 1] with [h, u]=[8, 3] has ratio=1.0000000000000000000 at X, ratio=9.829104895076774857 E100 at Y, witness=7. Pol[4, 1] with [h, u]=[9, 4] has ratio=1.0425340086454014303 E99 at X, ratio=3.140269697688937236 E94 at Y, witness=11. Pol[5, 1] with [h, u]=[10, 4] has ratio=9.359357312492652555 E26 at X, ratio=3.489446171608562181 E53 at Y, witness=7. Validated in 1 sec. Congratulations! n is prime! Goodbye! Last fiddled with by paulunderwood on 20151013 at 09:32 
20151013, 11:08  #36 
Jun 2003
3·5·17·19 Posts 

20151016, 18:22  #37 
Aug 2002
3×83 Posts 
Taking everything through 2384 digits.

20151017, 17:21  #38 
"Frank <^>"
Dec 2004
CDP Janesville
2122_{10} Posts 

20151019, 17:18  #39 
Aug 2002
3×83 Posts 
Nice!
I'm working on clearing up the 62 PRPs not significantly over 1k dd. I'll post again if I decide to do anything higher, and would ask others to do the same. 
20151021, 02:24  #40 
Aug 2002
F9_{16} Posts 
Taking the bottom 128 (through 1200 dd).

20151021, 04:18  #41 
Aug 2002
F9_{16} Posts 
And I'm done for now.

20151022, 19:01  #42 
Aug 2002
371_{8} Posts 
Taking 135 smaller numbers, through 1191 dd.

20151025, 00:05  #43 
Aug 2002
3×83 Posts 
Taking the 450 (!) smallest numbers.

20151025, 17:14  #44 
Sep 2009
7BE_{16} Posts 
I've spotted a couple of shortcuts:
Code:
1100000000804637633 ((61^101959^1019)/2+1)/199822 1100000000804637626 (61^101959^1019)/2 1100000000804638204 ((13^209911^2099)/21)/302256 1100000000804638199 (13^209911^2099)/2 Chris 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Fixup Old Primo Certificate?  wblipp  FactorDB  1  20120528 03:16 
Invalid certificate?  IvanP  FactorDB  3  20120511 12:17 
Could Moore's law be purposely used for marketing purposes?  jasong  Science & Technology  10  20070119 19:04 
certificate of appreciation  Unregistered  Information & Answers  13  20040428 06:24 