ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n denote the nn-th prime, let π(x)\pi(x) be the prime-counting function, and for x∈Rx\in\mathbb{R} define

k(n,x)=n−π(n)+π(n)π(log⁡n)−x π(π(n)).k(n,x)=n-\pi(n)+\frac{\pi(n)}{\pi(\log n)}-x\,\pi(\pi(n)).

For x∈Rx\in\mathbb{R}, let Ψ(x)\Psi(x) be the minimum, when it exists, of the integers m≥8m\geq 8 such that

p1p2⋯pn>pn+1k(n,x)for all n≥m.p_1p_2\cdots p_n>p_{n+1}^{k(n,x)}\quad\text{for all }n\geq m.

Marques–Trojovský conjecture. The function Ψ(x)\Psi(x) satisfies: (i) Ψ(x)=21\Psi(x)=21 for all x∈[0.9,1.3]x\in[0.9,1.3]; (ii) Ψ(x)=149\Psi(x)=149 for all x∈[0.5,0.8]x\in[0.5,0.8]; (iii) Ψ(x)=59,875\Psi(x)=59{,}875 for all x∈[0.3,0.4]x\in[0.3,0.4]; (iv) Ψ(0.2)=442,414\Psi(0.2)=442{,}414; and (v) Ψ(0.1)=24,154,953\Psi(0.1)=24{,}154{,}953. These values refine the known piecewise-constant behavior of the threshold function and provide explicit numerical information about continuous Bonse-type inequalities; the source does not state whether the conjecture has been resolved.

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.