Gillies' conjecture

${\displaystyle {\text{If }}}$${\displaystyle A<B<{\sqrt {M_{p}}}{\text{, as }}B/A{\text{ and }}M_{p}\rightarrow \infty {\text{, the number of prime divisors of }}M}$

${\displaystyle {\text{ in the interval }}[A,B]{\text{ is Poisson-distributed with}}}$

${\displaystyle {\text{mean }}\sim {\begin{cases}\log(\log B/\log A)&{\text{ if }}A\geq 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 ${\displaystyle x}$ is ${\displaystyle ~{\frac {2}{\log 2}}\log \log x}$.
2. The expected number of Mersenne primes ${\displaystyle M_{p}}$ with ${\displaystyle x\leq p\leq 2x}$ is ${\displaystyle \sim 2}$.
3. The probability that ${\displaystyle M_{p}}$ is prime is ${\displaystyle ~{\frac {2\log 2p}{p\log 2}}}$.

The Lenstra–Pomerance–Wagstaff conjecture gives different values:[4][5]

1. The number of Mersenne primes less than ${\displaystyle x}$ is ${\displaystyle ~{\frac {e^{\gamma }}{\log 2}}\log \log x}$.
2. The expected number of Mersenne primes ${\displaystyle M_{p}}$ with ${\displaystyle x\leq p\leq 2x}$ is ${\displaystyle \sim e^{\gamma }}$.
3. The probability that ${\displaystyle M_{p}}$ is prime is ${\displaystyle ~{\frac {e^{\gamma }\log ap}{p\log 2}}}$ with a = 2 if p = 3 mod 4 and 6 otherwise.

Asymptotically these values are about 11% smaller.

While Gillie's conjecture remains open, several papers have added empirical support to its validity, including Ehrman's 1964 paper.[6]