20100219, 02:58  #826 
Jul 2003
So Cal
2,039 Posts 
Code:
prp51 factor: 388506058643583355437271607661833307213566452269017 prp77 factor: 32036182249699730203082985730853613751522637113555017710745413833553416908691 
20100219, 03:55  #827 
May 2008
3×5×73 Posts 
Now a c171
Code:
193180597261434437130723427223452983749001196443861486431050101233095959046579376056784397572419692971642911818089261513816572456073452501892312801518858596361529181158803 
20100219, 05:57  #828  
Oct 2004
Austria
2·17·73 Posts 
Quote:
This will need *lots* of ECM. My guess is somewhat more than t55, i.e. ~17700 @ 110e6 and a couple of curves at 260e6? 

20100219, 07:18  #829 
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3×419 Posts 
If this 171 digit number had been prime, the aliquot sequence would have acquired
the downdriver now, right? @frmky (Greg): How many systems did you make use of in order to find out that p53 factor by using ECM, crack that c106 within half an hour crack that c128 within 5 hours of time Only 13 more iterations count for sequence 314718 to reach (hit) 9000 iterations is being left over! that is remaining actually... Last fiddled with by Raman on 20100219 at 07:20 
20100219, 07:40  #830 
Jul 2003
So Cal
2,039 Posts 

20100219, 07:55  #831  
Nov 2008
2×3^{3}×43 Posts 
Quote:
Assuming the c171 splits into two factors, there is a 1/2 chance that it will split into primes of the form 8n+1 and 8n+3, losing the 2^3, and a 1/2 chance that it will split into primes of the form 8n+5 and 8n+7, keeping the 2^3. The good news is that it can't pick up a 3, but that wouldn't really matter if it got 2^4 * 31... 

20100219, 08:01  #832  
Oct 2004
Austria
9B2_{16} Posts 
I guess you also distributed the poly search between these cores? Do you use a script for doing this?
Edit: Quote:
btw: is there any chance to get the downdriver if the 2³ is lost? Last fiddled with by Andi47 on 20100219 at 08:05 Reason: Re: 10metreh 

20100219, 08:18  #833 
Jul 2003
So Cal
3767_{8} Posts 
In this case, no. But the ggnfs distribution includes scripts (search_a5) to distribute the poly search if you use pol5. To distribute msieve polsel, I just run in different directories and concatanate the .p files.

20100219, 08:24  #834 
Sep 2004
533_{10} Posts 
i would think cpu time is better spent doing like ecm since gpus are faster at poly's I will do p1 if no one else is.

20100219, 08:38  #835 
Oct 2004
Austria
4662_{8} Posts 
To which bounds?
can you please save stage 1 (at the best done with the chkpnt filename option) and post it, just in case if we want to increase the bounds later, that we don't need to redo stage 1? Edit2: 59@11e6, no factor Last fiddled with by Andi47 on 20100219 at 08:50 Reason: formatting + a few ECM curves 
20100219, 11:04  #836 
(loop (#_fork))
Feb 2006
Cambridge, England
2×11×17^{2} Posts 
I'm running 2000@11e7 over the weekend. (raman: 60 hours Fri morning  Mon morning / 15 CPUminutes per curve * 8 CPUs)

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Reserved for MF  Sequence 3366  RichD  Aliquot Sequences  406  20200610 03:10 
Primes in nfibonacci sequence and nstep fibonacci sequence  sweety439  And now for something completely different  17  20170613 03:49 
ECM for c166 from 4788:2661  frmky  Aliquot Sequences  36  20110428 06:27 
ECM work on 4788:2549.c170  schickel  Aliquot Sequences  51  20110105 02:32 
80M to 64 bits ... but not really reserved  petrw1  Lone Mersenne Hunters  82  20100111 01:57 