@William: what's the best poly for 908306476686395841704478413585742205345423^7-1 ?

I see that 2657^73-1 is now fully factored in FactorDB: 2^5 * 83 * 54751 * p52 * p74 * p117.

I [i]think[/i] I've caught up on this topic's backlog for numbers suitable for 14e, besides C189_147_41 posted by Sean above, whose sieving seems likely to fail on many NFS@Home clients, and the poly for C168_P169_plus_1 posted by Rich in the previous post.

[QUOTE=debrouxl;426380]

I [i]think[/i] I've caught up on this topic's backlog for numbers suitable for 14e, besides C189_147_41 posted by Sean above, whose sieving seems likely to fail on many NFS@Home clients...[/QUOTE]

Sorry if it breaks 14e on the -a side. It can be sieved on the -r side without crash in Windows and the yield/speed isn't horrible and still suitable for 14e (i.e. months on an individual machine).

Maybe some of these would fit?

[b]C233_128_67[/b], 7600 curves at B1=43M
Sextic (difficulty 234): 2*(2[sup]78[/sup])[sup]6[/sup] + 4489*(67[sup]21[/sup])[sup]6[/sup] = 9 * C233

[b]C172_145_36[/b], 7600 curves at B1=43M
Sextic (difficulty 226): (145[sup]6[/sup])[sup]6[/sup] + 36*(6[sup]48[/sup])[sup]6[/sup] = 4407612197603657835372217347030574421197174031327075617 * C172

[b]C193_146_35[/b], 7600 curves at B1=43M
Sextic (difficulty 228): (146[sup]6[/sup])[sup]6[/sup] + 178850*(35[sup]24[/sup])[sup]6[/sup] = 51521541284946016524262734989617686 * C193

[b]C185_150_37[/b], 7600 curves at B1=43M
Sextic (difficulty 235): 150*(150[sup]6[/sup])[sup]6[/sup] + (37[sup]25[/sup])[sup]6[/sup] = 737215667922437160601163483856439485613104145505617 * C185

[b]C213_150_38[/b], 7600 curves at B1=43M
Sextic (difficulty 226): 5625*(75[sup]6[/sup])[sup]6[/sup] + 16*(2[sup]18[/sup]*19[sup]25[/sup])[sup]6[/sup] = 15732718408061 * C213

[QUOTE=debrouxl;426380]@William: what's the best poly for 908306476686395841704478413585742205345423^7-1 ?[/QUOTE]

x^6 + x^5 + x^4 + x^3 + x^2 + x +1

Sean: alright.

XYYXF: indeed, I'd consider queuing C233_128_67 and C185_150_37 after 3000 additional curves at B1=11e7, and C193_146_35 after 1000 additional curves at B1=11e7 :smile:

William: thanks, no surprise there.

Rich has prepared [URL="http://www.mersenneforum.org/showpost.php?p=426405&postcount=402"]3349427^37-1[/URL] to 2/9 the SNFS size. The base is larger than 10^5, putting it outside [URL="http://www.mersenneforum.org/showpost.php?p=408161&postcount=167"]the guildelines[/URL] and in the "test sieving" category. I'm hopeful that the small size will allow the large coefficient to be accommodated. If it sieves OK, does it need more ECM because of the large coefficient?

[QUOTE=debrouxl;426502]Sean: alright.
[/quote]

Thanks Lionel. Strange edge case that crashes the sievers in Windows, though I'd hoped that would not be the case with Greg's lasieved version. Ah well, the -r side is still quite feasible.

[quote]

XYYXF: indeed, I'd consider queuing C233_128_67 and C185_150_37 after 3000 additional curves at B1=11e7, and C193_146_35 after 1000 additional curves at B1=11e7 :smile:

[/QUOTE]

I will take on the ECM preprocessing for these three.

The C170 from [URL="http://factordb.com/index.php?id=1100000000438761801"]P226+1[/URL] needs a polynomial. Yoyo@home has finished ECM to 1/3 the size

[URL="http://factordb.com/index.php?id=1100000000126582661"]P226[/URL] is the largest factor of [URL="http://factordb.com/index.php?id=1100000000438403097"]67123837929583^19-1[/URL]
67123837929583 is the largest factor of [URL="http://factordb.com/index.php?query=%281824910918879^3-1%29%2F1824910918878"]1824910918879^3-1[/URL]
1824910918879 is the largest factor of [URL="http://factordb.com/index.php?query=%2868197734648262835801^3-1%29%2F68197734648262835800"]68197734648262835801^3-1[/URL]
68197734648262835801 is the largest factor of [URL="http://factordb.com/index.php?id=1100000000824012607"]38533987^5-1[/URL]
38533987 is the largest factor of [URL="http://factordb.com/index.php?query=%28917087137^3-1%29%2F917087136"]917087137^3-1[/URL]
917087137 is the entire value of [URL="http://factordb.com/index.php?query=%2831^7-1%29%2F30"]31^7-1[/URL]

[QUOTE=debrouxl;426502]

XYYXF: indeed, I'd consider queuing C233_128_67 and C185_150_37 after 3000 additional curves at B1=11e7, and C193_146_35 after 1000 additional curves at B1=11e7 :smile:

[/QUOTE]

C193_146_35 withstood 1000 curves @B1=11e7 with no factors found,

[QUOTE=wblipp;426673]The C170 from [URL="http://factordb.com/index.php?id=1100000000438761801"]P226+1[/URL] needs a polynomial. Yoyo@home has finished ECM to 1/3 the size[/QUOTE]

A nice one.
[CODE]N: 18918769869288207198466725110967315371191764034670151862789513841419587114089629873323974302396531779434294426417082899096587495228166081161483242105460608924414530083843
# expecting poly E from 3.43e-13 to > 3.95e-13
R0: -598909502600164119064030034092291
R1: 5326229335002919
A0: 5187900263782282783191863042477453898000
A1: -169726054739309674041642615736010
A2: 2445047808565842300322678279
A3: -489709919219673272396
A4: -24099822809948
A5: 245520
SKEW: 12533068.76
# skew 12533068.76, size 1.683e-16, alpha -7.355, combined = 3.915e-13 rroots = 3[/CODE]

Just wanted to follow up and see if the C190 for Home Primes 2 (4496) from [URL="http://www.mersenneforum.org/showpost.php?p=425167&postcount=365"]this[/URL] post is a good candidate for NFS@Home?

Thanks! :smile: