![]() |
Another update has just been uploaded, containing 8 new factors found by Bob Silverman, Al Edwards and Alex Greenbank. There are now 227 composites remaining.
Paul |
[QUOTE=xilman;98304]Another update has just been uploaded, containing 8 new factors found by Bob Silverman, Al Edwards and Alex Greenbank. There are now 227 composites remaining.
Paul[/QUOTE] Is anyone interested in the small Python program [url]http://tom.womack.net/idcomps.py[/url] which takes the list-of-composites from xilman's page and identifies which number they're associated with? I imagine it might be useful for deciding whether to use snfs or gnfs on the smaller ones. Though I probably ought to get it to construct snfs polynomials automatically, for I am lazy and the trade-off between 'think a bit to find the polynomial then run a low-difficulty SNFS job' and 'just throw a C101 at ggnfs/tests/factLat.pl' tends away from the side involving thought ... Kamada's site gives you the N.poly file with the snfs polynomial in when you reserve one of his (a*10^b-c)/9 numbers, which is friendly. |
5,3,241-
[QUOTE=xilman;98304]Another update has just been uploaded, containing 8 new factors found by Bob Silverman, Al Edwards and Alex Greenbank. There are now 227 composites remaining.
Paul[/QUOTE] Another one down: 5,3,241- C128 = p61.p67 9188581135272855171209696187929806826631990050836425475438499 4709163432852740072139259783908478181388600106276445113699436109907 5,4,229- is in progress. 5,4,233+ and 5,3,232+ will be next. I hope someone does 5,3,229+ C106 with msieve. |
[QUOTE=R.D. Silverman;98366]Another one down:
5,3,241- C128 = p61.p67 9188581135272855171209696187929806826631990050836425475438499 4709163432852740072139259783908478181388600106276445113699436109907 5,4,229- is in progress. 5,4,233+ and 5,3,232+ will be next. I hope someone does 5,3,229+ C106 with msieve.[/QUOTE] I will. Just point me to the full expansion of C106, please... :rolleyes: Luigi |
[QUOTE=ET_;98367]I will. Just point me to the full expansion of C106, please... :rolleyes:
Luigi[/QUOTE] 4239563023902513348819622724332183236332083668077140199504712814030159227742607854421301123833862589872079 |
[QUOTE=R.D. Silverman;98368]4239563023902513348819622724332183236332083668077140199504712814030159227742607854421301123833862589872079[/QUOTE]
Thank you. |
[QUOTE=R.D. Silverman;98366]
I hope someone does 5,3,229+ C106 with msieve.[/QUOTE] Why msieve in particular? It would take about a week, and msieve/ggnfs crossover on my hardware is around C98. I've set the gnfs job going, and expect fresh-baked factors by Thursday evening. |
[QUOTE=fivemack;98371]Why msieve in particular? It would take about a week, and msieve/ggnfs crossover on my hardware is around C98. I've set the gnfs job going, and expect fresh-baked factors by Thursday evening.[/QUOTE]
Maybe because msieve can't handle numbers GGNFS can. Maybe because if you can run GGNFS you could help with heavier composites. Maybe because there are people who would like to help but still can't handle GGNFS (like me) :cool: So I guess I should hold my share of help for some other task and stay still... :cry: Luigi |
[QUOTE=fivemack;98371]Why msieve in particular? It would take about a week, and msieve/ggnfs crossover on my hardware is around C98. I've set the gnfs job going, and expect fresh-baked factors by Thursday evening.[/QUOTE]
Perhaps my expectation is faulty. I expect that those running msieve have fewer CPU resources and I therefore leave the easier/smaller composites for them to do. |
[QUOTE=R.D. Silverman;98374]Perhaps my expectation is faulty. I expect that those running msieve have
fewer CPU resources and I therefore leave the easier/smaller composites for them to do.[/QUOTE] Ah, OK ... I've stopped the ggnfs job. So, how hard a job do you expect people to take on? Would a reasonable model be not to take on any job that takes less than a week of CPU time, say a GNFS120 or SNFS140 with the resources I've got access to? Mostly I'm working on aliquot sequences at the moment, where the question doesn't really arise because you reserve a whole sequence; maybe I should reserve one sequence per available CPU and concentrate on those. |
[QUOTE=fivemack;98377]Ah, OK ... I've stopped the ggnfs job.
So, how hard a job do you expect people to take on? [/QUOTE] I don't know how to answer this question. It depends on resources and what people want to do. All I do is try to leave the easier numbers to others. |
| All times are UTC. The time now is 22:31. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.