Jordan's totient function

From Citizendium
Revision as of 16:05, 29 October 2008 by imported>Richard Pinch (New article, my own wording from Wikipedia)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In number theory, Jordan's totient function of a positive integer n, named after Camille Jordan, is defined to be 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.

Definition

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

Properties

  • .
  • The average order of Jk(n) is c nk for some c.

References

Template:Numtheory-stub