加载中…
We define to be the multiplicative arithemtic function that satisfies for all primes and positive integers . Let be the number of iterations of the function needed for to reach . 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 and determine some properties of these sets.

生成讲解博客的中文版本

生成AI智能校验的中文版本