20161125, 20:55  #12  
Nov 2011
233 Posts 
Quote:
The most flexible way of course is to share the source code. However if you want to keep it with you then providing a library can be a good solution. In that case I will need a function which takes long long n as an input and returns the sum of divisors of n as an output. I also use a modified version of that function which stops working as soon as it becomes clear that s(n) > 2*n, and return n+1 in this case. This function is used to speed up the process when we need s(n)  n to be at most n. I guess these functions should not be a big deal as soon as you have a factorisation routine. 

20161126, 16:32  #13  
Jun 2015
Stockholm, Sweden
83 Posts 
Quote:
Update: the code at my github is actually very old, it doesn't even use PollardBrent. I'll publish my latest code somewhat later today. Update 2: I've attached my latest factorization code with compiled EXE for benchmarking. Last fiddled with by Sergei Chernykh on 20161126 at 17:21 

20161126, 17:00  #14 
Apr 2010
Over the rainbow
2^{4}×3×7^{2} Posts 
Hi Drdmitry.
I'm wondering how often should I find cycle in the range I have choosen (100k, 100k+150). Because so far, with about 1/6 of the work done, I have only found 1 2lenght cycle. ( Windows 10, 64 bit). 
20161126, 22:55  #15 
Nov 2011
351_{8} Posts 
Your numbers sound fine to me. I just checked the amicable pairs: there is only one pair within the range 100000  100150 (it is for 1000042, am I right?) Then next pair goes for n = 1000184.

20161128, 16:16  #16 
Apr 2010
Over the rainbow
100100110000_{2} Posts 
interesting
819501511565312= 2^13*139*2339*307691 831903237028288=2^6*4751*6733*406349 (found this pair @ 100036) I have another pair found at 100024 but none at 100042 
20161128, 17:28  #17 
(loop (#_fork))
Feb 2006
Cambridge, England
18CE_{16} Posts 
20M .. 20M+5k completed, it took about 60 hours on 1 core 2.6GHz Ivy Bridge and found 0 cycles
Trying (1M + 1) .. (1M + 200) Last fiddled with by fivemack on 20161128 at 17:31 
20161128, 17:33  #18 
(loop (#_fork))
Feb 2006
Cambridge, England
2·5^{2}·127 Posts 
I am slightly confused, the range is 10^5 .. 10^5+150 and you are talking about 10^6+42 and 10^6+184. It's good to know that I should get at least two hits in my range :)
Last fiddled with by fivemack on 20161128 at 17:33 
20161128, 19:13  #19 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2×3^{3}×5×17 Posts 
One question.
1) Have doubts with regards to how to use the flags on the client. Imagine I want to run the nrange 15001600. Is the following correct? Code:
start /low /min aliquot_even_10e15.exe 1500 1600 Last fiddled with by pinhodecarlos on 20161128 at 19:14 
20161129, 00:13  #20 
Nov 2011
233 Posts 
Ups, I looked at the range starting from 10e6, For 10e5 the first pair comes for 100024 and the second one comes at 100036.
Last fiddled with by Drdmitry on 20161129 at 00:20 
20161129, 00:16  #21  
Nov 2011
351_{8} Posts 
Quote:


20161202, 15:45  #22 
(loop (#_fork))
Feb 2006
Cambridge, England
6350_{10} Posts 
(1M+1)..(1M+200) done
Code:
New cycle found!! 884037842133212 895944731690788 New cycle found!! 136025029735528 136243747173272 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Aliquot cycles search, the state of the art.  Drdmitry  Aliquot Sequences  124  20170702 02:48 
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 