Jordan's totient function

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Let be a positive integer. In number theory, Jordan's totient function of a positive integer is the number of -tuples of positive integers all less than or equal to that form a coprime -tuple together with . This is a generalisation of Euler's totient function, which is . The function is named after Camille Jordan.


Jordan's totient function is multiplicative and may be evaluated as


which may be written in the language of Dirichlet convolutions as[1]

and via Möbius inversion as


Since the Dirichlet generating function of is and the Dirichlet generating function of is , the series for becomes


and by inspection of the definition (recognizing that each factor in the product over the primes is a cyclotomic polynomial of ), the arithmetic functions defined by or can also be shown to be integer-valued multiplicative functions.

  • .      [2]

Order of matrix groups[edit]

The general linear group of matrices of order over has order[3]

The special linear group of matrices of order over has order

The symplectic group of matrices of order over has order

The first two formulas were discovered by Jordan.


Explicit lists in the OEIS are J2 in OEISA007434, J3 in OEISA059376, J4 in OEISA059377, J5 in OEISA059378, J6 up to J10 in OEISA069091 up to OEISA069095.

Multiplicative functions defined by ratios are J2(n)/J1(n) in OEISA001615, J3(n)/J1(n) in OEISA160889, J4(n)/J1(n) in OEISA160891, J5(n)/J1(n) in OEISA160893, J6(n)/J1(n) in OEISA160895, J7(n)/J1(n) in OEISA160897, J8(n)/J1(n) in OEISA160908, J9(n)/J1(n) in OEISA160953, J10(n)/J1(n) in OEISA160957, J11(n)/J1(n) in OEISA160960.

Examples of the ratios J2k(n)/Jk(n) are J4(n)/J2(n) in OEISA065958, J6(n)/J3(n) in OEISA065959, and J8(n)/J4(n) in OEISA065960.


  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 Andrici and Priticari in #External links


External links[edit]