## Experimental Mathematics

### Iterating the sum-of-divisors function

#### Abstract

Let $\sigma^0(n) = n$ and $\sigma^m(n) = \sigma(\sigma^{m-1}(n))$, where $m\ge1$ and $\sigma$ is the sum-of-divisors function. We say that $n$ is $(m,k)$-perfect if $\sigma^m(n) = kn$. We have tabulated all $(2,k)$-perfect numbers up to $10^9$ and all $(3,k)$- and $(4,k)$-perfect numbers up to $2\cdot10^8$. These tables have suggested several conjectures, some of which we prove here. We ask in particular: For any fixed $m\ge1$, are there infinitely many $(m,k)$-perfect numbers? Is every positive integer $(m,k)$-perfect, for sufficiently large $m\ge1$? In this connection, we have obtained the smallest value of $m$ such that $n$ is $(m,k)$-perfect, for $1\le n\le1000$. We also address questions concerning the limiting behaviour of $\sigma^{m+1}(n)/\sigma^m(n)$ and $(\sigma^m(n))^{1/m}$, as $m\to\infty$.

#### Article information

Source
Experiment. Math., Volume 5, Issue 2 (1996), 91-100.

Dates
First available in Project Euclid: 13 March 2003

https://projecteuclid.org/euclid.em/1047565640

Mathematical Reviews number (MathSciNet)
MR1418956

Zentralblatt MATH identifier
0866.11003

Subjects
Primary: 11A25: Arithmetic functions; related numbers; inversion formulas
Secondary: 11Y55: Calculation of integer sequences

#### Citation

Cohen, Graeme L.; te Riele, Herman J. J. Iterating the sum-of-divisors function. Experiment. Math. 5 (1996), no. 2, 91--100. https://projecteuclid.org/euclid.em/1047565640

#### Corrections

• See authors' correction: Errata: Iterating the sum-of-divisors function. Experiment. Math. vol. 6, iss. 2 (1997), p. 177.