Mersenne-Like

davar55 · 2009-01-27, 20:14

Let rho(n) = number of prime factors of n counting multiplicities.

Then rho(mn) = rho(m)+rho(n) [trivial]
and rho(2^n-1) >= rho(n) [easy].

Besides the Mersenne series primes, for which rho(2^p-1) = rho(p) = 1,
what other n satisfy rho(2^n-1) = rho(n) ?

CRGreathouse · 2009-01-27, 20:59

So far, other than Mersenne exponents, only prime powers:
1, 4, 8, 9, 16, 27, 32, 49, ...

Kevin · 2009-01-28, 00:58

Doesn't work for higher terms. Fails for 11^2 and 13^2.

Though it appears that empirically this happens for Mersenne prime exponents and a subset of the powers of primes. Brute forcing in Maple, and so far nothing but Mersenne prime exponents and the powers of primes you listed, up to 256.

CRGreathouse · 2009-01-28, 01:55

Quote:

Originally Posted by Kevin

Doesn't work for higher terms. Fails for 11^2 and 13^2.

Sorry, I didn't mean that it worked for all prime powers, just that I haven't discovered any term that worked other than a prime power. I already found that it failed for those two, having tested up to 200 or 500 or something like that.

davar55 · 2009-02-05, 15:07

Sine 2^ab-1 is divisible by 2^a-1 and 2^b-1,
and since 2^p-1 has at least 2 factors if prime p is not Mersenne,
only n=p^m for p=Mersenne prime exponent (not just any prime)
need be considered. Also, only the smallest exponents m need
be considered, because if m fails so does m+1.

Thus in addition to the solutions given, the squares of the Mersenne
prime exponents (e.g. 19^2, 31^2, etc,) should be checked, and only
if one satisfies the criterion does then the cube need to be checked, etc.
This should speed up the search.

davar55 · 2009-07-02, 19:53

Isn't all the Gimps traffic fascinating?

A world-wide interaction of people and computers
all working to answer some very interesting mathematical questions.

So answer: are there an infinite number of Mersenne primes?

davar55 · 2011-01-23, 03:38

For the answer to that question, see the YJ-Conjecture in Conjectures R Us
and the Wagstaff Conjecture in Math.

The answer is: yes, there are, and it either is or will be proven soon.

2009-01-27, 20:14	#1
davar55 May 2004 New York City 5×7×11² Posts	Mersenne-Like Let rho(n) = number of prime factors of n counting multiplicities. Then rho(mn) = rho(m)+rho(n) [trivial] and rho(2^n-1) >= rho(n) [easy]. Besides the Mersenne series primes, for which rho(2^p-1) = rho(p) = 1, what other n satisfy rho(2^n-1) = rho(n) ?

2009-01-28, 00:58	#3
Kevin Aug 2002 Ann Arbor, MI 433 Posts	Doesn't work for higher terms. Fails for 11^2 and 13^2. Though it appears that empirically this happens for Mersenne prime exponents and a subset of the powers of primes. Brute forcing in Maple, and so far nothing but Mersenne prime exponents and the powers of primes you listed, up to 256. Last fiddled with by Kevin on 2009-01-28 at 01:46

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Small inconsistencies between mersenne.org and mersenne.ca factor databases	GP2	mersenne.ca	44	2016-06-19 19:29
mersenne.ca (ex mersenne-aries.sili.net)	LaurV	mersenne.ca	8	2013-11-25 21:01
Gaussian-Mersenne & Eisenstein-Mersenne primes	siegert81	Math	2	2011-09-19 17:36
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods	optim	PrimeNet	13	2004-07-09 13:51

2009-01-27, 20:59	#2
CRGreathouse Aug 2006 3·1,993 Posts	So far, other than Mersenne exponents, only prime powers: 1, 4, 8, 9, 16, 27, 32, 49, ...

2009-02-05, 15:07	#5
davar55 May 2004 New York City 5×7×11² Posts	Sine 2^ab-1 is divisible by 2^a-1 and 2^b-1, and since 2^p-1 has at least 2 factors if prime p is not Mersenne, only n=p^m for p=Mersenne prime exponent (not just any prime) need be considered. Also, only the smallest exponents m need be considered, because if m fails so does m+1. Thus in addition to the solutions given, the squares of the Mersenne prime exponents (e.g. 19^2, 31^2, etc,) should be checked, and only if one satisfies the criterion does then the cube need to be checked, etc. This should speed up the search.

2009-07-02, 19:53	#6
davar55 May 2004 New York City 1000010001011₂ Posts	Isn't all the Gimps traffic fascinating? A world-wide interaction of people and computers all working to answer some very interesting mathematical questions. So answer: are there an infinite number of Mersenne primes?

2011-01-23, 03:38	#7
davar55 May 2004 New York City 5·7·11² Posts	For the answer to that question, see the YJ-Conjecture in Conjectures R Us and the Wagstaff Conjecture in Math. The answer is: yes, there are, and it either is or will be proven soon.