Gillies' conjecture

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Lua error in package.lua at line 80: module 'strict' not found.

In number theory, Gillies' conjecture is a conjecture about the distribution of prime divisors of Mersenne numbers and was made by Donald B. Gillies in a 1964 paper[1] in which he also announced the discovery of three new Mersenne primes. The conjecture is a specialization of the prime number theorem and is a refinement of conjectures due to I. J. Good[2] and Daniel Shanks.[3] The conjecture remains an open problem, although several papers have added empirical support to its validity.

The conjecture

\text{If }A < B < \sqrt{M_p}\text{, as }B/A\text{ and }M_p \rightarrow \infty\text{, the number of prime divisors of }M
\text{ in the interval }[A, B]\text{ is Poisson-distributed with}

\text{mean }\sim
\begin{cases}
\log(\log B /\log A) & \text{ if }A \ge 2p\\
\log(\log B/\log 2p) & \text{ if } A < 2p
\end{cases}

He noted that his conjecture would imply that

  1. The number of Mersenne primes less than x is ~\frac{2}{\log 2} \log\log x.
  2. The expected number of Mersenne primes M_p with x \le p \le 2x is \sim2.
  3. The probability that M_p is prime is ~\frac{2 \log 2p }{p\log 2}.

Known results

While Gillie's conjecture remains an open problem, several papers have added empirical support to its validity, including Ehrman's 1964 paper[4] as well as Wagstaff's 1983 paper.[5]

Notes

  1. Lua error in package.lua at line 80: module 'strict' not found.
  2. Lua error in package.lua at line 80: module 'strict' not found.
  3. Lua error in package.lua at line 80: module 'strict' not found.
  4. Lua error in package.lua at line 80: module 'strict' not found.
  5. Lua error in package.lua at line 80: module 'strict' not found.


<templatestyles src="Asbox/styles.css"></templatestyles>