mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
Thread Tools
Old 2017-11-21, 06:20   #606
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,497 Posts
Default

1934442:i2194 (after reaching 100d and coming down) merges with 143676:i3
Batalov is offline   Reply With Quote
Old 2017-11-22, 18:11   #607
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

10011011112 Posts
Default

1952670 terminated at i1361.
yoyo is offline   Reply With Quote
Old 2017-11-23, 21:13   #608
ChristianB
 
Apr 2013
Germany

311 Posts
Default

The seq(s) 1974448 seem(s) to have merged with 1320480

1320480:1340 = 1974448:12

Which sequence do you delete in this case?

Last fiddled with by fivemack on 2017-11-23 at 22:13
ChristianB is offline   Reply With Quote
Old 2017-11-23, 23:14   #609
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3·29·83 Posts
Default

Always remove the larger sequence (1974448)

Last fiddled with by Dubslow on 2017-11-23 at 23:15
Dubslow is offline   Reply With Quote
Old 2017-11-24, 07:47   #610
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

23·11·73 Posts
Default

1868148 terminates
fivemack is offline   Reply With Quote
Old 2017-11-24, 12:08   #611
ChristianB
 
Apr 2013
Germany

31110 Posts
Default

The seq(s) 1741632 seem(s) to have merged with 1632

Dubslows code automatically deletes the larger seq when a merge is detected.

(1741632:3912 = 1632:37; I have an auto-reporter meaning that I don't necessarily notice merges as they happen)

Last fiddled with by fivemack on 2017-11-26 at 08:02
ChristianB is offline   Reply With Quote
Old 2017-11-25, 10:12   #612
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

25BF16 Posts
Default

That's the right way.
In my DB however, I keep both the "smallest" and the "longest" sequence that reach some composite. In case someone is looking for long sequences.

(my DB entries are [n, s, m, i, z, j, p1, a1, ...], where n is the number, s is its status, m is the smallest sequence reaching n at index i, z is the longest sequence reaching n at index j, and p^a are the factors, except the last (prime or unknown cofactor) - this way mergers are detected automatically, and the same composite is never factored two times)

Last fiddled with by LaurV on 2017-11-25 at 10:16
LaurV is offline   Reply With Quote
Old 2017-11-30, 18:45   #613
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

7·89 Posts
Default

1211160 terminated
yoyo is offline   Reply With Quote
Old 2017-12-01, 06:01   #614
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,497 Posts
Default

1938060 terminates @ i4415
Batalov is offline   Reply With Quote
Old 2017-12-03, 23:28   #615
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,497 Posts
Default

1431248 merges with 20196 @ ~ i2300
Batalov is offline   Reply With Quote
Old 2017-12-10, 18:15   #616
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

62310 Posts
Default

sequence 1052310 has terminated
yoyo is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 276 kar_bon Aliquot Sequences 127 2020-12-17 10:05
Primes in n-fibonacci sequence and n-step fibonacci sequence sweety439 And now for something completely different 17 2017-06-13 03:49
Figuring Out Sequence Merges Jayder Aliquot Sequences 13 2014-05-30 05:11
Novice Questions About Merges EdH Aliquot Sequences 4 2010-04-13 19:43
A New Sequence devarajkandadai Math 3 2007-03-20 19:43

All times are UTC. The time now is 09:56.


Fri Aug 6 09:56:38 UTC 2021 up 14 days, 4:25, 1 user, load averages: 4.40, 4.37, 4.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

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.