Ostrowski numeration

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, Ostrowski numeration, named after Alexander Ostrowski, is either of two related numeration systems based on continued fractions: a non-standard positional numeral system for integers and a non-integer representation of real numbers. Fix a positive irrational number α with continued fraction expansion [a 0 ; a 1 , a 2 , ...]. Let (q n ) be the sequence of denominators of the convergents p n /q n to α: so q n = a n q n−1 + q n−2 . Let α n denote T n (α) where T is the Gauss map T(x) = {1/x}, and write β n = (−1) n+1 α 0 α 1 ... α n : we have β n = a n β n−1 + β n−2 .

In mathematics, Ostrowski numeration, named after Alexander Ostrowski, is either of two related numeration systems based on continued fractions: a non-standard positional numeral system for integers and a non-integer representation of real numbers. Fix a positive irrational number α with continued fraction expansion [a 0 ; a 1 , a 2 , ...]. Let (q n ) be the sequence of denominators of the convergents p n /q n to α: so q n = a n q n−1 + q n−2 . Let α n denote T n (α) where T is the Gauss map T(x) = {1/x}, and write β n = (−1) n+1 α 0 α 1 ... α n : we have β n = a n β n−1 + β n−2 .

Real number representations

Every positive real x can be written as x = \sum_{n=1}^\infty b_n \beta_n \ where the integer coefficients 0 ≤ b n ≤ a n and if b n = a n then b n−1 = 0.

Integer representations

Every positive integer N can be written uniquely as N = \sum_{n=1}^k b_n q_n \ where the integer coefficients 0 ≤ b n ≤ a n and if b n = a n then b n−1 = 0. If α is the golden ratio, then all the partial quotients a n are equal to 1, the denominators q n are the Fibonacci numbers and we recover Zeckendorf's theorem on the Fibonacci representation of positive integers as a sum of distinct non-consecutive Fibonacci numbers.

See also

Complete sequence

References

.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1144244501 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001144244501 · captured 1678636897.0 · version history

Cite this page as: encyclopegia.org, “Ostrowski numeration”, snapshot enwiki-001144244501. https://encyclopegia.org/a/ostrowski-numeration

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.