We prove that for a positive integer a the integer sequence satisfying for all
the recurrence
, the Euler function, generates in increasing order all integers coprime to . The finite Fourier expansion of is given in terms of , n, and the -th roots of unity. Properties of the sequence are derived.
You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.
References
[1] L. Ahlfors, Complex Analysis, International Series in Pure and Applied Mathematics, 3 Ed., McGraw-Hill Education (1979).
[2] J. Derbyshire, Unknown Quantity, A Real and Imaginary History of Algebra, Joseph Henry Press, Washington D.C. (2006).
[3] E. Graham, Alf van der Poorten, I. Shparlinski, Th. Ward, Recurrence Sequences, Mathematical Surveys and Monographs, 04, American Mathematical Society (2003).
[4] C.M. Petridi, Mathematical Structures defined by Identities III, International Journal of Applied Mathematics, 32, No 5 (2019), 793-804; DOI: 10.12732/ijam.v32i5.7.
[5] R. Walter, Real and Complex Analysis, 3rd Ed., McGraw-Hill Book Company (1987).
[6] N.J.A. Sloane (Ed.), Sequence A007947. The On-Line Encyclopedia of Integer Sequences, OEIS Foundation; https://en.wikipedia.org/wiki/On-Line Encyclopedia of Integer Sequences.
[7] A. Zygmund, Trigonometric Series (2nd Ed., Volume I and II combined), Cambridge University Press (1959).