![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png){kind=logo}
Abstract
The author sharpens a result of Baker and Harman (2009), showing that for sufficiently large $x$, the interval $[x, x+x^{\frac{1}{2}}]$ contains an integer with a prime factor larger than $x^{0.7437}$. Optimized bounds for multiple exponential sums and accurate numerical calculations are used for this improvement.
Supplementary materials
Title
Mathematica code for numerical calculations
Description
This is the Mathematica code for the numerical calculations in the preprint.
Actions
Title
Mathematica package SieveFunctions
Description
This is Galway's Mathematica package that gives values of functions FF(s) and ff(s) in our code.
Actions
