20190922, 19:03  #738 
Oct 2007
London, UK
51C_{16} Posts 
I don't want to derail this thread, so I've made another for this issue here:
https://www.mersenneforum.org/showthread.php?t=24783 
20190923, 01:42  #739 
Oct 2007
London, UK
1308_{10} Posts 
Factored:
SNFS 192: 440089295235970403642553674737477^71 About to factor: SNFS 202: 41442572371^191 Going to work on: SNFS 198: 707236734824410577063252238741697^71 SNFS 251: 464731577596114204348798438062707107000729^71 
20190927, 20:29  #740 
Oct 2007
London, UK
2^{2}×3×109 Posts 
Factored:
SNFS 198: 707236734824410577063252238741697^71 SNFS 198: 702775215655004991726460008954589^71 Still about to factor (it's resisting): SNFS 202: 41442572371^191 Going to work on: SNFS 204: 9083122697623048890240666710042599^71 SNFS 251: 464731577596114204348798438062707107000729^71 
20191005, 04:59  #741 
Oct 2007
London, UK
1308_{10} Posts 
As far as I can tell I've factored all remaining p33^71 in the t800 file, and I've started on the p34's.
Done 1 so far: 9083122697623048890240666710042599^71 These are the ones I'll be working on now, SNFS 200  204 Code:
4525492053413126092322061478911449^71 (about to finish) 1656076400882376815976253841650927^71 2262314083589767587709702376395859^71 3284321492144095749319975883891791^71 3884164061376631710378317390201017^71 7484591086350246919092708017291837^71 2038811844077614752925769002050361^71 3128557561154894142229197828604789^71 SNFS 251: 464731577596114204348798438062707107000729^71 
20191208, 19:23  #742 
Oct 2007
London, UK
2^{2}×3×109 Posts 
Woooo! New PB
(p52^7  1)/(p52  1) = 29 * 43 * p108 * p140 59 days of sieve time on a 3.4 GHz quad core to crack a number with SNFS difficulty 251, not bad. I'm also nearly done crunching through all the 7^p351's in the t800 file, I think only 6 remain. Last fiddled with by axn on 20191209 at 02:44 Reason: p52^7  1 
20191208, 20:39  #743 
"Curtis"
Feb 2005
Riverside, CA
2·13^{3} Posts 

20191210, 05:12  #744 
Sep 2008
Kansas
2·1,567 Posts 
With the enhancements of CADO using GNFS for factoring, and the optimization of parameters by VBCurtis in and around the C140 range, this introduces home hobbyist to tackle moderately size factoring projects for OPN (Odd Perfect Numbers).
Many numbers in the early part of the t2100.txt file fit this description. I would guess, though Pascal does not keep track of ECM work, many are ready for GNFS. The format of the file can be found here but a brief explanation is each line has <base> <exp> <comp> where <comp> is the remaining composite which needs factoring. <exp> is usually 1 or 2 digits. Remaining composites are from (<base>^(<exp>+1))/(<base>1). A great write up for installing CADO can be found here by EdH. Then, simply download and replace the improved params.c140.txt from this post. If any are interested they can try their hand  Oh, I mean computer, on these numbers. 
20191213, 14:16  #746 
Sep 2008
Kansas
2×1,567 Posts 

20191213, 18:57  #747 
Sep 2008
Kansas
110000111110_{2} Posts 
Taking from t2100.txt file.
45776...73<p85> 2 18275...01<C139> 
20191214, 03:51  #748 
Sep 2008
Kansas
110000111110_{2} Posts 
These are going pretty quickly with the CADO package. Beginning midday tomorrow I will start with the C140s and leave the C139s (and C141s) for others. Beginning with and progressing sequentially through the t2100.txt file starting at:
44042...21<p130> 2 10336...57<C140> 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Passive Pascal  Xyzzy  GPU Computing  1  20170517 20:22 
Tesla P100 — 5.4 DP TeraFLOPS — Pascal  Mark Rose  GPU Computing  52  20160702 12:11 
Nvidia Pascal, a third of DP  firejuggler  GPU Computing  12  20160223 06:55 
Calculating perfect numbers in Pascal  Elhueno  Homework Help  5  20080612 16:37 
Factorization attempt to a c163  a new Odd Perfect Number roadblock  jchein1  Factoring  30  20050530 14:43 