ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n∈Nn\in\mathbb{N}, the Jacobsthal function is

j(n)=min⁡{m∈N∣∀a∈Z ∃x∈{1,…,m}:a+x is coprime to n}.j(n)=\min\{m\in\mathbb{N}\mid\forall a\in\mathbb{Z}\ \exists x\in\{1,\dots,m\}:a+x\text{ is coprime to }n\}.

For k∈Nk\in\mathbb{N}, let h(k)=j(pk#)h(k)=j(p_k\#) be its value at the product of the first kk primes, and let H(k)H(k) be the maximum of j(n)j(n) over products of kk distinct primes:

H(k)=max⁡dP(n)=kj(n)=max⁡πi∈Pπ1<⋯<πkj(∏i=1kπi).H(k)=\max_{d_{\mathbb{P}}(n)=k}j(n)=\max_{\substack{\pi_i\in\mathbb{P}\\ \pi_1<\dots<\pi_k}}j\left(\prod_{i=1}^k\pi_i\right).

Jacobsthal's conjecture. For all k∈Nk\in\mathbb{N},

H(k)=h(k).H(k)=h(k).

Jacobsthal proposed this equality based on the agreement of the two functions for all then-known small values. The conjecture has subsequently been disproved, so the statement is refuted.

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.