Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

Prime factors of consecutive integers


Authors: Mark Bauer and Michael A. Bennett
Journal: Math. Comp. 77 (2008), 2455-2459
MSC (2000): Primary 11N25; Secondary 11D09
DOI: https://doi.org/10.1090/S0025-5718-08-02134-0
Published electronically: May 20, 2008
MathSciNet review: 2429894
Full-text PDF

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11N25, 11D09

Retrieve articles in all journals with MSC (2000): 11N25, 11D09


Additional Information

Mark Bauer
Affiliation: Department of Mathematics, University of Calgary, Calgary AB
Email: mbauer@math.ucalgary.ca

Michael A. Bennett
Affiliation: Department of Mathematics, University of British Columbia, Vancouver BC
Email: bennett@math.ubc.ca

DOI: https://doi.org/10.1090/S0025-5718-08-02134-0
Received by editor(s): March 14, 2007
Published electronically: May 20, 2008
Additional Notes: The authors were supported in part by grants from NSERC
Article copyright: © Copyright 2008 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society