Jordan Totient Calculator

J_k(n) = generalized totient

All Tools

Loading tool...

About Jordan Totient Calculator

A Jordan totient calculator computing J_k(n) = n^k · Π_{p|n}(1 - 1/p^k). When k=1, J_1 = Euler's totient φ. J_k counts k-tuples of integers in [1,n] whose gcd with n is 1. Multiplicative function. Client-side.

Jordan Totient Calculator Features

  • J_k(n) computation
  • Any k
  • Multiplicativity
  • Prime factorization
  • Table
Advertisement
Advertisement