![]() |
|
|
#23 |
|
Jan 2005
Minsk, Belarus
6208 Posts |
You mean C211_137_76? :)
|
|
|
|
|
|
#24 |
|
Jun 2012
22×13×59 Posts |
|
|
|
|
|
|
#25 |
|
I moo ablest echo power!
May 2013
29×61 Posts |
Running C204_115_88 to t50 (7600 curves at B1=43M)
|
|
|
|
|
|
#26 |
|
Jun 2012
22·13·59 Posts |
Wombatman - just a heads up that yoyo@Home has ECM'd that number to t50 already. They are running each composite to t50, by increasing x. The wavefront currently sits at x=134.
Pick another number to ECM, with say x>136. Or NFS a number. Or ECM a number to the t55 level (which is tedious but always welcome). Last fiddled with by swellman on 2014-06-11 at 19:24 Reason: clarity |
|
|
|
|
|
#27 |
|
I moo ablest echo power!
May 2013
29·61 Posts |
Shoot. I checked the yoyo page and didn't find it on there, so I thought it hadn't been touched yet. Oh well. I'll take C175_136_61 to t50 then.
|
|
|
|
|
|
#28 |
|
Jun 2012
22·13·59 Posts |
|
|
|
|
|
|
#29 |
|
I moo ablest echo power!
May 2013
29×61 Posts |
7600 curves at B1=43M give no factors for C175_136_61.
|
|
|
|
|
|
#30 |
|
Jun 2012
22×13×59 Posts |
|
|
|
|
|
|
#31 |
|
Jun 2012
22×13×59 Posts |
Ryan has factored 113_96 into a p58 * p65 * p83.
See http://factordb.com/index.php?id=1000000000044715137. The p58 was found by ECM, the rest by GNFS. I've requested the log file for the ECM run. |
|
|
|
|
|
#32 |
|
Jun 2012
22×13×59 Posts |
|
|
|
|
|
|
#33 | |
|
Jun 2012
22·13·59 Posts |
Quote:
Code:
GMP-ECM 6.4.4 [configured with GMP 6.0.0, --enable-asm-redc] [ECM] Input number is 1512672401616870943428445169306180337813126448281097463709323831815444265264331809523566532125812008625858609855069445131411852868674401704323966993488160894818089360378129584817367934737009870508346767231 (205 digits) Using MODMULN [mulredc:0, sqrredc:2] Using B1=110000000, B2=776278396540, polynomial Dickson(30), sigma=1736500047 dF=131072, k=4, d=1345890, d2=11, i0=71 Expected number of curves to find a factor of n digits: 35 40 45 50 55 60 65 70 75 80 34 135 614 3135 17884 111314 752662 5482978 4.3e+07 3.6e+08 Step 1 took 661049ms Using 25 small primes for NTT Estimated memory usage: 566M Initializing tables of differences for F took 487ms Computing roots of F took 22166ms Building F from its roots took 8893ms Computing 1/F took 3724ms Initializing table of differences for G took 346ms Computing roots of G took 15827ms Building G from its roots took 10623ms Computing roots of G took 15849ms Building G from its roots took 8667ms Computing G * H took 1794ms Reducing G * H mod F took 2296ms Computing roots of G took 16090ms Building G from its roots took 10072ms Computing G * H took 1986ms Reducing G * H mod F took 1913ms Computing roots of G took 15718ms Building G from its roots took 9355ms Computing G * H took 1826ms Reducing G * H mod F took 1934ms Computing polyeval(F,G) took 14499ms Computing product of all F(g_i) took 62ms Step 2 took 164614ms ********** Factorfound in step 2: 7325778633066287624866260988213923162387125986617707180257 Found probable prime factor of 58 digits: 7325778633066287624866260988213923162387125986617707180257 Composite cofactor 206486228615909565904829430181076276136895100907803625146780872755001481056384180130287527931568093824658510414387889843519932735417758011340018783 has 147 digits |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reservations | ET_ | FermatSearch | 226 | 2021-04-25 19:47 |
| Linear algebra reservations, progress and results | wombatman | NFS@Home | 2768 | 2018-06-02 15:06 |
| NFS results and reservations | XYYXF | XYYXF Project | 348 | 2017-09-08 04:38 |
| Reservations | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 129 | 2016-09-05 09:23 |
| Where are my reservations | fivemack | PrimeNet | 3 | 2016-02-08 17:58 |