加载中…
We construct a sieve that enumerates rational ``imbalances’’ of the form for integers and , ordered lexicographically by . Each imbalance is reduced to lowest terms, and we record the sequence of distinct denominators as they first appear. We show that every positive integer occurs exactly once as such a denominator, and that its first appearance coincides with the unit fraction . We then prove that the sieve, when viewed as a map from pairs to reduced fractions, enumerates all rational numbers in without repetition, extend it symmetrically to all of , and discuss its connections to hyperbolic geometry and rational enumeration theory.

生成讲解博客的中文版本

生成AI智能校验的中文版本