Peter H. van der Kamp
Published 2012-01-16Version 1
The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with Ramanujan's sum, and on the other hand it can be written as a generalised convolution product of the identity with the totient function. We show that this arithmetic function of two integers (a,m) counts the number of elements in the set of ordered pairs (i,j) such that i*j is equivalent to a modulo m. Furthermore we generalise a dozen known identities for the totient function, to identities which involve the discrete Fourier transform of the greatest common divisor, including its partial sums, and its Lambert series.
Comments: 3 figures, submitted to Proceedings of the American Mathematical Society
The discrete Fourier transform of $r$-even functions
Solutions of $φ(n)=φ(n+k)$ and $σ(n)=σ(n+k)$
Diophantine equations involving Euler's totient function
![QR code for arXiv:1201.3139 [math.NT]](http://oss.arxitics.com/images/favicon.svg)