A 12-Cycle Attractor in an Iteration Combining Sum of Divisors and Floor Halving

Read full text Summarise with VIRAT
Authors: Zhuofan Lu
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

For any integer n > 1, define f(n) as follows: if sigma(n) < 2n (n is deficient), then f(n) = sigma(n) (the sum of all positive divisors of n); otherwise (n is abundant or perfect), f(n) = floor((n-1)/2). Iterating f eventually leads to the 12-cycle 6 → 2 → 3 → 4 → 7 → 8 → 15 → 24 → 11 → 12 → 5 → 6 → ... This has been verified for all n up to 10^10 (ten billion). A separate search for long chains (up to 10^9) recorded a maximum of 92 steps before entering the cycle, starting from n = 864266641. No other cycles or divergent orbits have been found. The number of steps appears to grow roughly like log_2 n, suggesting a possible underlying structure.

Fields of Study & Subjects

Analytic Number Theory Research Smarandache Functions and Recreational Number Theory Mathematical Dynamics and Fractals

Publication details

Journal / source
Figshare
Publication date
1 January 2026
Language
EN
Document type
Preprint