Year: 2011
Type: preprint
Abstract: In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erdös 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)$.
Source: arXiv (Cornell University)
Author: Najman, Filip
Institutions: Leiden University, University of Zagreb
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950193855