In number theory, Jordan's totient function of a positive integer n is 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. The function is named after Camille Jordan.
Contents |
Jordan's totient function is multiplicative and may be evaluated as
which may be written in the language of Dirichlet convolutions as
and via Möbius inversion as
Since the Dirichlet generating function of μ is 1/ζ(s) and the Dirichlet generating function of nk is ζ(s-k), the series for Jk becomes
and by inspection of the definition (recognizing that each factor in the product over the primes is a cyclotomic polynomial of p-k), the arithmetic functions defined by or can also be shown to be integer-valued multiplicative functions.
The general linear group of matrices of order m over Zn has order[2]
The special linear group of matrices of order m over Zn has order
The symplectic group of matrices of order m over Zn has order
The first two formulas were discovered by Jordan.
|