mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2014-03-16, 04:21   #1
wreck
 
wreck's Avatar
 
"Bo Chen"
Oct 2005
Wuhan,China

23×3×7 Posts
Default About Zhou's conjecture

This day, I search about the conjectures referenced to Mersenne prime.
And find a conjecture named "Zhou's speculate", it says,

When the prime p is between 2^(2^n) and 2^(2^(n+1), there are 2^(n+1)-1 Mersenne primes Mp.

I set the n to 0,1,2,3 and found this conjecture is true.
There are 21 Mersenne primes have been found larger than M_{2^(2^4)},
and this conjecture says there are 31 Mersenne primes between
M65536 and M4294967296.

I search this conjecture on wikipedia and mathworld.wolfram.com, but find no reference about it.

Has anbody heard about this conjecture before? or you just think this conjecture is negligible?
wreck is offline   Reply With Quote
Old 2014-03-16, 05:42   #2
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

22×17×139 Posts
Default

I pray to all my gods this to be false!
(and most probable it is false, just another case of Guy's "law of small numbers", those "3 cases" is like saying "3 is prime, 5 is prime, 7 is prime, so all odd numbers are prime"). Otherwise we have a lot of work to do here, for just 10 more primes....
LaurV is offline   Reply With Quote
Old 2014-03-16, 05:52   #3
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

3·5·17·37 Posts
Default

http://en.wikipedia.org/wiki/Wikiped...hou_conjecture
Batalov is offline   Reply With Quote
Old 2014-03-16, 06:14   #4
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

3·3,877 Posts
Default

Note that the conjecture is roughly in line with Wagstaff's heuristic, according to which each doubling of the p upper limit yields roughly 2 new M-primes, on average. The Wagstaff heuristic at least has some mathematically plausible reasoning behind it.

The "precise" number of primes predicted by Zhou is almost assuredly an example of Guy's SLoSN.
ewmayer is offline   Reply With Quote
Old 2014-03-16, 08:22   #5
wreck
 
wreck's Avatar
 
"Bo Chen"
Oct 2005
Wuhan,China

23×3×7 Posts
Default Some more informations

Here is some more informations, I translate this article's tilte into English.

Zhou Haizhong, "Distribution regularity of Mersenne prime", ACTA Scientiarum Naturalium Universitatis Sunyatseni, Vol.31, No.4, 1992

This article is rather old, it even does not have English abstract. There is a link to this article online,
http://www.cnki.com.cn/Article/CJFDT...Z199204018.htm
But unfortunately it is in Chinese and is on charge.
I read the review of this article, the author said he found the connection by "watching, analysis and research", but I only see "watching", it says,
There is 1 Mersenne number between M2 and M4 (M3);
There are 3 Mersenne numbers between M4 and M16 (M5,M7,M13);
There are 7 Mersenne numbers between M16 and M256 (M17,...);
...
This paper only have 2 pages. The second page is for charge.
Anyway, we could know whether it is true when n=4 after all the exponents below 4294967296 have been verified or there are more than 31 Mersenne primes between M65536 and M4294967296.

If this conjecture is true, I think it should be a beautiful theorem.
wreck is offline   Reply With Quote
Old 2014-03-16, 20:31   #6
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

3×3,877 Posts
Default

Quote:
Originally Posted by wreck View Post
If this conjecture is true, I think it should be a beautiful theorem.
Not without any actual mathematics behind it. All I see is a simple small-number curve fit turned into a wild "for all n" conjecture.
ewmayer is offline   Reply With Quote
Old 2014-03-17, 03:57   #7
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

598510 Posts
Default

Is the conjecture that there are at least 2^(n+1)-1 Mersenne primes in the associated range, or exactly that many? Either way it seems likely to be false, but the latter is much stronger.
CRGreathouse is offline   Reply With Quote
Old 2014-03-17, 11:53   #8
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22·5·373 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Is the conjecture that there are at least 2^(n+1)-1 Mersenne primes in the associated range, or exactly that many? Either way it seems likely to be false, but the latter is much stronger.
Someone by the name of Zhou has posted an endless series of such
"conjectures" on Victor Miller's number theory discussion/mailing list.

I do not know whether it is the same person.... But I know how I would
bet.
R.D. Silverman is offline   Reply With Quote
Old 2014-03-17, 17:31   #9
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
Someone by the name of Zhou has posted an endless series of such
"conjectures" on Victor Miller's number theory discussion/mailing list.

I do not know whether it is the same person.... But I know how I would
bet.
Apologies to everyone, including Zhou. I had him confused with
Zhi-Wei Sun.
R.D. Silverman is offline   Reply With Quote
Old 2014-05-04, 14:37   #10
Qubit
 
Qubit's Avatar
 
Jan 2014

2·19 Posts
Default

Maybe this "conjecture" was inspired by what Wikipedia calls the "Lenstra–Pomerance–Wagstaff conjecture", which states that the number of Mersenne primes in the exponent-interval (2^{2^n},2^{2^{n+1}}) is asymptotically e^\gamma\cdot 2^n.

According to Zhou there are 58 Mersenne primes below 2^{2^5}, and "according to" the second conjecture there are about 57 (The quotation marks are there because the second conjecture is asymptotic and claims nothing about 2^{2^5}.).
(Generally, it claims that asymptotically there are e^\gamma\cdot 2^n Mersenne primes for exponents below 2^{2^n}. Which means that the exponent-intervals (0, 2^{2^n}) and (2^{2^n},2^{2^{n+1}}) asymptotically hold the same amount of Mersenne primes.)

Anyway, I'm not a big fan of such conjectures. They seem like wishful observations, without too much meat behind them I suspect.
Qubit is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime conjecture Stan Math 39 2021-03-22 03:03
Goldbach Conjecture MattcAnderson MattcAnderson 3 2017-03-17 15:34
This conjecture may be useful. reddwarf2956 Prime Gap Searches 2 2016-03-01 22:41
Conjecture devarajkandadai Math 13 2012-05-27 07:38
A New Conjecture AntonVrba Math 19 2005-07-26 12:49

All times are UTC. The time now is 18:25.

Sun May 16 18:25:16 UTC 2021 up 38 days, 13:06, 0 users, load averages: 3.67, 3.31, 3.30

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.