Aliquot cycles of repdigits (Q2882734)

Let \(s(n)\) denote the sum of the divisors of \(n\) which are less than \(n\). An aliquot cycle of length \(k\) is a \(k\)-tuple of distinct positive integers \((n_1,\dots,n_k)\) such that \(s(n_i)=n_{i+1}\) for \(i=1,\dots, k-1\), and \(s(n_k)=n_1\). This notion generalizes that of perfect numbers (\(k=1\)) and of amicable numbers (\(k=2\)). A repdigit is a positive integer that is composed of repeated instances of the same digit.NEWLINENEWLINEThe authors show that the only aliquot cycle consisting only of repdigits in base 10 is the cycle consisting of the perfect number 6. Moreover, if \(g\) is even then there are only finitely many aliquot cycles consisting only of repdigits in base \(g\), and they are effectively computable. The proof of the first result is elementary (estimates on the 2-adic valuation of the sum of divisor function); the proof of the second result uses arguments from a recent paper of \textit{F. Luca} and \textit{P. Pollack} on multiperfect numbers with identical digits [J. Number Theory 131, No. 2, 260--284 (2011; Zbl 1218.11006)]. The authors conclude with two interesting open problems, namely, extend the second result to odd \(g\), and secondly, show that there are only finitely many repdigits in base \(g\) that can appear in an amicable pair.