An Arithmetic Function Arising from the Dedekind Function
Abstract
We define to be the multiplicative arithemtic function that satisfies \[(pα)=cases pα-1(p+1), & if p≠ 2; \\ pα-1, & if p=2 cases\] for all primes p and positive integers α. Let λ(n) be the number of iterations of the function needed for n to reach 2. It follows from a theorem due to White that λ is additive. Following Shapiro's work on the iterated function, we determine bounds for λ. We also use the function λ to partition the set of positive integers into three sets S1,S2,S3 and determine some properties of these sets.
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.