Jordan's totient function

From testwiki
Jump to navigation Jump to search

Template:Short description In number theory, Jordan's totient function, denoted as Jk(n), where k is a positive integer, is a function of a positive integer, n, that equals the number of k-tuples of positive integers that are less than or equal to n and that together with n form a coprime set of k+1 integers.

Jordan's totient function is a generalization of Euler's totient function, which is the same as J1(n). The function is named after Camille Jordan.

Definition

For each positive integer k, Jordan's totient function Jk is multiplicative and may be evaluated as

Jk(n)=nkp|n(11pk), where p ranges through the prime divisors of n.

Properties

  • d|nJk(d)=nk.
which may be written in the language of Dirichlet convolutions as[1]
Jk(n)1=nk
and via Möbius inversion as
Jk(n)=μ(n)nk.
Since the Dirichlet generating function of μ is 1/ζ(s) and the Dirichlet generating function of nk is ζ(sk), the series for Jk becomes
n1Jk(n)ns=ζ(sk)ζ(s).
Jk(n)nkζ(k+1).
ψ(n)=J2(n)J1(n),
and by inspection of the definition (recognizing that each factor in the product over the primes is a cyclotomic polynomial of pk), the arithmetic functions defined by Jk(n)J1(n) or J2k(n)Jk(n) can also be shown to be integer-valued multiplicative functions.
  • δnδsJr(δ)Js(nδ)=Jr+s(n).[2]

Order of matrix groups

|GL(m,𝐙/n)|=nm(m1)2k=1mJk(n).
|SL(m,𝐙/n)|=nm(m1)2k=2mJk(n).
|Sp(2m,𝐙/n)|=nm2k=1mJ2k(n).

The first two formulas were discovered by Jordan.

Examples

Notes

Template:Reflist

References

Template:Totient

  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.