ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N\mathbb{N} denote the natural numbers and P\mathbb{P} the primes. For each n∈Nn\in\mathbb{N} with n≥6n\geq 6, let knk_n be the index of the uniquely determined prime pkn∈Pp_{k_n}\in\mathbb{P} satisfying

pkn2+pkn≤2⋅n<pkn+12+pkn+1.p_{k_n}^2+p_{k_n}\leq 2\cdot n<p_{k_n+1}^2+p_{k_n+1}.

Tightened Goldbach conjecture. For all n≥6n\geq 6, there exist primes q1,q2∈Pq_1,q_2\in\mathbb{P} such that

pkn<q1<pkn2,q1+q2=2⋅n.p_{k_n}<q_1<p_{k_n}^2,\qquad q_1+q_2=2\cdot n.

The source reports verification for all nn with 12≤2⋅n≤10812\leq 2\cdot n\leq 10^8, but gives no proof for the remaining cases.

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.