# Jordan's totient function

In number theory, Jordan's totient function, denoted as ${\displaystyle J_{k}(n)}$, where ${\displaystyle k}$ is a positive integer, is a function of a positive integer, ${\displaystyle n}$, that equals the number of ${\displaystyle k}$-tuples of positive integers that are less than or equal to ${\displaystyle n}$ and that together with ${\displaystyle n}$ form a coprime set of ${\displaystyle k+1}$ integers

Jordan's totient function is a generalization of Euler's totient function, which is the same as ${\displaystyle J_{1}(n)}$. The function is named after Camille Jordan.

## Definition

For each positive integer ${\displaystyle k}$, Jordan's totient function ${\displaystyle J_{k}}$ is multiplicative and may be evaluated as

${\displaystyle J_{k}(n)=n^{k}\prod _{p|n}\left(1-{\frac {1}{p^{k}}}\right)\,}$, where ${\displaystyle p}$ ranges through the prime divisors of ${\displaystyle n}$.

## Properties

• ${\displaystyle \sum _{d|n}J_{k}(d)=n^{k}.\,}$
which may be written in the language of Dirichlet convolutions as[1]
${\displaystyle J_{k}(n)\star 1=n^{k}\,}$
and via Möbius inversion as
${\displaystyle J_{k}(n)=\mu (n)\star n^{k}}$.
Since the Dirichlet generating function of ${\displaystyle \mu }$ is ${\displaystyle 1/\zeta (s)}$ and the Dirichlet generating function of ${\displaystyle n^{k}}$ is ${\displaystyle \zeta (s-k)}$, the series for ${\displaystyle J_{k}}$ becomes
${\displaystyle \sum _{n\geq 1}{\frac {J_{k}(n)}{n^{s}}}={\frac {\zeta (s-k)}{\zeta (s)}}}$.
• An average order of ${\displaystyle J_{k}(n)}$ is
${\displaystyle J_{k}(n)\sim {\frac {n^{k}}{\zeta (k+1)}}}$.
${\displaystyle \psi (n)={\frac {J_{2}(n)}{J_{1}(n)}}}$,
and by inspection of the definition (recognizing that each factor in the product over the primes is a cyclotomic polynomial of ${\displaystyle p^{-k}}$), the arithmetic functions defined by ${\displaystyle {\frac {J_{k}(n)}{J_{1}(n)}}}$ or ${\displaystyle {\frac {J_{2k}(n)}{J_{k}(n)}}}$ can also be shown to be integer-valued multiplicative functions.
• ${\displaystyle \sum _{\delta \mid n}\delta ^{s}J_{r}(\delta )J_{s}\left({\frac {n}{\delta }}\right)=J_{r+s}(n)}$.[2]

## Order of matrix groups

• The general linear group of matrices of order ${\displaystyle m}$ over ${\displaystyle \mathbf {Z} /n}$ has order[3]
${\displaystyle |\operatorname {GL} (m,\mathbf {Z} /n)|=n^{\frac {m(m-1)}{2}}\prod _{k=1}^{m}J_{k}(n).}$
• The special linear group of matrices of order ${\displaystyle m}$ over ${\displaystyle \mathbf {Z} /n}$ has order
${\displaystyle |\operatorname {SL} (m,\mathbf {Z} /n)|=n^{\frac {m(m-1)}{2}}\prod _{k=2}^{m}J_{k}(n).}$
• The symplectic group of matrices of order ${\displaystyle m}$ over ${\displaystyle \mathbf {Z} /n}$ has order
${\displaystyle |\operatorname {Sp} (2m,\mathbf {Z} /n)|=n^{m^{2}}\prod _{k=1}^{m}J_{2k}(n).}$

The first two formulas were discovered by Jordan.

## Examples

• Explicit lists in the OEIS are J2 in , J3 in , J4 in , J5 in , J6 up to J10 in up to .
• Multiplicative functions defined by ratios are J2(n)/J1(n) in , J3(n)/J1(n) in , J4(n)/J1(n) in , J5(n)/J1(n) in , J6(n)/J1(n) in , J7(n)/J1(n) in , J8(n)/J1(n) in , J9(n)/J1(n) in , J10(n)/J1(n) in , J11(n)/J1(n) in .
• Examples of the ratios J2k(n)/Jk(n) are J4(n)/J2(n) in , J6(n)/J3(n) in , and J8(n)/J4(n) in .

## Notes

1. ^ Sándor & Crstici (2004) p.106
2. ^ Holden et al in external links. The formula is Gegenbauer's.
3. ^ All of these formulas are from Andrica and Piticari in #External links.

## References

• L. E. Dickson (1971) [1919]. History of the Theory of Numbers, Vol. I. Chelsea Publishing. p. 147. ISBN 0-8284-0086-5. JFM 47.0100.04.
• M. Ram Murty (2001). Problems in Analytic Number Theory. Graduate Texts in Mathematics. Vol. 206. Springer-Verlag. p. 11. ISBN 0-387-95143-1. Zbl 0971.11001.
• Sándor, Jozsef; Crstici, Borislav (2004). Handbook of number theory II. Dordrecht: Kluwer Academic. pp. 32–36. ISBN 1-4020-2546-7. Zbl 1079.11001.