Abstract
This note contains a new algorithm for computing a function $f(k)$ introduced by ErdÅs to measure the minimal gap size in the sequence of integers at least one of whose prime factors exceeds $k$. This algorithm enables us to show that $f(k)$ is not monotone, verifying a conjecture of Ecklund and Eggleton.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematics of Computation of the American Mathematical Society
Paper Title
Journal
Date
