mersenneforum.org Some Somewhat Easier n^i Sequences Available for Termination
 Register FAQ Search Today's Posts Mark Forums Read

 2022-03-16, 21:33 #1 EdH     "Ed Hall" Dec 2009 Adirondack Mtns 2·2,551 Posts Some Somewhat Easier n^i Sequences Available for Termination In the sub-project Aliquot sequences that start on the integer powers n^i, there are some sequences that should terminate with a prime. This thread will list those with a current term that is less than 145 digits* and flagged as unreserved. These sequences are mostly above those of the main project, although some may drop into the main project on their way to termination.** If you are interested in the excitement of terminating an Aliquot Sequence, although not guaranteed, these are pretty sure bets to do so. Note: For anyone, new or old that would like to automate some of their work, please look at the script in post 7 below. The script can be used with Aliqueit to convert the base^exponent value to its decimal and invoke Aliqueit to run the sequence and upload the results. Please visit the thread mentioned above and its associated page for more details. You may reserve the available sequences in this thread and see the current status on the project pages, as updates are applied. It is suggested that if you will take more than a day (or two) to terminate a sequence, you reserve it, so others don't duplicate your work. The following are the current reservations (but, also check the latest posts): Code: As of the time of the last edit (fiddling), the following sequences were available: Code: * The current threshold of 145 digits was chosen to ensure the listing has at least a fair number of sequences, with some more challenging. ** Sequences of the type n^i where both n and i are either odd or even (matched parity) nearly always terminate. Also, sequences where n is double a perfect square nearly always terminate. On occasion one will merge with a sequence in the main project and become open-ended. The following are the terminated sequences that have not yet been updated in the tables. Many have unknown credit for termination (listed as A). If "The Terminator" would like credit, please claim it in this or the other thread: Code: 39^99: Prime - EDH 419^1: Prime - A 419^3: Prime - A 419^5: Prime - A 419^7: Prime - A 419^9: Prime - RFD 419^11: Prime - RFD 419^13: Prime - RFD 419^15: Prime - RFD 419^17: Prime - A 419^19: Prime - RFD 419^21: Prime - RFD 419^23: Prime - RFD 419^25: Prime - RFD 419^27: Prime - RFD 419^29: Prime - RFD 419^31: Prime - RFD 419^33: Prime - RFD 419^35: Prime - RFD 419^37: Prime - RFD 419^39: Prime - RFD 419^41: Prime - RFD 419^43: Prime - RFD 419^45: Prime - RFD 419^47: Prime - RFD 419^49: Prime - GDB 419^51: Prime - GDB 419^53: Prime - GDB 419^55: Prime - GDB 419^57: Prime - GDB 419^59: Prime - GDB 419^61: Prime - GDB 421^1: Prime - A 421^3: Prime - A 421^5: Prime - A 421^7: Prime - A 421^9: Prime - RFD 421^11: Prime - RFD 421^13: Prime - RFD 421^15: Prime - RFD 421^17: Prime - RFD 421^19: Prime - RFD 421^21: Prime - RFD 421^23: Prime - RFD 421^25: Prime - RFD 421^27: Prime - RFD 421^29: Prime - RFD 421^31: Prime - RFD 421^33: Prime - RFD 421^35: Prime - RFD 421^37: Prime - RFD 421^39: Prime - RFD 421^41: Prime - RFD 421^43: Prime - RFD 421^45: Prime - RFD 421^47: Prime - RFD 421^49: Prime - GDB 421^51: Prime - GDB 421^53: Prime - GDB 421^55: Prime - GDB 421^57: Prime - GDB 421^59: Prime - GDB 421^61: Prime - GDB 421^63: Prime - GDB Last fiddled with by EdH on 2022-12-03 at 14:04 Reason: Updates
 2022-03-16, 23:55 #2 RichD     Sep 2008 Kansas 3×7×179 Posts I went through some of my recent initializations and found a few that might be worthy to elevate into the first post. Code: 84^66: 128/104 84^68: 132/116 84^70: 136/119 86^66: 128/115 86^68: 131/128 86^70: 136/122 90^68: 134/129 91^65: 127/120 91^67: 131/107 91^69: 135/122 92^62: 122/94 92^64: 126/115 92^66: 130/113 92^68: 134/99 93^65: 128/101 93^67: 131/103 93^69: 136/108 95^63: 124/116 95^65: 129/100 95^67: 133/119 95^69: 136/124 96^66: 132/118 96^68: 136/128
 2022-03-17, 00:20 #3 EdH     "Ed Hall" Dec 2009 Adirondack Mtns 2×2,551 Posts Thanks Rich, I hadn't planned to make this a new source, but maybe that would work. I'll try to keep up with new available sequences, at least for now. If we can get some more interest, the newcomers can also initialize some bases and work both terminations and open-ended, too.
 2022-03-17, 02:35 #4 VBCurtis     "Curtis" Feb 2005 Riverside, CA 32·617 Posts I'll help with administration on this thread- updating post 1 with reservations, etc.
 2022-03-17, 12:32 #5 kruoli     "Oliver" Sep 2017 Porta Westfalica, DE 3×409 Posts If appropriate, I would like to take these: Code: 3^333: 134/123 84^70: 136/119 86^70: 136/122 90^68: 134/129 91^69: 135/122 92^68: 134/99 93^69: 136/108 95^69: 136/124 96^68: 136/128
 2022-03-17, 14:07 #6 EdH     "Ed Hall" Dec 2009 Adirondack Mtns 117568 Posts Perhaps we should discuss which direction to take this thread, and how to minimize confusion with the main thread. My initial vision was to have a few smaller sequences available to introduce newcomers to the project at a level they could work with a single machine. As it now looks, we could create a large set of available sequences, much larger than my original thoughts. This could easily spiral into a mass of confusion for us. We need to keep this coordinated with Jean-Luc and not task him too heavily. We need also to consider yoyo in this, since he'll be needing <140 work for his hungry project. Let's step back momentarily to prioritize project goals. We'll need Jean-Luc to help with this. Advancing the tables is going to be more intensive due to how fast the terms now get large. How does table advancement, vs. same parity termination, vs. new table additions work toward the goals that provide the data for the questions that drive this project? My proposals, for now: - We hold only a very few to attract newcomers and see if we do. (we need to decide how few, etc.) - We should go ahead and terminate the rest among ourselves as we would normally do. - - kruoli has asked for some. I'm OK with that and they aren't reserved in the tables, but I would also like input from RichD, since he provided the bulk of them.* - - VBCurtis also expressed interest in the ones I'm bringing below 140 digits. Let's go ahead and let our members reserve and work these as we have been.* - I'm hesitant due to workload and confusion, but we may want to use the first post as a reference to smaller, same parity, available sequences. I would accept all help in that upkeep, but again, I'd like to minimize confusion with the main thread and Jean-Luc, so the table workings don't get too complicated. Keeping up with reservations could become duplication of effort and confusion if it isn't timely. * We still need to use the other thread for reservations so the tables get updated and I'll move any reservation posts from this one over once we've discussed this a little more. We could be more timely showing reservation status here, but would it conflict with those on the main table pages? All comments welcome. . .
 2022-03-17, 14:51 #7 kruoli     "Oliver" Sep 2017 Porta Westfalica, DE 3·409 Posts If we want to attract new personnel, I would suggest we take their hand a bit (at least give the possibility) and give some guiding on how to execute this work. For example, I prepared a small script for this thread: Code: export BC_LINE_LENGTH=0; # disable line breaks in bc bc < list.txt > list.bc; line_count_input=$(wc -l < list.bc); base_dir=../terminations; rm -f *.log siqs.dat nfs.*; for i in$(seq 1 $line_count_input); do number=$(sed "${i}q;d" list.bc); # use this instead of read line (etc.) to prevent a misdeteciton of file redirection in YAFU, which would enter batch mode and cause problems alq_file=alq_${number}.elf; wget -O $alq_file "http://factordb.com/elf.php?seq=${number}&type=1"; line_count_elf=$(wc -l <$alq_file); ./aliqueit -y $number | tee execution.log; # use tee to see the progress while still logging to a file ./aliqueit -s$(($line_count_elf-1))$number > upload.log; # maybe check if upload limit was reached here dir=$base_dir/$(sed "${i}q;d" list.txt); mkdir$dir; mv -t $dir aliqueit.log execution.log upload.log$alq_file; done; Put your work in a file named list.txt, one entry per line in the form x^y. It is assumed that you have an aliqueit executable in the same directory as the script (optimally with aliqueit.ini and yafu.ini if you have configured aliqueit to use YAFU as it would be recommended). Additionally, you would need wc, wget, sed and bc (these do not come with every Linux distribution by default). It will get the current ELF files and upload the results immediately after a sequence has terminated. The results will be stored as condfigured by base_dir. (One could add another parameter to aliqueit to prevent getting in the rare case of a sequence not ending trivially.) We could add links to threads (e.g. EdH's) on how to set up and compile YAFU(2) and aliqueit. As an aside, how do you pronounce aliqueit? Like ah-lee-kweet? Last fiddled with by kruoli on 2022-03-17 at 14:56 Reason: Fixed a typo.
2022-03-17, 15:43   #8
EdH

"Ed Hall"
Dec 2009

2·2,551 Posts

Quote:
 Originally Posted by kruoli If we want to attract new personnel, I would suggest we take their hand a bit (at least give the possibility) and give some guiding on how to execute this work. For example, I prepared a small script for this thread: . . . We could add links to threads (e.g. EdH's) on how to set up and compile YAFU(2) and aliqueit. As an aside, how do you pronounce aliqueit? Like ah-lee-kweet?
This could be a great idea, especially if we get anyone at that beginning of a level. I would hope the script wouldn't look too complicated to them. We can add this to the first post once we have a clear direction.

My pronunciation, which is actually rarely vocal, is more ah-leh-cue-it, but the ah still isn't quite right. I don't know the author's version.

 2022-03-17, 16:36 #9 RichD     Sep 2008 Kansas 3·7·179 Posts Perhaps it is I that has the misunderstanding. For a newbie to look at the main status table is a bit overwhelming. For the rest of us that grew up with it, it is easy to understand. I mostly do initialization work. Take sequences up to C100. If they start bigger, I take the (expected) terminating ones from C118-C120 to termination. I leave several in the C120-C140 range and above.
 2022-03-17, 18:44 #10 garambois     "Garambois Jean-Luc" Oct 2011 France 2·33·19 Posts Thank you very much Edwin for taking care of this and thank you very much to all the other people who are taking part in this new venture concerning n^i sequences with n and i of the same parity (matched parity) and with i large enough to require a good computing power. I don't know at the moment if I have a role to play in this thread ? I think the easiest way to avoid any confusion is indeed for you to let me know about your reservations on the main project thread, that's what I understand ? Then I will update the project page according to these reservations.
 2022-03-17, 22:24 #11 RichD     Sep 2008 Kansas 1110101011112 Posts My (two cents) thoughts are, we would have a list of terminating candidates in post #1. People would speak up here to reserve a few. No need to flag them in post #1, simply remove them from the availability list. As more are spotted they can be added. We should never deplete the list, always leave a few. Since the termination runs usually last less than a day (or so), no need to flag them here. As they complete they should be reported in the main thread for proper credit. This thread is for add and subtract. More thoughts welcome.

 Similar Threads Thread Thread Starter Forum Replies Last Post Miszka Software 22 2021-11-19 21:36 mathPuzzles Math 8 2017-05-04 10:58 xtreme2k Math 34 2013-09-09 23:54 EdH Aliquot Sequences 6 2010-04-06 00:12 10metreh Aliquot Sequences 0 2010-03-11 18:24

All times are UTC. The time now is 21:24.

Sun Dec 4 21:24:34 UTC 2022 up 108 days, 18:53, 0 users, load averages: 0.66, 0.88, 0.85

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔