加载中…
In this article, we propose a variant of the usual Ostrowski -numeration (where is a real in [0, 1[) that codes integers (positive as well as negative) and reals of [0, 1[ (instead of [–, 1–[), so that for every integer n, n and {n} have the same coding sequence. These coding sequences respect natural lexicographic orders and will be used to prove well known results on order properties of Kronecker sequences ({n – }) n .

生成讲解博客的中文版本

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