arXiv · 2606.19863
Consecutive integers free of certain prime factors
Abstract
Let $n_k$ denote the least integer $n>2k$ such that $(n-k)(n-k+1)\cdots(n-1)$ is not divisible by any prime in the interval $(k,2k)$. Confirming a conjecture of Erd\H{o}s, we prove that, for all sufficiently large $k$, $$ n_k > e^{\frac{\log^2 k}{20 \log \log k}}. $$
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Wouter van Doorn, Quanyu Tang. 2026-06-18. Consecutive integers free of certain prime factors. https://arxiv.org/abs/2606.19863
Cite the original work for its findings. Save a collection to share your selection of sources.