20210806, 06:59  #1288 
"Garambois JeanLuc"
Oct 2011
France
2^{4}·43 Posts 
For Your Information :
I have started the data analysis. I am also in the process of refining the analysis programs. I will launch the big summer 2021 scan of all project sequences on Monday, August 9 after 6:00 GMT. I think I will include some bases that are not yet listed on our page, like 51, 276, 552... If by that date some of you still manage to finish sequences or initialize other bases, don't forget to let me know and to enter your results on FactorDB so that your last calculations are taken into account. About the 256bit limit of Sweety : It is true, it is not very high and it would be very nice if the limit would be increased to 100 digits minimum as it is usual. But what is very important for me is that the trivially terminating sequences are all calculated and terminated for all sequences whose first term has less than 120 digits (exponent 56 for base 120). This way I can copy and paste the whole block at once when I create the new database and I don't have to reorder them, interleave them, sort them manually. If this is not done, my work time is really increased tenfold and it is exhausting and errorprone. I prefer to spend my time and energy processing the data... 
20210806, 08:51  #1289  
"Alexander"
Nov 2008
The Alamo City
2^{3}·97 Posts 
Base 564 can be included in the next update. I'm currently trying to terminate the trivial sequences between 120 and 135 digits, but all of the other initialization work for that base is done. So far, there have been two nontrivial prime terminations.
Quote:
Quote:
To counter your argument about these open sequence bases needing to be "special", have we shown the sequences for the primorial bases to be "special"? Even if they don't turn out to be special mathematically, they're of possible interest as a welldefined source of bases to add, and IMHO that's reason alone to categorize it. (As an aside, we should also add the factorials as a category now that 120 is being initialized.) 

20210806, 13:16  #1290 
"Curtis"
Feb 2005
Riverside, CA
3·19·89 Posts 
After seeing what Sweety did to Gary's projects for years, I'm deleting Sweety's tiny update posts. The one deleted a few posts up covered 3 odd powers to less than 100 digits, nothing of interest.
Sweety If you want to avoid having your posts deleted here, wait until you're done with all the sequences of 120^n that you're going to work on. The only exception is an odd power that terminates / merges, since those are considered interesting events. We want one report, NOT daily progress. If that takes you a month or more to complete, that's fine; don't tell us about your work in the meantime. Also, if you care to report the cofactor length of a sequence you're done with, do it in decimal digits not bits. 
20210806, 14:10  #1291  
Oct 2002
France
2·79 Posts 
Quote:
 I use Map instead of Vector for faster lookup  I initialize the Map in the loop that load the file  Using the map, remove a loop level (From 3 to 2 nested loop)  Add time counters (Total/Download/Compute) Here is an output example: Code:
Running base 2577846 from 1 through 1 . . . Downloading base 2577846^1 : Done Found the last 80 digit composite in base 2577846: [89222463159839875999432010157696421431341480313103789603011845300916805141579206] 80 digit composite has a matching in base 10528 Downloading base 10528 : Done 2577846^1:i2335 merges with 10528:i2 Total running time : 49 Seconds : 210 Milliseconds Downloading file time: 49 Seconds : 114 Milliseconds Computation only time: 95 Milliseconds Not tested with last exponent > 1 Enjoy... 

20210806, 14:26  #1292 
"Ed Hall"
Dec 2009
Adirondack Mtns
1016_{16} Posts 

20210806, 15:04  #1293 
Sep 2008
Kansas
2^{2}·5·173 Posts 
Can you perform a table update over the weekend so we can spot any deficiencies? Better yet, perhaps you can also flag them in a post here and some of us will try to complete the calculations by Monday afternoon (GMT).

20210806, 17:23  #1294 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2^{2}·3^{3}·5·11 Posts 
I am going to take a shot at 6!=720

20210806, 19:13  #1295  
"Garambois JeanLuc"
Oct 2011
France
2^{4}×43 Posts 
Quote:
This base will be added in the next update. Quote:
And I agree with you : better to calculate new bases for now. Quote:
That's why I think we can say that the primorial bases play a special role in our project, so they are "special". In principle, we can also add a category for bases that are factorials when we will have several of them, why not ? None of these bases can be taken out of this category in the future, no matter what. 

20210806, 19:24  #1296 
"Garambois JeanLuc"
Oct 2011
France
2^{4}·43 Posts 
Thanks a lot.
But forgive my ignorance, I can't compile this program under Linux, here is what my compiler says : Code:
garambois@floyd:~/sage9.2$ g++ Alimerge.cpp o Alimerge Alimerge.cpp: In function ‘int main(int, char**)’: Alimerge.cpp:67:5: error: ‘sscanf_s’ was not declared in this scope sscanf_s(argv[1], "%d", &base); ^~~~~~~~ Alimerge.cpp:67:5: note: suggested alternative: ‘sscanf’ sscanf_s(argv[1], "%d", &base); ^~~~~~~~ sscanf garambois@floyd:~/sage9.2$ 
20210806, 20:03  #1297  
"Garambois JeanLuc"
Oct 2011
France
2^{4}×43 Posts 
Quote:
Now I'm just focusing on the data analysis. And this time, the task seems very difficult. My first visualizations of the data don't show anything that would allow me to formulate new conjectures for the moment : the "obvious" things must have been noticed last year ! However, as a priority, if you initialize new bases, calculate the maximum number of sequences that end trivially, because essentially, the data analysis will focus on whether the sequences belong to this or that branch of the infinite graph of aliquot sequences. And we only know this membership for sequences that end in cycles or primes. Of course, the nontrivial sequences that end are even more valuable, but they are so much rarer and harder to find, given the little time left until Monday... If you have additional computational resources, you can complete the calculations for some trivial sequences of bases 210, 14316, 14264, 14536 or other still unreserved bases. Otherwise, you can also advance the nontrivial sequences of these unreserved bases to for example 105 or 110 digits. With a little luck, you will finish one or other nontrivial sequence this way. But in any case, please report here any work you undertake : it would be too bad if several of you were to calculate the same sequence ! And don't forget to tell me about the new initialized bases, I will include them in the general scan on Monday, even if these sequences are not yet added to our project page. OK, excellent ! Don't forget to let me know if you've finished initializing this base by Monday, August 9 at 6:00 PM (GMT) ! 

20210806, 21:14  #1298  
Sep 2008
Kansas
D84_{16} Posts 
Quote:
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Broken aliquot sequences  fivemack  FactorDB  46  20210221 10:46 
Broken aliquot sequences  schickel  FactorDB  18  20130612 16:09 
A new theorem about aliquot sequences  garambois  Aliquot Sequences  34  20120610 21:53 
poaching aliquot sequences...  Andi47  FactorDB  21  20111229 21:11 
New article on aliquot sequences  schickel  mersennewiki  0  20081230 07:07 