ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n denote the nnth prime, and let h2(n)h_2(n) denote the primorial paired Jacobsthal function, defined as the smallest length of a paired progression containing a pair coprime to the product of the first nn primes. Upper-bound conjecture for the primorial paired Jacobsthal function. For every n∈Nn\in\mathbb{N} with n≥3n\geq 3,

h2(n)<pn2−pn.h_2(n)<p_n^2-p_n.

The paper presents this as one of three new conjectures and uses it as an assumption in conditional results concerning Goldbach representations and prime pairs; no resolution is supplied.

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.