clopen.solutions

A quadratic bound for Jacobsthal's function

Recorded by the registry's curators from GitHub; the authors did not submit it here.

OpenAI

Let $h(k)$ be the least integer such that every interval of $h(k)$ consecutive integers contains an integer coprime to any prescribed positive integer having at most $k$ distinct prime divisors. We prove $h(k)\ll k^2/(\log\log(3k))^2$, giving an affirmative answer to Jacobsthal's quadratic-bound question.

Claims

PARTIALLY RESOLVED OP-01136 — Jacobsthal's problem: covering an interval by one residue class per prime
Partial resolution · fidelity not yet established

Files and sources

Paper
math @ 4eaee87, build/main.tex ↗
Posted on GitHub
6 October 2026

No verification run is on record for this version.