mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
Thread Tools
Old 2010-01-05, 10:41   #727
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2×17×73 Posts
Default

I have started 1000 curves at 11e6. (44 done so far, no factor)
Andi47 is offline   Reply With Quote
Old 2010-01-05, 10:45   #728
unconnected
 
unconnected's Avatar
 
May 2009
Russia, Moscow

A2116 Posts
Default

2300@11e6 are done with no result. This is about 0.5*t45, how much ECM'ing we need?
unconnected is offline   Reply With Quote
Old 2010-01-05, 11:12   #729
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2·17·73 Posts
Default

Quote:
Originally Posted by unconnected View Post
2300@11e6 are done with no result. This is about 0.5*t45, how much ECM'ing we need?
My rough guess is somewhere between 0.5*t55 = 9k @ 11e7 and 1*t55 ~ 17.5k @ 11e7

Please correct me if I'm wrong.

Last fiddled with by Andi47 on 2010-01-05 at 11:22 Reason: (hopefully) correcting my extrapolation
Andi47 is offline   Reply With Quote
Old 2010-01-05, 18:55   #730
10metreh
 
10metreh's Avatar
 
Nov 2008

91216 Posts
Default

I've found this from earlier in our work on 4788:
Code:
2333.   267978784508632868343114847060812948279629292222915880423759712858412228867957672971392000334670854838983335804438635643938788616600711408 = 2^4 * 3^2 * 92989028981 * 20012724099852599089965372134485155116134772186454249553781779673226527290856944625213723452411520667787389702557824640299547
2334.   481989619367342300734926329299579333889808536162741292564431101669679385519428605078705127063681626407548814866268364104159634219199843400 = 2^3 * 3^2 * 5^2 * 113 * 1613 * 1469103417254906821891838525901519591281166652227511390565077811335259014361034774239982074917602330156553759267494027765310350877
2335.   1152029206656316235471974481634606578356690329167224215707869782740824424411095903792101012459097585754639615021880805093048397651097766560 = 2^5 * 3^2 * 5 * 32003 * 1699413013515872926645731409301488559658444959 * 14709955753239154289970165983314290789323403834840450008018750264105583016407344451037
This escape from 2^3 * 3 * 5 is the highest ever, at 138 digits.
10metreh is offline   Reply With Quote
Old 2010-01-05, 20:40   #731
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3×281 Posts
Default

I feel escape form 2^3*3*5 is different from escape from 2^3*3^2*5 because 2^3*3^2*5 can never become a driver without changing the power of 2. This is because there are 2 factors of 3 - one from 2^3 and one from 5. 2^5*3^2*7 is also this way with sigma(2^5)=63 - which is 2 factors of 3 as well.

So if you have a square term on the 3 it shouldn't count as the 2^3*3*5 driver.
Greebley is offline   Reply With Quote
Old 2010-01-05, 20:43   #732
10metreh
 
10metreh's Avatar
 
Nov 2008

91216 Posts
Default

Quote:
Originally Posted by Greebley View Post
I feel escape form 2^3*3*5 is different from escape from 2^3*3^2*5 because 2^3*3^2*5 can never become a driver without changing the power of 2. This is because there are 2 factors of 3 - one from 2^3 and one from 5. 2^5*3^2*7 is also this way with sigma(2^5)=63 - which is 2 factors of 3 as well.

So if you have a square term on the 3 it shouldn't count as the 2^3*3*5 driver.
I thought that if the 5 is squared, the 3^2 could drop back to 3^1.
10metreh is offline   Reply With Quote
Old 2010-01-05, 20:56   #733
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

34B16 Posts
Default

Actually that is true, but rare enough that I still don't consider them the same.

The driver concept doesn't really fully cover higher powers adequately to really say.

Last fiddled with by Greebley on 2010-01-05 at 20:57
Greebley is offline   Reply With Quote
Old 2010-01-06, 10:48   #734
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2×17×73 Posts
Default

p-1: B1=2e9, B2=1e15, no factor
Andi47 is offline   Reply With Quote
Old 2010-01-06, 11:42   #735
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

3·2,141 Posts
Default

2000@4e7 complete, no factor.

Will run 2000@1e8 over the weekend (I have real-work to do on the dual-E5520 machine until then); I think it might now be sensible for jrk to start a polynomial search.
fivemack is offline   Reply With Quote
Old 2010-01-06, 14:03   #736
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

22·3·293 Posts
Default

1600 @ 43e6 completed. 800 @ 11e7 scheduled for tonight
bsquared is offline   Reply With Quote
Old 2010-01-06, 14:17   #737
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2·17·73 Posts
Default

Quote:
Originally Posted by bsquared View Post
1600 @ 43e6 completed. 800 @ 11e7 scheduled for tonight
I have done 1 curve each at 4e7 and 1e8 to read the number of required curves for each digit level (used for the calculation below)

So we currently have a total of:

Code:
 900 @ 1e6
2300 @ 11e6
2001 @ 40e6
1600 @ 43e6
   1 @ 1e8
this sums up to ~322.8% of t45 = 52.3% of t50 = 7.65% of t55

Last fiddled with by Andi47 on 2010-01-06 at 14:26 Reason: correction - there IS a difference between curves at 43e6 and 44e6
Andi47 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 3366 RichD Aliquot Sequences 470 2021-04-22 02:17
Reserved for MF - Sequence 3408 RichD Aliquot Sequences 474 2021-03-07 20:28
Reserved for MF - Sequence 276 kar_bon Aliquot Sequences 127 2020-12-17 10:05
Assignments are reserved but not showing up prism019 GPU to 72 6 2020-09-21 22:11
80M to 64 bits ... but not really reserved petrw1 Lone Mersenne Hunters 82 2010-01-11 01:57

All times are UTC. The time now is 07:48.


Mon Aug 2 07:48:15 UTC 2021 up 10 days, 2:17, 0 users, load averages: 1.70, 1.55, 1.43

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.