Iterating sum of power divisor function and New equivalence to the Riemann hypothesis
Abstract
This paper investigates the dynamics of the iterated sum-of-divisors function σk(m) and its behaviour modulo m, motivated by classical questions on perfect and multiperfect numbers and by the congruences σk(m) 0 m. Perfect and multiperfect numbers remain extremely rare; odd perfect numbers are still unknown and must be astronomically large. Here, the emphasis is on the dynamical and statistical structure of the iterates rather than on isolated examples. Three main results are obtained. First, it is proved that no integer m>1 can satisfy σk(m) 0 m for all k 0, thereby ruling out the existence of "metaperfect" numbers and showing that the iteration of σ cannot remain permanently trapped in the residue class 0 modulo m. Second, for certain explicit integers such as m=6,12,24, the sequence σk(m) m is strictly periodic with small period dividing L=lcm(ei+1), where the ei are the prime exponents of m. Bifurcation plots and distributional analysis reveal a transition from rigid two-cycle structure to more complex residue dynamics as m increases. Third, a new equivalence with the Riemann Hypothesis is established: RH holds if and only if, for every even non-squarefree m 5041 containing a prime fifth power, \[ σk(m)σk-1(m)σk-1(m) eγ, \] and the sequence σk(m) m is eventually periodic, uniformly in k 0. Extensive computations support these periodicity phenomena, yield non-normal discrete distribution models for the residues, and suggest a connection with a newly proposed Schrodinger-type "Caceres" operator whose spectrum numerically reproduces key statistical features of the nontrivial zeros of the Riemann zeta function.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.