arXiv · 2508.10750
A Canonical Bijection Between Finite-Decimal Real Numbers and Natural Numbers with Constant-Time Enumeration Formulas
Abstract
We present an explicit bijection between finite-decimal real numbers and natural numbers ($\mathbb{N} = \{1, 2, 3, ...\}$) using a systematic 4-tuple parametrization with closed-form mathematical formulas for enumeration. Our enumeration system provides complete indexing of all real numbers with terminating decimal representations through the parametrization $(\text{sign}, N_1, N_2, N_3)$. Both forward and inverse mappings execute in O(1) constant time, achieved through closed-form lexicographic positioning formulas that eliminate enumeration loops. The system uses exact decimal arithmetic throughout, ensuring perfect accuracy across all representable numbers. This bijective correspondence demonstrates that finite-decimal real numbers can be systematically enumerated and indexed with optimal constant-time computational efficiency.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
S. K. Rithvik. 2025-08-14. A Canonical Bijection Between Finite-Decimal Real Numbers and Natural Numbers with Constant-Time Enumeration Formulas. https://arxiv.org/abs/2508.10750
Cite the original work for its findings. Save a collection to share your selection of sources.