The (n + 1)-Register Boundary Projection Theorem Boundary Registers, a Leading-Digit Criterion, and the Frequency of Length Expansion in Decimal Reverse-and-Add Arithmetic

For an n-digit integer N with n ≥ 2, we study the outermost digits of the reverse-and- add sum M = N + R(N) inside a fixed (n + 1)-register positional frame. Writing the outer digit sum as d1 + dn = 10T + U, we show that the units register equals U and the leading register equals T + γ, where γ ∈ {0, 1} is an exceptional carry that occurs if and only if U = 9 and a carry enters the highest original column. Our main result is a complete criterion for the leading register in terms of the symmetric sequence of column pair sums pj = dj + dn+1−j : the sum M has n + 1 digits if and only if the first pair sum different from 9, read from the outside inward, is at least 10. As a consequence, the leading register is forced to 1 when d1 + dn ≥ 10, forced to 0 when d1 + dn ≤ 8, and decided by the inner pair sums when d1 + dn = 9. We then count exactly how many n-digit integers produce a length-expanding step: the proportion is 11/20 for every odd n and 11/20 − 1/(2 · 10n/2) for every even n. All statements are verified by exhaustive computation for 2 ≤ n ≤ 7 and on the first sixteen iterates of the 196 trajectory. The results concern a single reverse-and-add step and do not bear on whether any trajectory reaches a palindrome.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24201822
Primary Topic
Smarandache Functions and Recreational Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The (n + 1)-Register Boundary Projection Theorem Boundary Registers, a Leading-Digit Criterion, and the Frequency of Length Expansion in Decimal Reverse-and-Add Arithmetic

Arnob Bachhar
2 links
Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
preprint

The (n + 1)-Register Boundary Projection Theorem Boundary Registers, a Leading-Digit Criterion, and the Frequency of Length Expansion in Decimal Reverse-and-Add Arithmetic

Arnob Bachhar
preprint en

Abstract

For an n-digit integer N with n ≥ 2, we study the outermost digits of the reverse-and- add sum M = N + R(N) inside a fixed (n + 1)-register positional frame. Writing the outer digit sum as d1 + dn = 10T + U, we show that the units register equals U and the leading register equals T + γ, where γ ∈ {0, 1} is an exceptional carry that occurs if and only if U = 9 and a carry enters the highest original column. Our main result is a complete criterion for the leading register in terms of the symmetric sequence of column pair sums pj = dj + dn+1−j : the sum M has n + 1 digits if and only if the first pair sum different from 9, read from the outside inward, is at least 10. As a consequence, the leading register is forced to 1 when d1 + dn ≥ 10, forced to 0 when d1 + dn ≤ 8, and decided by the inner pair sums when d1 + dn = 9. We then count exactly how many n-digit integers produce a length-expanding step: the proportion is 11/20 for every odd n and 11/20 − 1/(2 · 10n/2) for every even n. All statements are verified by exhaustive computation for 2 ≤ n ≤ 7 and on the first sixteen iterates of the 196 trajectory. The results concern a single reverse-and-add step and do not bear on whether any trajectory reaches a palindrome.

Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon