![]() |
3-2,627 (SNFS):
[code] 213761183624210960210703915095617025425016958650800862842385341761229338759858601 56622433274072480652465000835770094056824139364490904130738974293308082420722478335865830051 [/code] |
[QUOTE=EdH;528583]3-2,627 (SNFS):
[code] 213761183624210960210703915095617025425016958650800862842385341761229338759858601 56622433274072480652465000835770094056824139364490904130738974293308082420722478335865830051 [/code][/QUOTE] I see that Sean has reserved 11,3,957M. This is [b]extraordinary!![/b] As an SNFS job it is about C332 which is beyond anything NFS@Home has done. As a GNFS job it would be ~C290, which seems [I]way[/I] out of reach. How is he doing this??? I applaud the effort, but don't see how it is possible. |
Maybe he still tries to erode it out with a lot of ECM, and may get lucky?
|
[QUOTE=LaurV;528593]Maybe he still tries to erode it out with a lot of ECM, and may get lucky?[/QUOTE]
Bingo. Indeed this number is “too big to sieve”. But it only has seen ~0.5t50 worth of ECM. So now I’m panning for gold. Wish me luck! |
5+2,432 (SNFS):
[code] 2641343322296932761776283995477294261135397198050234646866441252116041456319232606919480552258791456859853754689 1346420988504355455293849268603976184114654657204462412193 [/code] |
[QUOTE=swellman;528601]Bingo. Indeed this number is “too big to sieve”. But it only has seen ~0.5t50 worth of ECM.
So now I’m panning for gold. Wish me luck![/QUOTE] Good luck! FWIW, it's probably not necessary to reserve a number for which you're just planning to run ECM. Unless there's a high likelihood of success, we don't need to worry too much about duplicating effort, since every extra ECM curve run by anyone else will still be helpful. However, if you really, really want to make sure that you're the only one looking at this number, then there's no real harm in making the reservation. Just know that the ECMnet server may still be handing it out. |
[QUOTE=R.D. Silverman;528587]I see that Sean has reserved 11,3,957M.
This is [b]extraordinary!![/b] As an SNFS job it is about C332 which is beyond anything NFS@Home has done. As a GNFS job it would be ~C290, which seems [I]way[/I] out of reach. How is he doing this??? I applaud the effort, but don't see how it is possible.[/QUOTE] Can you explain how it could be an SNFS job of difficulty 332? What polynomial can you create for this number that would yield that difficulty? |
5+3,432 (SNFS):
[code] 20813185816247507201588327699296703364000295336749569411875886401 1963992239412635306703139091457804433685781301658891740898676109016108387306689 49190690610686750284362316628172267037364124748582280994049 [/code]Another three-way break. . . |
[QUOTE=jyb;528667]Can you explain how it could be an SNFS job of difficulty 332? What polynomial can you create for this number that would yield that difficulty?[/QUOTE]
Divide 11,3,957 by 11,3,319 This should then split into the L,M components |
[QUOTE=R.D. Silverman;528706]Divide 11,3,957 by 11,3,319 This should then split into the L,M components[/QUOTE]
Can you show me that split? More concretely, can you show me the actual polynomial you would use? |
Hint: 957 = 3 * 11 * 29
|
| All times are UTC. The time now is 22:05. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.