ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥1k\ge1, let n∈{k+1,k+2}n\in\{k+1,k+2\}, let Dn−1\mathcal{D}_{n-1} be a set of n−1n-1 integers, and let πn(x,{0}∪Dn−1)\pi_n(x,\{0\}\cup\mathcal{D}_{n-1}) count positive integers m≤xm\le x for which all numbers indexed by {0}∪Dn−1\{0\}\cup\mathcal{D}_{n-1} are prime. Let S\mathfrak{S} denote the corresponding singular series. Define

En={o(1/(log⁡log⁡x)2),n=k+1,o(1),n=k+2.E_n=\begin{cases}o\bigl(1/(\log\log x)^2\bigr),&n=k+1,\\o(1),&n=k+2.\end{cases}

Stronger uniform Hardy–Littlewood conjecture. For n=k+1,k+2n=k+1,k+2, if S({0}∪Dn)≠0\mathfrak{S}(\{0\}\cup\mathcal{D}_n)\neq0, then, as x→∞x\to\infty,

πn(x,{0}∪Dn−1)=S({0}∪Dn−1)xlog⁡nx(1+En)\pi_n(x,\{0\}\cup\mathcal{D}_{n-1})=\mathfrak{S}(\{0\}\cup\mathcal{D}_{n-1})\frac{x}{\log^n x}(1+E_n)

uniformly for Dn⊂[2,log⁡k+1x]\mathcal{D}_n\subset[2,\log^{k+1}x]. This stronger estimate is introduced to prove the square-freeness theorem for the greatest common divisors of sufficiently large kk-tuple jumping champions. The supplied text gives no resolution status.

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.