20220614, 18:39  #1651  
"Ed Hall"
Dec 2009
Adirondack Mtns
4700_{10} Posts 
Quote:
1) The list was limited to the primes found within the base 2 sequences. This will be expanded later, but I will need to find a way to avoid total duplication of finds. 2) This test is running everything greater than 9 digits. 3) Currently, I'm using all bases through 200, except for the recently added. I haven't run a full update in a while, due to the db limitations. 4) It's a mixture, but mostly bash scripts, with one C++ program that harvests the primes. ATM, I am becoming totally confused! I'm going to take a break until I sort out what I'm doing. 

20220614, 20:03  #1652 
"Garambois JeanLuc"
Oct 2011
France
1636_{8} Posts 
OK, thanks Edwin for those answers.
In any case, all the sample data seems to match except for one. I can't find the prime number 2159188693 at index 18 of sequence 2^327. Let us know if you do more tests in the next time and if you find other "big" prime numbers that are present in several bases. I will look into this. We never know, we have to check, even if I think that all this is only a coincidence and that we will not have much larger primes being in two different bases. It would surprise me a lot if there were such prime numbers of 12 digits or more ! As far as I'm concerned, I have one fear : I write my programs in python and I'm afraid it's infinitely slower than what you write in C. We'll see in July, because I unfortunately don't have enough time at the moment ! 
20220615, 00:39  #1653  
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}×5^{2}×47 Posts 
Quote:
As for the programming, the C++ program is a very small part and most of the time is spent in the scripts. I hope to do a lot of work refining how the data are collected. I'll also need to do another full update of all my local sequences. I did add all the new bases below 200, so when I resume work, they will be represented. Latest run: Code:
1051654267,19,22,2102 1051654267,2,468,58 1097038783,2,501,61 1097038783,67,83,11 1129552253,19,18,510 1129552253,2,341,25 1639132051,22,41,508 1639132051,2,422,11 2159188693,2,372,18 2159188693,50,98,7 3206363219,2,448,19 3206363219,2,516,53 3206363219,59,36,1559 3258313481,2,305,11 3258313481,24,17,1520 

20220615, 07:55  #1654  
"Garambois JeanLuc"
Oct 2011
France
2×463 Posts 
Quote:
The format is perfect like this. I can still spot an error : the prime number 3206363219 doesn't seem to appear anywhere in the sequence 2^448. I immediately checked this prime, because it appears in three lines of the list and 516 is not a multiple of 448 and anyway, the indexes are > 1. So it was very intriguing and very unlikely that this prime would appear in 3 lines. Edwin, you are already doing a lot for this whole project ! Only take on this extra work if you find interest in it ! And in any case, take your time, I won't get serious about this until after July 7  10 anyway. But I must admit that you have discovered a very interesting path to explore in my humble opinion. It's risky to go into this alone, there are many sources of error. It is very stimulating to work on such an idea with several people and especially, so, we have means to verify. Thanks Edwin ! 

20220615, 12:50  #1655  
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}·5^{2}·47 Posts 
Quote:
Code:
base2/2^448.elf:19 . 15006007375820463402452561600162328700320636321975920107434993415977015910414828098588984394591 = 17 * 2389 * 2016739 * 141986827 * 190519331 * 6772722565336945433810924560372709070485550949679612135489377339249 

20220615, 13:12  #1656 
"Garambois JeanLuc"
Oct 2011
France
2·463 Posts 
OK, I understand the problem much better with this example, thanks.

20220615, 15:52  #1657 
Sep 2009
2^{6}·37 Posts 
My first cut would be:
Put all primes into a flat file, called primes.txt below. sort <primes.txt  uniq repeated >primes.duplicates That should get a list of all primes that appear more than once in the list. Then see how many there are and decide how to process them. 
20220615, 17:02  #1658 
"Ed Hall"
Dec 2009
Adirondack Mtns
11134_{8} Posts 
Thanks Chris! I will add this into my study.

20220615, 18:50  #1659 
"Garambois JeanLuc"
Oct 2011
France
1110011110_{2} Posts 
Yes, many thanks Chris.
I think you are right and the program will be more effective this way. Perhaps even incomparably more effective ! 
20220615, 19:29  #1660 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}×5^{2}×47 Posts 
@Chris: uniq is definitely helping!
Another wrinkle has made itself known, that I will have to look into: If you check prime 989948318349327032515056706609970813346117930160196095662320313189860502565627388119428970284861410132787555691, you will find six occurrences across as many sequences: Code:
3^10:3460 5^26:3674 24^57:5346 47^97:3551 70^3:3478 85^2:3467 Code:
2^4 7 31 107 1747 32869 151597 28936680745039 
20220615, 20:25  #1661 
"Garambois JeanLuc"
Oct 2011
France
39E_{16} Posts 
Wow, wow, wow !
It's going to be a lot more complicated than I thought if we have to remove the multiple cases due to mergers. I hadn't thought of that. For the moment, as far as I am concerned, I do not see how to deal with this problem ! 
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 