20131003, 12:30  #45 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
1001100010111_{2} Posts 
Offtopic.
Mr. Silverman, R.D., can you update your profile at Scopus? Thank you in advance, Carlos 
20131003, 15:47  #46 
Sep 2009
2^{4}·127 Posts 
Back to the original request, how hard would it be to test the cofactors of F25, F26, etc for primality? If any are prime then the Fermat number would be fully factored.
Chris 
20131003, 16:32  #47 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·37·127 Posts 
They are likely already tested. It is far from hard  a few days' work. Run them and send the residues to W.Keller. (W.Keller for some reason is resistant to adding extra asterisks to some tested cofactors, above a certain limit set by him. Maybe, he wants to have double and triplechecked residues.)

20131003, 21:04  #48 
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts 

20131003, 21:43  #49 
Nov 2003
2^{2}×5×373 Posts 

20131003, 21:44  #50 
Nov 2003
16444_{8} Posts 

20131004, 07:00  #51  
May 2007
Kansas; USA
3×3,449 Posts 
Quote:
I think that for Mr. Guy to win his bet, the only (un)reasonable chance is to fully factor one of F12/F13/F14. Last fiddled with by gd_barnes on 20131004 at 07:01 

20131004, 17:55  #52 
Jan 2005
3E_{16} Posts 
Although I wouldn't put any money on it myself, Guy could still win his bet if someone manages to build a quantum computer with enough qbits to run Shor's algorithm on F12. This, of course, also assumes that they could get the result and publish it before government goons swept in, shouted "national security", and confiscated their hardware.

20131004, 20:19  #53  
Nov 2003
2^{2}×5×373 Posts 
Quote:


20131004, 21:06  #54  
"Phil"
Sep 2002
Tracktown, U.S.A.
3·373 Posts 
Quote:
But I wouldn't consider the chance of completely factoring F12/F13/F14 to be completely unreasonable. If ECM turned up a factor of 65 or 70 digits of F12 by ECM, and no smaller factor had been missed, we would expect the cofactor to have around an 11% chance of being prime. For F13, the probability drops to about half that, and half that again for F14. Unfortunately, after searching to 60 digits, we can only expect about a 1 in 7 chance of finding another factor searching to 70 digits, so maybe we can consider our overall chance of success with F12 to be around 1.5%. 

20131004, 21:35  #55 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·37·127 Posts 
Primality proofs were for some stretches of time divorced from factorizations, e.g. in the Cunningham project. It is likely that most people would agree that the factorizations of 2^13347311+1 and 2^13372531+1 are complete (some may not): they both are = 3 · "large PRP".
People are understandably much more strict when a primality proof is based on a PRP as a helper, e.g. the KP proof of (8·10^2781171)/9 was definitely incomplete (before prp7334 was certified with Primo), though most would agree that the N1 cofactor factorization was complete: Φ_{13905}(10) = 83431 · 333721 · prp7334 . 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Weird freezing error, desperate for a solution.  jasong  Lounge  5  20161118 00:43 
September 2016  Batalov  Puzzles  8  20161004 14:10 
YAFU Poly Select Deadline  amphoria  YAFU  22  20160917 09:47 
Official Ernst (ewmayer) / Richard (cheesehead) feud thread  cheesehead  Soap Box  50  20140630 01:06 
Appeal for machines  dave_dm  GMPECM  0  20050629 02:23 