![]() |
|
|
#265 |
|
Feb 2004
25810 Posts |
|
|
|
|
|
|
#266 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10AB16 Posts |
This request might be out of the scope of aliqueit.exe, but I think it'd be great if it had support for expressions and for reading in a list of numbers to factor. e.g. you could have a file named 3045.txt with this in it:
Code:
11018340991488369220774176542232958731662721978339859921879635728252983742300159 3045*2^20-1 3045*2^21-1 3045*2^22-1 ... Code:
11018340991488369220774176542232958731662721978339859921879635728252983742300159 ABC 3045*2^n-1 20 21 22 Due to the lack of these two features (and the fact that aliqueit is the best program I know of to factor a number from start to finish with various methods), here's what I've been doing: (if you decide not to put this feature in, this may be useful to someone else doing bunches of factorizations )
To anyone: Let me know if you know of a better way to get the job done (wouldn't necessarily have to be with aliqueit, but I don't know of anything better). ![]() The biggest problems with this, besides the inconvenience to do it all, is that aliqueit.exe has to start up again over and over, read its configuration over and over, print out its configuration over and over, and create and write to new .elf files over and over. (who knows how much time all that wastes!) Last fiddled with by Mini-Geek on 2009-07-29 at 02:14 |
|
|
|
|
|
#267 |
|
Tribal Bullet
Oct 2004
3·1,181 Posts |
Msieve can both parse expressions and perform a list of factorizations in batch mode. Just put multiple numbers in the input file. It should all work fine until you hit an input that requires NFS...
|
|
|
|
|
|
#268 |
|
"Ben"
Feb 2007
1101110000012 Posts |
YAFU can as well, although again, not for NFS inputs.
Last fiddled with by bsquared on 2009-07-29 at 03:08 |
|
|
|
|
|
#269 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Quote:
YAFU has similar issues, I know that its ECM is far slower than GMP-ECM's implementation. (this doesn't surprise me since GMP-ECM is built specifically for ECM, but it should still be considered when looking at overall speed) Last fiddled with by Mini-Geek on 2009-07-29 at 03:27 |
|
|
|
|
|
|
#270 | |
|
Nov 2008
2×33×43 Posts |
Quote:
|
|
|
|
|
|
|
#271 |
|
Feb 2004
2×3×43 Posts |
It's a nice idea, and I agree it's a bit unnecessarily restricting to only let aliqueit factor aliquot sequences. I'll add it to the list now, but I expect it'll be a while before it gets removed.
|
|
|
|
|
|
#272 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
|
|
|
|
|
|
#273 |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
|
|
|
|
|
|
#274 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2×33×109 Posts |
|
|
|
|
|
|
#275 |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Without -e, it only searches for 15-digit factors with ECM. With -e it searches for factors in 5-digit factor size chunks starting at 15 (15, 20, ...) which is almost always very inefficient. Compare with aliqueit which sets the factoring depth based on the 1-digit incoming number chunks, and sets the factor size within the thousandth based on that.
Last fiddled with by Mini-Geek on 2009-07-29 at 15:11 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Resuming aliqueit | johnadam74 | Aliquot Sequences | 4 | 2016-03-28 12:32 |
| Apparent aliqueit issue with specifying factors | pakaran | Aliquot Sequences | 2 | 2015-09-12 23:10 |
| Using Several Instances of Aliqueit for a large gnfs job | EdH | Aliquot Sequences | 6 | 2011-12-13 18:58 |
| Setting up aliqueit | science_man_88 | Aliquot Sequences | 185 | 2011-11-08 12:18 |
| Tried out aliqueit.exe: ggnfs failing | Greebley | Aliquot Sequences | 35 | 2010-02-13 15:23 |