arXiv · 1108.3710
Large strings of consecutive smooth integers
Abstract
In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erd\"os that measures the minimal gap size $f(k)$ in the sequence of integers at least one of whose prime factors exceeds $k$. This allows us to compute values of $f(k)$ for larger $k$ and obtain new values of $f(k)$.
Explore related subjects
Keep this discovery
Filip Najman. 2011-08-18. Large strings of consecutive smooth integers. https://arxiv.org/abs/1108.3710
Cite the original work for its findings. Save a collection to share your selection of sources.