Abstract
Let φ denote the Euler function. In this paper, we estimate the number of positive integers n ≤ x with the property that if a prime p > y divides φ(n), then p2 ∤ φ(n). We also give similar estimates for the Carmichael function λ.
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 callDisclaimer: 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.
