On the Fourier transform of the greatest common divisor

Details On the Fourier transform of the greatest common divisor On the Fourier transform of the greatest common divisor

2012-01-16

arxiv.org/abs/1201.3139v1

Mathematics

Number Theory

3 figures, submitted to Proceedings of the American Mathematical Society

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Fourier transform of the greatest common divisor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Fourier transform of the greatest common divisor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Fourier transform of the greatest common divisor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409401