摘要
Let. be the Euler's totient function and tau(n) be the number of divisors of n. Menon's beautiful identity states that Sigma(n)(k= 1) (gcd(k, n)= 1) gcd( k - 1, n) =phi(n)tau(n). Here we extend this identity to Dirichlet characters mod n.
- 出版日期2017-10
- 单位华东师范大学