Jordan's totient function
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.
Definition
Jordan's totient function is multiplicative and may be evaluated as
Properties
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
- .
- The average order of Jk(n) is c nk for some c.
- The Dedekind psi function is
- ,
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.
Order of matrix groups
The general linear group of matrices of order m over Zn has order[1]
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.
References
- L. E. Dickson (1919, repr.1971). History of the Theory of Numbers I. Chelsea. p. 147. ISBN 0-8284-0086-5.
{{cite book}}
: Check date values in:|year=
(help)CS1 maint: year (link) - M. Ram Murty (2001). Problems in Analytic Number Theory. Graduate Texts in Mathematics. Vol. 206. Springer-Verlag. p. 11. ISBN 0-387-95143-1.
External links
- Dorin Andrica and Mihai Piticari On some Extensions of Jordan's arithmetical Functions
- ^ All of these formulas are from Andrici and Priticari in #external links