# A Canonical Bijection Between Finite-Decimal Real Numbers and Natural Numbers with Constant-Time Enumeration Formulas

Source: [A Canonical Bijection Between Finite-Decimal Real Numbers and Natural Numbers with Constant-Time Enumeration Formulas](<https://www.sota2.com/research/paper/68fa5e051e209131ce9dea6c>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:16.568Z

Authors: S.K. Rithvik

Published: 2025-08-14T15:34:25.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2508.10750>)

[PDF](<https://arxiv.org/pdf/2508.10750.pdf>)
