ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime pp put Mp=2p−1M_p=2^p-1. For real numbers A<B<MpA<B<\sqrt{M_p} let ω(p;A,B)\omega(p;A,B) denote the number of prime divisors of MpM_p lying in the interval [A,B][A,B], and put

λ(p;A,B)={log⁡(log⁡B/log⁡A) if A≥2p,log⁡(log⁡B/log⁡2p) if A<2p.\lambda(p;A,B)=\begin{cases}\log(\log B/\log A)&\text{ if }A\geq 2p,\\[2pt]\log(\log B/\log 2p)&\text{ if }A<2p.\end{cases}

Then, as B/A→∞B/A\to\infty and Mp→∞M_p\to\infty, the quantity ω(p;A,B)\omega(p;A,B) is Poisson distributed with expected value λ(p;A,B)\lambda(p;A,B): for each fixed integer k≥0k\geq 0,

Pr⁡[ω(p;A,B)=k]⟶e−λ(p;A,B) λ(p;A,B)kk!.\Pr\bigl[\omega(p;A,B)=k\bigr]\longrightarrow e^{-\lambda(p;A,B)}\,\frac{\lambda(p;A,B)^{k}}{k!}.

In particular the following hold. The number of primes of the form Mp=2p−1M_p=2^p-1 that are less than xx is asymptotically

2log⁡log⁡xlog⁡2.\frac{2\log\log x}{\log 2}.

The expected number of primes MpM_p with x≤p≤2xx\leq p\leq 2x equals 22. The probability that MpM_p is prime is

2log⁡2pplog⁡2.\frac{2\log 2p}{p\log 2}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.