ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k∈Nk\in\mathbb{N}, let H(k)H(k) be the maximum of the Jacobsthal function over products of kk distinct primes:

H(k)=max⁡dP(n)=kj(n).H(k)=\max_{d_{\mathbb{P}}(n)=k}j(n).

Doubling-bound conjecture. For all k≥3k\ge 3,

H(k)<2⋅H(k−1).H(k)<2\cdot H(k-1).

The source notes that this is equivalent to Ω(k)≤2⋅Ω(k−1)+1\Omega(k)\le 2\cdot\Omega(k-1)+1, would simplify the calculation of H(k)H(k), and is supported by all data known there. Its validity would also imply H(k)<2kH(k)<2^k for k≥3k\ge3, although the weaker bound H(k)≤2kH(k)\le2^k was already proved by Kanold.

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.