 Jordan totient function

The Jordan totient function counts ordered $k$-tuples modulo $n$ that together with $n$ have greatest common divisor one. The inclusion-exclusion principle gives