![]() |
|
|
#34 | |
|
Nov 2003
22·5·373 Posts |
Quote:
Nice result...... I am about half way through the LA for 2,1101+, half-way through the sieving for 2,1104+ and will then do 2,1538M. Sam Wagstaff does not show anyone doing 2,799+. Is anyone doing it or may I reserve it? |
|
|
|
|
|
#35 |
|
"Ben"
Feb 2007
3×1,171 Posts |
I'm doing it. Sieving is 95% done. Sorry, I never reserved it with Sam Wagstaff.
Last fiddled with by bsquared on 2008-05-29 at 15:18 |
|
|
|
|
#36 |
|
Nov 2003
22·5·373 Posts |
|
|
|
|
|
#37 |
|
Nov 2003
22·5·373 Posts |
|
|
|
|
|
#38 | |
|
"Ben"
Feb 2007
DB916 Posts |
Thanks! I ran across that and several others like it in a mass e-mail awhile back (attached).
Quote:
- ben. |
|
|
|
|
|
#39 |
|
"Ben"
Feb 2007
3·1,171 Posts |
More that didn't fit in previous post...
|
|
|
|
|
#40 |
|
"Ben"
Feb 2007
3×1,171 Posts |
I'd like to reserve 2,1598L for SNFS. SNFS seems to be the way to go, especially since I now have experience with SNFS on this size number (namely, 2,799+), while I have none with GNFS on a C171.
I'm still playing around with parameterization, using this poly Code:
n: 344682277495113483576737243789457319844973285487058684789549245491555989770819433641425904625087602042261741581803359854653090524174719942048090727106451863564668263059909 skew: 1 c6: 2 c3: -2 c0: 1 Y1: -1 Y0: 10889035741470030830827987437816582766592 p.s. I've sent email to Sam Wagstaff about both this and 2,799+. p.p.s Is this the best place to post such a reservation, or should I start a new thread? |
|
|
|
|
#41 | |
|
Jul 2003
So Cal
2×34×13 Posts |
Numbers like this always frustrate me. I keep thinking there surely must be a way to use an algebraic factor like, for this one,
65536x^736+65536x^713 + 32768x^690 - 16384x^644 - 16384x^621 - 8192x^598 + 4096x^552 + 4096x^529 + 2048x^506 - 1024x^460 - 1024x^437 - 512x^414 + 256x^368 - 128x^322 - 128x^299 - 64x^276 + 32x^230 + 32x^207 + 16x^184 - 8x^138 - 8x^115 - 4x^92 + 2x^46 + 2x^23 + 1 Degree 32 (or 16) polys are useless, though. Quote:
Greg |
|
|
|
|
|
#42 | |
|
"Ben"
Feb 2007
3×1,171 Posts |
Quote:
something like for(n=2,99,print(n,",",1598\n,",",factor(2^(1598%n)*x^n+1))) |
|
|
|
|
|
#43 | |
|
Nov 2003
22×5×373 Posts |
Quote:
and would have required NFS to finish in any case, should the smaller factor (a p54) be considered an ECM miss? |
|
|
|
|
|
#44 | ||
|
Jul 2003
So Cal
2·34·13 Posts |
Quote:
Quote:
|
||
|
|
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Considering current hardware on the status page | petrw1 | PrimeNet | 20 | 2007-05-24 18:10 |
| Current status | fivemack | NFSNET Discussion | 90 | 2006-11-13 13:37 |
| Current Status | moo | LMH > 100M | 0 | 2006-09-02 01:15 |
| Current status "fishing" | HiddenWarrior | Operation Billion Digits | 1 | 2005-08-19 21:42 |
| Current Status of the Cunningham Tables | rogue | Cunningham Tables | 4 | 2005-06-10 18:28 |