A Note about Iterated Arithmetic Functions

Abstract

Let f→N0 be a multiplicative arithmetic function such that for all primes p and positive integers α, f(pα)<pα and f(p) f(pα). Suppose also that any prime that divides f(pα) also divides pf(p). Define f(0)=0, and let H(n)=m→∞fm(n), where fm denotes the mth iterate of f. We prove that the function H is completely multiplicative.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…