On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions
arXiv:1506.05426
Abstract
We begin by introducing an interesting class of functions, known as the Schemmel totient functions, that generalizes the Euler totient function. For each Schemmel totient function , we define two new functions, denoted and , that arise from iterating . Roughly speaking, counts the number of iterations of needed to reach either or , and takes the value (either or ) that the iteration trajectory eventually reaches. Our first major result is a proof that, for any positive integer , the function is completely multiplicative. We then introduce an iterate summatory function, denoted , and define the terms -deficient, -perfect, and -abundant. We proceed to prove several results related to these definitions, culminating in a proof that, for all positive even integers , there are infinitely many -abundant numbers. Many open problems arise from the introduction of these functions and terms, and we mention a few of them, as well as some numerical results.
16 pages, 1 figure