Jordan's totient function

From Citizendium
Revision as of 15:05, 29 October 2008 by imported>Richard Pinch (remove WPmarkup; subpages)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

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