Top Qs
Timeline
Chat
Perspective

Jordan's totient function

Arithmetical function From Wikipedia, the free encyclopedia

Remove ads
Remove ads

In number theory, Jordan's totient function, denoted as , where is a positive integer, is a function of a positive integer, , that equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers.

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

Remove ads

Definition

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

, where ranges through the prime divisors of .
Remove ads

Properties

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]
Remove ads

Order of matrix groups

Summarize
Perspective
  • 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.

Remove ads

Examples

Remove ads

Notes

Loading content...

References

Loading content...
Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads