Abstract
SummaryWe introduce a generalization of Euler's totient function that, when applied to an integer n ≥ 2, can be written as a polynomial in the prime factors of n. We then show how cyclotomic and complete homogeneous symmetric polynomials appear as factors of these polynomials when n has at most two distinct prime divisors.
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.
