arXiv · 1410.2054
Prime number decomposition of the Fourier transform of a function of the greatest common divisor
Abstract
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the prime factors of the argument, the explicit form of which is proven in this paper. Subsequently it is shown how the procedure can be generalized to the discrete Fourier transform of a function of the greatest common divisor. From this representation some interesting relations concerning the Euler totient function and generalizations thereof are established.
Explore related subjects
Keep this discovery
L. J. Holleboom. 2014-10-08. Prime number decomposition of the Fourier transform of a function of the greatest common divisor. https://arxiv.org/abs/1410.2054
Cite the original work for its findings. Save a collection to share your selection of sources.