20070219, 15:38  #12 
Jun 2005
lehigh.edu
2000_{8} Posts 

20070220, 05:47  #13 
Jun 2005
lehigh.edu
2^{10} Posts 

20070720, 17:56  #14  
Jun 2005
lehigh.edu
400_{16} Posts 
c248 > c196, still snfs
Quote:
but at difficulty 270, the c196 cofactor isn't small enough (yet) for gnfs to be easier. p52 = 4254678785395250635090914262464410641424477007559249 Bruce (that's 6, 347+) 

20070727, 02:26  #15  
Jun 2005
lehigh.edu
400_{16} Posts 
Quote:
p52 = 2783700126792688988335822421768098189386895987206391 finishes 6,371+. Remarkably uniform these post t50 factors  the SilvermanWagstaff paragraph about reestimating the most likely factor size after a test finishes, which says that the likely size is just another few digits larger than the previous estimate seems to be well represented here. So best strategy after p50 is to look for p55; rather than deciding that most of the p5xs were already swept up, and jumping to p60. Not that I wouldn't be running B1 = 260M if our pcs had more RAM installed (as I'm doing with the Opterons), choosing optimal memory use rather than best strategy. Eight factors so far, a lateish p49 and an early p57, then five (!) p52's and a p53. Bruce 

20071008, 09:19  #16  
Jun 2005
lehigh.edu
10000000000_{2} Posts 
Quote:
p60 = 151634244917416206035101114864937647283016448179107389644473 finishing 6, 292+ One on Bob's remaining 768bit list of easier snfs numbers. (Sorry for a double report, not sure whether the nfsnet list wanted priority.) Bruce 

20071008, 12:26  #17 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{4}·3·7·19 Posts 
6,289+ has been done [page103 of Cunningham tables; Irvine gnfs]
6,283+ has been done [page104 of Cunningham tables; Leyland snfs] 6,353+ has been reduced to a c178 by Dodson [pages 98 and 101 of Cunningham tables] 6,358+ has been reduced to a c163 by Dodson [pages 91 and 101 of Cunningham tables] 6,365+ c122 has been done [Zimmermann, gnfs, page 104 of Cunningham tables] 6,369+ c178 has been done [Hoogendoorn, snfs, page 104 of Cunningham tables] 6,387+ c162 has just been done [Silverman, snfs, page 106 of Cunningham tables] 
20090529, 03:24  #18 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}×7×337 Posts 
6,762M = p78 . p82
The log is attached.
Because it was a quartic, the FB limits were lopsided and it worked out nicely. Interestingly, the sqrt was done modulo 53, because "no irreducible prime found, switching to small primes". Now, that was the last 6L/M number and the last one in all tables with difficulty under 200. There are some quartics left slightly above diff.200 (single "home"computer type projects). Serge Last fiddled with by Batalov on 20090529 at 16:24 Reason: 6,762M (indeed) 
20090529, 10:45  #19 
"Robert Gerbicz"
Oct 2005
Hungary
10110111100_{2} Posts 
That was 6,762M.

20090812, 12:10  #20  
Jun 2005
lehigh.edu
2^{10} Posts 
6, 304+ C216 = p78*p138
Quote:
of the seven, 6, 304+ C216 = p78*p138, Batalov+Dodson snfs. A Most wanted number from page 106. The other early wanted numbers that are now first holes: Code:
page 106: 3,509+ c171 B+D snfs 6,304+ c216 done 11,229 c217 Edwards 12,233 c215 251.45 0.855 (snfs difficulty, sb ratio) 12,232+ c181 250.37 0.723 page 107: 10,241+ c175 running 

20090812, 12:35  #21 
Oct 2004
Austria
9B2_{16} Posts 

20090812, 12:46  #22 
Mar 2006
Germany
2889_{10} Posts 
BTW:
what about a link in the first post like this: Fatoring Database Composites for 6+ beginning at n=300 and if so, for the other subthreads, too. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
5+ table  garo  Cunningham Tables  100  20210104 22:36 
7+ table  garo  Cunningham Tables  86  20210104 22:35 
3+ table  garo  Cunningham Tables  150  20200323 21:41 
5 table  garo  Cunningham Tables  82  20200315 21:47 
6 table  garo  Cunningham Tables  41  20160804 04:24 