Abstract
We denote, as usual, the number of integers not exceeding x having no prime factors greater than y by Ψ(x, y). We also writeThe function Ψ(x, y) is of great interest in number theory and has been studied by many researchers (see [3], [5] and [6] for example). The function Ψ(x, z, y) has also received some attention (see [2], [4–6]). In this paper we shall try to obtain a positive lower bound for Ψ(x, z, y) with y as small as possible when z is about x½ in magnitude. We note that the approach in [5] and [6] allows y to be much smaller than is permissible here, but requires x/z to be smaller than any power of x in [6] (unless some conjecture like the Riemann Hypothesis is assumed), or needs in [5]. The following result was obtained by Balog[1].
Sign-in/Register to access full text options 
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: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
