Jordan’s totient functions

E300758 UNEXPLORED

Jordan’s totient functions are a family of arithmetic functions in number theory that generalize Euler’s totient function to count k-tuples of integers modulo n with certain coprimality conditions.


Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Euler’s totient function φ(n) relatedFunction Jordan’s totient functions