On Congruences for Iterates of the Sum--Power Divisor Function and Conditional Implications for the Riemann Hypothesis
Zeraoulia Rafik, Pedro Caceres

TL;DR
This paper investigates the divisibility properties of iterated sum-of-divisors functions, disproves a conjecture about universal divisibility, and explores their connection to the Riemann Hypothesis through dynamical and statistical analysis.
Contribution
It proves that no integer greater than 1 satisfies universal divisibility for all iterates, and links divisor sum growth and residue dynamics to the Riemann Hypothesis.
Findings
No integer n > 1 satisfies σ^k(n) ≡ 0 mod n for all k ≥ 1.
Only n=6 satisfies the congruence for all odd k among multiperfect numbers.
Residue dynamics exhibit bifurcations and entropy patterns related to zeta zeros and RH.
Abstract
Inspired by Cohen and te Riele~\cite{Cohen1996}, who computationally verified that for every there exists such that (where denotes the -fold iteration of the sum-of-divisors function), this paper resolves their reverse question negatively: no integer satisfies for \emph{all} . The proof eliminates prior gaps via Lenstra's density-zero bounds combined with Robin's RH-equivalent criterion (), showing universal metaperfect divisibility implies RH-violating growth or low-lying zeta zeros near . Among multiperfect with prime , only satisfies the congruence for all odd , with Shannon entropy $H(\sigma^k(6) \mod…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories · Advanced Algebra and Geometry · Mathematical Analysis and Transform Methods
