Jordan's totient function
Jump to navigation
Jump to search
In number theory, Jordan's totient function of a positive integer n, named after Camille Jordan, is defined to be the number of k-tuples of positive integers all less than or equal to n that form a coprime (k + 1)-tuple together with n. This is a generalisation of Euler's totient function, which is J1.
Definition
Jordan's totient function is multiplicative and may be evaluated as
Properties
- .
- The average order of Jk(n) is c nk for some c.
References
- L. E. Dickson (1919, repr.1971). History of the Theory of Numbers I. Chelsea. ISBN 0-8284-0086-5.
- M. Ram Murty (2001). Problems in Analytic Number Theory. Springer-Verlag. ISBN 0387951431.