mersenneforum.org Starter # - Perfect Number Minus 2
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2014-04-24, 04:06 #1 pdazzl   Apr 2014 11101112 Posts Starter # - Perfect Number Minus 2 I'm new to Aliquot sequences, I noticed that a lot of the starter numbers being researched are small. Is there a record for the largest started number brought to completion? I noticed numbers of the perfect number minus two (for true perfect and non mersenne prime formed "perfect form" numbers) seemed to complete rather easily and on rather big numbers.....are there other forms that complete easily? The largest number of this batch is 43 digits long: Other perfect numbers minus 2 (or of that form with a non mersenne prime) (2^3-1)*(2^3)/2-2 (5 cycles end in prime 3) (2^5-1)*(2^5)/2-2 (5 cycles end in prime 37) (2^7-1)*(2^7)/2-2 (11 cycles end in prime 43) (2^11-1)*(2^11)/2-2 (108 cycles end in prime 7) (2^13-1)*(2^13)/2-2 (94 cycles end in prime 43) (2^19-1)*(2^19)/2-2 (139 cycles end in prime 59) (2^23-1)*(2^23)/2-2 (498 cycles end in prime 601) (2^31-1)*(2^31)/2-2 (166 cycles end in prime 41) (2^37-1)*(2^37)/2-2 (213 cycles end in 2924/2620) (2^43-1)*(2^43)/2-2 (157 cycles end in prime 13) 43 digits (2^71-1)*(2^71)/2-2 (285 cycles end in prime 59)
 2014-04-24, 06:02 #2 VBCurtis     "Curtis" Feb 2005 Riverside, CA 10100001000002 Posts Whatever terminated sequence that contains the largest term somewhere in the sequence would also be the record for largest starting number, since you could choose to "start" a 'new' sequence at that largest term.
 2014-04-24, 10:12 #3 pdazzl   Apr 2014 7×17 Posts Ah that's true, thanks. I guess anything record wise worth noting may be longest known completed sequence iteration chains.
2014-04-24, 10:29   #4
LaurV
Romulan Interpreter

"name field"
Jun 2011
Thailand

9,859 Posts

Quote:
 Originally Posted by VBCurtis Whatever terminated sequence that contains the largest term somewhere in the sequence would also be the record for largest starting number, since you could choose to "start" a 'new' sequence at that largest term.
The largest sequence that is known to terminate starts with M48.
[edit: or if you want only non-primes, it starts with M48+1]

Last fiddled with by LaurV on 2014-04-24 at 10:31

 2014-04-24, 15:42 #5 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3·7·461 Posts Why not that pesky little sequence that starts with M48*(M48+1)/2 ?
 2014-04-24, 16:57 #6 pdazzl   Apr 2014 7×17 Posts Yes, well spotted. It looks like perfect numbers times 2 decompose quite nicely...was able to get as high as (2^127)*(2^127-1) before the composites got out of control. (2^127)*(2^127-1) total of 77 digits Decomposes in 17 iterations to this prime: 49039222283371595885559854029
 2014-04-24, 17:54 #7 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3×7×461 Posts No, my point was that any sequence that starts with a perfect number is terminated by definition. For your above example that would be (2^126)*(2^127-1). And if I put my Capt.Obvious hat, the P48 is the largest perfect number we know at this time. It is probably possible to backtrack a few specific cases that would land on P48 or on M48 or on M48+1 (and M48 in the next iteration). But we are too lazy.
2014-04-24, 18:17   #8
LaurV
Romulan Interpreter

"name field"
Jun 2011
Thailand

232038 Posts

Quote:
 Originally Posted by Batalov Why not that pesky little sequence that starts with M48*(M48+1)/2 ?
Didn't cross my mind, hahaha. In spite of the fact that I had the coffee already at the time of posting...

2014-04-24, 20:29   #9
pdazzl

Apr 2014

7×17 Posts

Yes, understood your point. I was wondering if there was any way to get anything larger (ie: 2xLargestPerfectNumber) which you eluded to by backtracking.

Interestingly, it appears that all 2xPerfectNumbers follow the same pattern in the first couple of iterations:

0 - (2^p)*(2^p-1)
1 - 2^(2*p)
2 - (2^p-1)*(2^p+1) or 4^p-1

Iteration #3 and later on #2 leaves you with ever larger composites as the perfect number gets bigger.

Quote:
 Originally Posted by Batalov No, my point was that any sequence that starts with a perfect number is terminated by definition. For your above example that would be (2^126)*(2^127-1). And if I put my Capt.Obvious hat, the P48 is the largest perfect number we know at this time. It is probably possible to backtrack a few specific cases that would land on P48 or on M48 or on M48+1 (and M48 in the next iteration). But we are too lazy.

 2014-04-24, 21:41 #10 pdazzl   Apr 2014 1678 Posts URL's for reference: (2^2)*(2^2-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^3)*(2^3-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^5)*(2^5-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^7)*(2^7-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^13)*(2^13-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^17)*(2^17-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^19)*(2^19-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^31)*(2^31-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^61)*(2^61-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^89)*(2^89-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^107)*(2^107-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 (2^127)*(2^127-1) http://factordb.com/sequences.php?se...20&fr=0&to=100 Composites too huge at this point: (2^521)*(2^521-1) http://factordb.com/sequences.php?se...20&fr=0&to=100
 2014-04-25, 02:43 #11 pdazzl   Apr 2014 7×17 Posts @Batalov Actually unless I'm mistaken, I believe this sequence has a higher starting number. 0 - (M48)^2 1 - 2^57885161 2 - M48

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Godzilla Miscellaneous Math 8 2016-09-05 05:56 a1call Miscellaneous Math 179 2015-11-12 14:59 fivemack Aliquot Sequences 0 2014-12-23 09:47 isaac Miscellaneous Math 5 2014-07-22 22:18 jasong Factoring 1 2006-05-14 11:28

All times are UTC. The time now is 04:59.

Mon Jan 17 04:59:32 UTC 2022 up 177 days, 23:28, 0 users, load averages: 0.61, 0.89, 0.93

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔