You mean C211_137_76? :)

[QUOTE=XYYXF;375376]You mean C211_137_76? :)[/QUOTE]

Yes, my error. C211_137_[B]76[/B], as well as C283_149_143 and C211_137_53.



FWIW, ECM of C200_150_148 and C252_137_120 should finish this week. No factors found so far...

Running C204_115_88 to t50 (7600 curves at B1=43M)

[QUOTE=wombatman;375607]Running C204_115_88 to t50 (7600 curves at B1=43M)[/QUOTE]

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. [URL="http://www.rechenkraft.net/yoyo/download/download/stats/ecm/xy/wu_status"]The wavefront currently sits at x=134[/URL].

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).

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.

[QUOTE=swellman;374422]Reserving C205_137_73 and C252_137_120. I'll take them to t50.[/QUOTE]


C252_137_120 run for 7600 curves @B1=43M with no factors found. Releasing number.

7600 curves at B1=43M give no factors for C175_136_61.

C200_150_148
 

[QUOTE=swellman;373865]I will take it up to t55.[/QUOTE]

Ran this for 18000 curves @B1=110M with no factors found. Releasing number.

113_96 factored
 

Ryan has factored 113_96 into a p58 * p65 * p83.

See [URL]http://factordb.com/index.php?id=1000000000044715137[/URL].

The p58 was found by ECM, the rest by GNFS. I've requested the log file for the ECM run.

[QUOTE=swellman;375345]I will ECM C283_149_143...to the t50 level.[/QUOTE]

C283_149_143 run for 7600 curves @B1=43M. No factors found. Releasing number.

[QUOTE=swellman;376022]Ryan has factored 113_96 into a p58 * p65 * p83.

See [URL]http://factordb.com/index.php?id=1000000000044715137[/URL].

The p58 was found by ECM, the rest by GNFS. I've requested the log file for the ECM run.[/QUOTE]

ECM log file follows.

[code]
[FONT=arial]GMP-ECM 6.4.4 [configured with GMP 6.0.0, --enable-asm-redc] [ECM][/FONT]
[FONT=arial]Input number is 151267240161687094342844516930[/FONT][FONT=arial]618033781312644828109746370932[/FONT][FONT=arial]383181544426526433180952356653[/FONT][FONT=arial]212581200862585860985506944513[/FONT][FONT=arial]141185286867440170432396699348[/FONT][FONT=arial]816089481808936037812958481736[/FONT][FONT=arial]7934737009870508346767231 (205 digits)[/FONT]
[FONT=arial]Using MODMULN [mulredc:0, sqrredc:2][/FONT]
[FONT=arial]Using B1=110000000, B2=776278396540, polynomial Dickson(30), sigma=1736500047[/FONT]
[FONT=arial]dF=131072, k=4, d=1345890, d2=11, i0=71[/FONT]
[FONT=arial]Expected number of curves to find a [/FONT][FONT=arial]factor[/FONT][FONT=arial] of n digits:[/FONT]
[FONT=arial]35 40 45 50 55 60 65 70 75 80[/FONT]
[FONT=arial]34 135 614 3135 17884 111314 752662 5482978 4.3e+07 3.6e+08[/FONT]
[FONT=arial]Step 1 took 661049ms[/FONT]
[FONT=arial]Using 25 small primes for NTT[/FONT]
[FONT=arial]Estimated memory usage: 566M[/FONT]
[FONT=arial]Initializing tables of differences for F took 487ms[/FONT]
[FONT=arial]Computing roots of F took 22166ms[/FONT]
[FONT=arial]Building F from its roots took 8893ms[/FONT]
[FONT=arial]Computing 1/F took 3724ms[/FONT]
[FONT=arial]Initializing table of differences for G took 346ms[/FONT]
[FONT=arial]Computing roots of G took 15827ms[/FONT]
[FONT=arial]Building G from its roots took 10623ms[/FONT]
[FONT=arial]Computing roots of G took 15849ms[/FONT]
[FONT=arial]Building G from its roots took 8667ms[/FONT]
[FONT=arial]Computing G * H took 1794ms[/FONT]
[FONT=arial]Reducing G * H mod F took 2296ms[/FONT]
[FONT=arial]Computing roots of G took 16090ms[/FONT]
[FONT=arial]Building G from its roots took 10072ms[/FONT]
[FONT=arial]Computing G * H took 1986ms[/FONT]
[FONT=arial]Reducing G * H mod F took 1913ms[/FONT]
[FONT=arial]Computing roots of G took 15718ms[/FONT]
[FONT=arial]Building G from its roots took 9355ms[/FONT]
[FONT=arial]Computing G * H took 1826ms[/FONT]
[FONT=arial]Reducing G * H mod F took 1934ms[/FONT]
[FONT=arial]Computing polyeval(F,G) took 14499ms[/FONT]
[FONT=arial]Computing product of all F(g_i) took 62ms[/FONT]
[FONT=arial]Step 2 took 164614ms[/FONT]
[FONT=arial]********** [/FONT][FONT=arial]Factor[/FONT][FONT=arial]found[/FONT][FONT=arial] in step 2: 732577863306628762486626098821[/FONT][FONT=arial]3923162387125986617707180257[/FONT]
[FONT=arial]Found[/FONT][FONT=arial] probable prime [/FONT][FONT=arial]factor[/FONT][FONT=arial] of 58 digits: 732577863306628762486626098821[/FONT][FONT=arial]3923162387125986617707180257[/FONT]
[FONT=arial]Composite cofactor 206486228615909565904829430181[/FONT][FONT=arial]076276136895100907803625146780[/FONT][FONT=arial]872755001481056384180130287527[/FONT][FONT=arial]931568093824658510414387889843[/FONT][FONT=arial]519932735417758011340018783 has 147 digits[/FONT]
[/code]