![]() |
Here are 3 more very easy ones (all < 120 digits SNFS):
3,2,465+ 8844038793820582469962793116221830187979081 (pp43) 166003364452889545632360532945886746495674708221613430166983822831 (pp66) 3,2,465- 344718346343051478407797784017233255388406158530841 (pp51) 165237739630899859983557579281846056369068810091730411 (pp54) 5,2,294+ 130747585464635579912926402323014769677941 (pp42) 5792640261155484328705541883054891512751018036154965488334703907140153429 (pp73) And one larger one that would probably have been better done with ecm: 3,2,489- 15883726845443989279435501695883616227 (pp38) 1152983328867105939583249092074339419063663853496739904496315216352949668238107074886122787363992357027014828199009793 (pp118) Greg |
Mopping up another extremely easy one ...
5,3,252+ 280493387233888979938341790621609371375822721 (pp45) 160214688602364449805103194663534693310306537357667880961 (pp57) I'll do 5,4,282+, 5,3,267+, 5,3,297+, 5,3,279-, 5,2,260+, 5,2,297-, 3,2,453+, and 3,2,429-. These range from 125 to 145 digit SNFS factorizations, so they won't take long to finish. Greg |
Here are the results...
5,4,282+ 867957039708796589428467005573520833413 (pp39) 27446973080747464123221310013160221419333 (pp41) 22244520683185442894949212572602099331164782715289 (pp50) 5,3,267+ 6723789373525015879256142001890137471015973961 (pp46) 1432418075124920788188560418927247123363989607131805407099380426386351 (pp70) 5,3,297+ 2669383197062414188005672186594933976309 (pp40) 78208569715320201954345345005115194295289796530449638865812285455402435314277099 (pp80) 5,3,279- 73967585934790288986331063680839395230949 (pp41) 249229294469252360399437793041533202536166676541660704663724878410837158096223 (pp78) 5,2,260+ 6515946671125059188191231609743883261059761 (pp43) 21388935877265522504848682180265868392817056483327499865521 (pp59) 5,2,297- 284383285136688305818059537331045589578072384271241637 (pp54) 145056283691862730111792085464769511233424787717379952001 (pp57) 3,2,453+ 2034102992453066450892721473358234127217055269386167 (pp52) 2080339376942741524864316584524697228730248567415892031172986297 (pp64) 3,2,429- 86627815656423367235045202728652782077374869353 (pp47) 1740074009446818056971062314322451659431184519760538083 (pp55) 4,3,343+ 1834916006790976799140157520929587865958055439912507288221 (pp58) 7940695264577348708236634779441974505153618240772615529303133905075820494063854311888997584829487155946280267 (pp109) Greg |
Updated tables
Updated tables have just been loaded on my web page.
The number of factors reported are split approximately evenly between the ECMNET server and those found by NFS. The server has also been updated to remove the NFS-factored composites from its allocation. Now down to 180 composites. Making good progress. :smile: Paul |
[QUOTE=xilman;99315]Updated tables have just been loaded on my web page.
[/QUOTE] A small bug crept into the update file with 5,3,229+ on 2007-02-14: My name is Schindel, not Schindler. |
[QUOTE=Andi47;99321]A small bug crept into the update file with 5,3,229+ on 2007-02-14: My name is Schindel, not Schindler.[/QUOTE]My apologies. :blush:
I'll fix it. Paul |
[QUOTE=xilman;99331]My apologies. :blush:
I'll fix it.[/QUOTE]Now fixed. Paul |
Thanks. :smile:
|
A few more:
4,3,343- 304839179087302933445868776423442651338790642905936015409363325914011 (pp69) 2635258252313137569419176011940557768930390624104161091139980159825159117032817488577452427 (pp91) 5,2,253+ 220793828340169317839097508967492286047258754371 (pp48) 13652045697882352456715541843919373895448398855481281883887357329 (pp65) 5,3,253- 21968838212320775795587684745950797914044922751135239 (pp53) 107059771413355648357937325794168189913588732216832081522022438636520458425954566032962089975891163 (pp99) 5,4,253+ 531081904214100561330242328374941 (pp33) 64944784903320505312389845753479356534470587 (pp44) 6056505947986940114625302553439355475096480643164835517190967 (pp61) Greg |
I think this project needs some sort of registration system now ... I've just finished factoring the C115 of 5^267+3^267 with gnfs, a number which has now been factorised thrice (two SNFS and one GNFS), not counting the SNFS-but-didn't-run-enough-sqrts that I'd done last weekend.
I appreciate that writing a registration system takes time, tuits and moderately serious network access, and that lots of the high-powered people on this board lack at least one of these; I have started writing one, will put up an announcement when it's ready. In the absence of a fully-automated registration system, I'd like to reserve the C132 from 3^500+2^500 (starts 15608) and the C131 from 10^271+4^271 (starts 56584). I think the first is a relatively easy SNFS number and the second is impossibly hard by SNFS but not unreasonably by GNFS. |
[QUOTE=fivemack;99359]I appreciate that writing a registration system takes time, tuits and moderately serious network access, and that lots of the high-powered people on this board lack at least one of these; I have started writing one, will put up an announcement when it's ready.[/QUOTE]Excellent!
The ECMNET server is, of course, a reservation system in its own domain. Unfortunately, it knows nothing about independent factorizations until I spend time and effort teaching it about them. Another session occurred earlier today to remove Greg's NFS results. Perhaps a good starting point would be to assume that, say, the 20 easiest SNFS targets and the 20 easiest GNFS targets are reserved from the start. When either of those batches fall below ten numbers, the next ten are added. The hysteresis just defined makes it significantly easier for me to update the ECMNET server as I only have to do so after each batch of ten factors for each method. Paul |
| All times are UTC. The time now is 22:43. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.