20150523, 14:29  #1 
Nov 2011
233 Posts 
Aliquot cycles search, the state of the art.
Here I collect all the information about the exhaustive search of small Aliquot cycles I know of.
Amicable pairs. All pairs below 1e17 are known. Sergei Chernykh is currently running an exhaustive search of all 17digit pairs. The range after 1e17 is relatively untouched. The most extensive list of all pairs can be found here: http://sech.me/ap/ Sociable numbers. We consider cycles of odd and even numbers separately. It is more efficient to look for odd cycles by their smallest elements because such Aliquot sequences tend to decrease. Even cycles are usually searched by the number preceding the largest number of the cycle. Odd cycles: All cycles below 1e15 are known. The search of all cycles between 1e15 and 1e16 is carried out by this forum here. Only cycles of a form given by Borho are known for higher numbers. Even cycles: All cycles below 5e12 are known for sure. It seems to me that Andre Needham completed the search for the range up to 1e13, but I am not 100% sure. Ed Hall started the search of all cycles of length at most four. Later he extended the length to ten. Currently he reached 5e13 (probably a bit more at the moment) for the cycles of length four. Only cycles of a form given by Borho are known for higher numbers. Potentially there may be a couple of longer cycles between 5e12 and 5e13. Theoretically there may be cycles containing both even and odd numbers. In this case they must contain a number of a form . A couple of years ago I searched for cycles containing a number of this form. Nothing was found up to 1e14. If there is an interest in doing a collective project to extend one of the ranges above then I can try to adopt my programs for it over summer vacations. Last fiddled with by Drdmitry on 20160301 at 11:16 Reason: Updating 
20150523, 16:47  #2 
Apr 2010
Over the rainbow
2^{4}×3×7^{2} Posts 
you mightwantto check http://mersenneforum.org/showthread.php?t=19372
edit : Ignore theling, Ididn't see you were already a part of this thread. edit 2,: maybe this one ? http://mersenneforum.org/showthread.php?t=13291 Last fiddled with by firejuggler on 20150523 at 16:54 
20150523, 17:38  #3  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Quote:
Last fiddled with by science_man_88 on 20150523 at 17:39 

20150523, 17:58  #4  
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
Quote:


20150610, 12:00  #5  
Mar 2015
Australia
2×41 Posts 
Quote:
through them, but for the 15 digits so far only <5% are new. I'll be doing more now with 16 digits and some of the breeding methods which look promising! Andrew 

20150611, 10:23  #6  
Nov 2011
233 Posts 
Quote:
As far as I understand, your methods are specific for finding amicable pairs and can not be used for longer cycles? Currently I am interesting in cycles of length bigger than two. My programs are not fast enough to search over all even 15 digits numbers or all odd 16 digits numbers on one computer in a reasonable time. However it can be done with help of a hundred cores. 

20150614, 14:47  #7  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2·2,837 Posts 
Quote:


20150615, 12:33  #8  
Mar 2015
Australia
2·41 Posts 
Quote:
would miss a lot of larger cycles. Wouldn't we all like to have a hundred cores to play with! Andrew 

20150615, 16:18  #9  
Nov 2011
233 Posts 
Quote:
Unfortunately the code is 64 bit Windows specific. However the only specific part is a fast 64 bit multiplication modulo a 64 bit number. Hopefully it is not too difficult to rewrite it on any other 64 bit system. 

20150630, 08:22  #10 
Mar 2015
Australia
122_{8} Posts 
All of my Walker&Einstein results from above have been processed by Pat and are in his lists. There were over 40 thousand submitted,
the number of new pairs are 15 digits 656 pairs 16 digits 18018 pairs I'm mainly interested in finding new type n1 or Xn1 pairs, the two new ones were X31 Walker&Einstein 2015 1691429789009025=3^5*5^2*13*71*401*709*1061 1756294497513855=3^5*5*13*71*1566099539 X41 Walker&Einstein 2015 5804063919860661=3^2*7^2*13*19*29*47*89*101*4349 6126766409739339=3^2*7*13^3*19*29*80335799 I'm also hoping to find new pairs where the smallest prime factor is bigger than 3. Can you please add above I'm looking at even 16 digits with the largest factor from 10k to 100k in the first number, this won't find everything and will take several months! Andrew Last fiddled with by AndrewWalker on 20150630 at 08:23 
20150630, 09:36  #11  
Nov 2011
351_{8} Posts 
Quote:
Some time ago I did the search of all 16d Aliquot cycles with the smallest factor bigger than 3. There is only one such cycle already found by you. I did not check bigger numbers though. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Search of all even15digit Aliquot cycles  Drdmitry  Aliquot Sequences  25  20161216 15:26 
Program for searching all odd16digit Aliquot cycles  Drdmitry  Aliquot Sequences  302  20160511 02:17 
Is a search for aliquot 3cycles feasible?  schickel  Aliquot Sequences  7  20130208 01:33 
Small search of cycles with odd and even elements  Drdmitry  Aliquot Sequences  0  20111214 13:50 
Jan Munch Pedersen's Tables of Aliquot Cycles  R. Gerbicz  Math  0  20100701 12:30 