Abstract
In this note, we show that the number of composite integers n ≤ x such that ϕ(n)|n − 1 is at most O(x 1/2(log log x)1/2), thus improving earlier results by Pomerance and by Shan.
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.
