A note about iterated arithmetic functions

Abstract: Let

f c o l o n m a t h b b N i g h t a r r o w m a t h b b N_{0}

be a multiplicative arithmetic function such that for all primes

p

and positive integers

a l p h a

,

f (p^{a l p h a}) < p^{a l p h a}

and

f (p) v e r t f (p^{a l p h a})

. Suppose also that any prime that divides

f (p^{a l p h a})

also divides

p f (p)

. Define

f (0) = 0

, and let

H (n) = d i s p l a y s t y l e l i m_{m i g h t a r r o w i n f t y} f^{m} (n)

, where

f^{m}

denotes the

m^{t h}

iterate of

f

. We prove that the function

H

is completely multiplicative.

Recommendations

Cited in

(10)

This page was built for publication: A note about iterated arithmetic functions