20180323, 06:08  #518 
May 2007
Kansas; USA
7·13·113 Posts 
Is there a way to make aliqueit stop when a certain size is reached?
Additionally is there a way to make it stop when a certain "hard" factor size (CSize) is reached? By hard factor size, I mean one in which survives the usual amount of ECM. Last fiddled with by gd_barnes on 20180323 at 06:12 
20180323, 06:31  #519 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3·29·83 Posts 
Code:
./aliqueit h Reading config file... [...] aliqueit v1.12 by Mikael Klasson 20092010, http://mklasson.com usage: aliqueit [i <index> <start_value>] [f <factor>] [s <start>] [y] [e] [p] [t] [q] [d <max_digits>] [c <max_cofactor>] [r <add_digits>] [m <max_ecm_level>] [b] <seq> Computes the aliquot sequence starting at <seq>. <factor> will be tested against the next sequence value. Multiple factors can be given with multiple f. If no <index> is given the program continues where the elf file ends. In this case the elf file is also checked for correctness at startup. y uses YAFU for all factoring after rho e skips ecm on the current iteration and goes straight to qs/gnfs. p runs at idle priority. q quits after factoring the first number. d quits after sequence reaches <max_digits> digits. c quits after sequence passes ecm with a cofactor of <max_cofactor> or more digits. b with c and d quits after a number meets both limits. r with c or d (or both) increases max digit/cofactor by <add_digits> if no driver. m ecm will only run to level <max_ecm_level> where '1'=20digit factor, '2'=25, etc. s submits the iterations <start>+ from <seq>'s elf file to Syd's DB. You'll need wget to use s. t quits after verifying elf file integrity. Last fiddled with by Dubslow on 20180323 at 06:31 
20180323, 06:38  #520 
May 2007
Kansas; USA
7·13·113 Posts 
Great! Thanks. I guess I should have read the aliqueit help file first.

20180323, 13:06  #521 
Apr 2013
Germany
100110101_{2} Posts 
I personally use "c 120 m 5" and a script to loop over my reserved sequences. I have used an additional "r 5" before but this was not working as I expected (the limit was not increased to 125 digits but removed altogether) and I saw no way to fix it easily. So be careful with "r".

20180630, 20:03  #522 
Mar 2010
55_{10} Posts 
I haven't used aliqueit in some time. When I tried to submit to FactorDB I got a 404 not found error. Do I need to update something?

20180630, 20:41  #523  
Sep 2008
Kansas
7·463 Posts 
Quote:
http://www.mersenneforum.org/showpos...&postcount=510 

20180702, 00:07  #524  
"Rich"
Aug 2002
Benicia, California
2×5×7×17 Posts 
Quote:


20180706, 16:19  #525 
"Daniel Jackson"
May 2011
14285714285714285714
27D_{16} Posts 
I've noticed that Aliqueit doesn't detect certain drivers/guides properly:
2^5*3*7 (Shows up as "Guide: 2^5*3"; should say "Driver: 2^5*3*7") 2^7*3*5*17 (Shows up as "No driver"; should say "Guide: 2^7*(Insert divisor of 255 here)") 2^8*7*73 (Shows up as "No driver", "No 3", or "Large power of 2"; should say "Guide: 2^8*7*73") 2^30*2147483647 (Shows up as "No 3"; should say "Driver: 2^30*M31" or "Driver: 2^30*2147483647".) Something similar should be done for 2^60*M61, 2^88*M89, 2^106*M107, and 2^126*M127. It should also autodetect the factors of the next term, using the current driver/guide (i.e. 2^30*M31^2*p with p mod 4=1 will result in a number divisible by M31, but not 2^30). That would be useful when running sequences of the form 2^126*p*M127, so as to not have to put in "q f 170141183460469231731687303715884105727" (even with copy/paste) on every term of the sequence. That would save a LOT of time running such sequences. Last fiddled with by Stargate38 on 20180706 at 16:19 Reason: clarification 
20180707, 08:41  #526  
Apr 2013
Germany
309_{10} Posts 
Quote:
2^7*3 should say "Guide: 2^7*3" 2^7*3*5 should say "Guide: 2^7*3*5" 2^7*5 should say "Guide: 2^7*5" ans so on with all combinations of the three divisors OR 2^7*3*5*17 should say "Guide: 2^7*3*255" Case 4 is a bit more tricky as the trial division that tests the driver/guide only checks the primes from 1 to 127. I would need to add a hardcoded list of mersenneprimes to test. But if this is only done for high powers of 2 I think it's worth doing. It would also help with the approach taken below. Quote:
The number of MP is also very small since we only need: M13, M17, M19, M31, M61, M89, M107, M127. Would that work? Last fiddled with by ChristianB on 20180707 at 08:41 

20180707, 12:23  #527 
Apr 2013
Germany
309_{10} Posts 
I've gone ahead and implemented the easy stuff. Since there are a lot of changes compared to the original 1.12 from mklasson I decided to release a 1.13 with my changes so far (https://github.com/ChristianBeer/aliqueit/releases). Unfortunately my efforts in building a Windows version were not successful so I only provided a Linux binary. If someone gets a Windows build from my code before me just let me know and I can update the github page.

20180707, 15:40  #528  
Sep 2009
2^{2}×3^{2}×5×11 Posts 
Quote:
Chris 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Resuming aliqueit  johnadam74  Aliquot Sequences  4  20160328 12:32 
Apparent aliqueit issue with specifying factors  pakaran  Aliquot Sequences  2  20150912 23:10 
Using Several Instances of Aliqueit for a large gnfs job  EdH  Aliquot Sequences  6  20111213 18:58 
Setting up aliqueit  science_man_88  Aliquot Sequences  185  20111108 12:18 
Tried out aliqueit.exe: ggnfs failing  Greebley  Aliquot Sequences  35  20100213 15:23 