ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p1<p2<p3<⋯p_1 < p_2 < p_3 < \cdots denote the increasing sequence of all prime numbers, so that pkp_k and pk+1p_{k+1} are consecutive primes for every k≥1k \ge 1. For an even positive integer nn and a real number x≥2x \ge 2, put

πn(x)=#{ k≥1  :  pk≤x,  pk+1−pk=n }.\pi_n(x) = \#\{\, k \ge 1 \;:\; p_k \le x, \; p_{k+1} - p_k = n \,\}.

For every even positive integer nn there are infinitely many indices kk with pk+1−pk=np_{k+1} - p_k = n; equivalently, πn(x)→∞\pi_n(x) \to \infty as x→∞x \to \infty for every even n≥2n \ge 2. That is, for every even n≥2n \ge 2 there are infinitely many primes pp such that p+np + n is prime and no prime lies strictly between pp and p+np + n.

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.