ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(x)\mathbb{P}(x) be the set of prime numbers not exceeding xx, and let MP(n)(n)M_{\mathbb{P}(n)}(n) denote the corresponding prime-restricted maximum packing number. Prime-restricted maximum-packing conjecture.

MP(n)(n)∼16⋅n3ln⁡n.M_{\mathbb{P}(n)}(n)\sim \frac{1}{6}\cdot \frac{n^{3}}{\ln n}.

The source presents this as a prime-restricted problem closely related to the preceding conjecture; its lower bound follows from the proof of an earlier theorem, but the asymptotic equality is open.

Record

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.