YA aliquotsequencechasing script
1 Attachment(s)
Here's the python script I've been using to chase aliquot sequences.
The input file is <number> <index in sequence> then a long list of primes that turned out to be useful (order doesn't matter); just run python aliquot.py <input filename>, and it will add new useful primes to the bottom. Features: incremental ECM, selftiming GNFS with recovery from not having enough relations, reasonably optimised crossover GNFS/MPQS and between different GNFS sizes, nice and small and written in fairly clear Python. Can be stopped at any point in ECM or GNFS and will restart at the same place; I haven't bothered tracking where the temporary directory for msieve is so it doesn't restart msieve MPQS jobs, but it should never run one of those for more than about half an hour. Set the PROG_ variables at the top to something appropriate; you need ecm, msieve and a directory with gnfslasieve4I11e through gnfslasieve4I13e in it. 
11e vs. 12e?
[QUOTE=fivemack;191144]gnfslasieve4I11e through gnfslasieve4I13e[/QUOTE]
For which ranges of input size (GNFS resp. SNFS) do you use 11e; where is the approx. crossover between 11e and 12e? 
This is a pureGNFS script; I found that 11e was better than MPQSwithmsieve or than 12e from about 85 to about 93 digits. Though I may be confounding things by using 23bit large primes with 11e and 24bit with 12e. Just not enough data points to be certain.

[QUOTE=fivemack;191149]This is a pureGNFS script; I found that 11e was better than MPQSwithmsieve or than 12e from about 85 to about 93 digits. Though I may be confounding things by using 23bit large primes with 11e and 24bit with 12e. Just not enough data points to be certain.[/QUOTE]
Consistent with my experience. See [URL="http://www.mersenneforum.org/showthread.php?t=10871&page=5#post190551"]here[/URL] 
I am not understanding exactly what this does. Are you giving a list of primes you want to run ggnfs and ecm on? what does the aliqueit part do? Or are the primes, the known primes of that index of the given seq?

You give it the starting point, and you give it a list of primes which divide some numbers in the sequence after that starting point; it refactorises everything, it's just that the first method it uses is trial division by a set of primes known to include the factors, which is really quick.
And then having done the factorisation it computes sigma(n)n and continues. 
All times are UTC. The time now is 06:29. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.