A quadratic bound for Jacobsthal's function
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/A-quadratic-bound-for-Jacobsthals-function
curl -X POST /api/v1/records/openai-math/A-quadratic-bound-for-Jacobsthals-function/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/A-quadratic-bound-for-Jacobsthals-function/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'