2000 character limit reached
A Note about Iterated Arithmetic Functions
Published 24 Jan 2015 in math.NT | (1501.06075v1)
Abstract: Let $f\colon\mathbb{N}\rightarrow\mathbb{N}0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p{\alpha})<p{\alpha}$ and $f(p)\vert f(p{\alpha})$. Suppose also that any prime that divides $f(p{\alpha})$ also divides $pf(p)$. Define $f(0)=0$, and let $H(n)=\displaystyle{\lim{m\rightarrow\infty}fm(n)}$, where $fm$ denotes the $m{th}$ iterate of $f$. We prove that the function $H$ is completely multiplicative.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.