mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2020-07-11, 20:33   #364
EdH
 
EdH's Avatar
 
"Ed Hall"
Dec 2009
Adirondack Mtns

2·3·72·11 Posts
Default

Quote:
Originally Posted by Happy5214 View Post
Not conjecture, theorem. If p = ab (a, b > 1), then 2^a-1 and 2^b-1 both divide 2^p-1. Ergo, any number that divides 2^n-1 will also divide 2^(ni)-1, for any i ≥ 1. That's why exponents for Mersenne primes must themselves also be prime.
Does this apparent observation fit in with a similar theorem?

For all ai (a, i positive integers ≥ 1)
s(ai) is a factor of s(a(i*n)) (for all positive n)

Example:
Code:
s(73) = 3 · 19
s(7(3*2)) = 2^3 · 3 · 19 · 43
s(7(3*3)) = 3^2 · 19 · 37 · 1063
. . .
s(7(3*33)) = 3^2 · 19 · 37 · 199 · 1063 · 1123 · 3631 · 173647 · 293459 · 1532917 · 12323587 · P44
. . .
Note also from the above:
Code:
s(7(3*3)) = 3^2 · 19 · 37 · 1063
. . .
s(7(3*33)) = 3^2 · 19 · 37 · 199 · 1063 · 1123 · 3631 · 173647 · 293459 · 1532917 · 12323587 · P44
Edit: Further study seems to suggest the above is only true for odd a. Additionally, that ai+1 is a factor of s(a(i*n)) (n, a positive even integer)

Last fiddled with by EdH on 2020-07-11 at 22:42
EdH is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Broken aliquot sequences fivemack FactorDB 45 2020-05-16 15:22
Broken aliquot sequences schickel FactorDB 18 2013-06-12 16:09
A new theorem about aliquot sequences garambois Aliquot Sequences 34 2012-06-10 21:53
poaching aliquot sequences... Andi47 FactorDB 21 2011-12-29 21:11
New article on aliquot sequences schickel mersennewiki 0 2008-12-30 07:07

All times are UTC. The time now is 01:15.

Sun Jul 12 01:15:49 UTC 2020 up 108 days, 22:48, 0 users, load averages: 1.13, 1.11, 1.09

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