Abstract

ABSTRACT Let d(n) denotes the number of positive integers dividing the positive integer n, and let φ(n) denotes Euler’s function representing the number of numbers less than and prime to n. In this paper, we present some notes on the equation d(n) = d(φ(n)). Several results on the related inequalities are also obtained.

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 call

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.