Non-integer base of numeration

A non-integer representation uses non-integer numbers as the radix, or bases, of a positional numbering system. The numbers used for the positional digits are not defined. The choice of digits is usually made so as to express as many numbers as required using the smallest set of digits.

Thus, for a non-integer radix β > 1, the value of

$x=d_{n}\dots d_{2}d_{1}d_{0}.d_{-1}d_{-2}\dots d_{-m}$

is

$x=\beta ^{n}d_{n}+\cdots +\beta ^{2}d_{2}+\beta d_{1}+d_{0}+\beta ^{-1}d_{-1}+\beta ^{-2}d_{-2}+\cdots +\beta ^{-m}d_{-m}.$

The numbers d_i are integers between 0 and β. This is also known as a β-expansion, a notion introduced by Rényi (1957) and first studied in detail by Parry (1960). Infinite expansions are also possible.

There are applications of expansions in non-integer bases in coding theory (Kautz 1965) and models of quasicrystals (Burdik et al. 1998).

Construction

β-expansions are a generalization of decimal expansions. While infinite decimal expansions are not unique (for example, 1.000... = 0.999...), all finite decimal expansions are unique. However, even finite β-expansions are not necessarily unique, for example φ + 1 = φ² for β = φ, the golden ratio. A canonical choice for the β-expansion of a given real number can be determined by the following greedy algorithm, essentially due to Rényi (1957) and formulated as given here by Frougny (1992).

Let β > 1 be the base and x a non-negative real number. Denote by ⌊x⌋ the floor function of x, that is, the greatest integer less than or equal to x, and let {x} = x − ⌊x⌋ be the fractional part of x. There exists an integer k such that β^k ≤ x < β^k+1. Set

$d_{k}=\lfloor x/\beta ^{k}\rfloor$

and

$r_{k}=\{x/\beta ^{k}\}.$

For k − 1 ≥ j > −∞, put

$d_{j}=\lfloor \beta r_{j+1}\rfloor ,\quad r_{j}=\{\beta r_{j+1}\}.$

In other words, the canonical β-expansion of of x is defined by choosing the largest d_{k such that $\beta ^{k}d_{k}\leq x$, then choosing the largest dk−1 such that $\beta ^{k}d_{k}+\beta ^{k-1}d_{k-1}\leq x$, etc. Thus it chooses the lexicographically largest string representing x.}

With an integer base, this defines the usual radix expansion for the number x. This construction extends the usual algorithm to possible non-integer values of β.

Examples

Base φ

See Golden ratio base; 11_φ = 100_φ.

Base plastic number

11_p = 1000_p.

Base e

With base e the natural logarithm serves the same purpose as the common logarithm as ln 1_e = 0, ln 10_e = 1, ln 100_e = 2 and ln 1000_e = 3 which means that the area under the line y = 1/x can be expressed as 1 between 1_e and 10_e, 2 between 1_e and 100_e and 3 between 1_e and 100_e.

The base e is the most economical choice of radix β > 1 (Hayes 2001), where the radix economy is measured as the product of the radix and the length of the string of symbols needed to express a given range of values.

Base π

Base π can be used to show the relationship between the diameter of a circle to its circumference more easily; for example, a circle with a diameter 1_π will have a circumference of 10_π, a circle with a diameter 10_π will have a circumference of 100_π, a circle with a diameter 100_π will have a circumference of 1000_π, etc. and a circle with a circumference 1_π will have a diameter of 0.1_π, a circle with a circumference 10_π will have a diameter of 1_π, a circle with a circumference 100_π will have a diameter of 10_π and so on. Regarding area, a circle with a radius of 1 will have an area of 10_π, a circle with a radius of 10 will have an area of 1000_π and a circle with a radius of 100 will have an area of 100000_π.

Base √2

Base √2 behaves in a very similar way to base 2 as all one has to do to convert a number from binary into base √2 is put an 0 in between every digit; for example, 11101110111₂ becomes 101010001010100010101_√2 and 10011111110₂ becomes 1000001010101010101010100_√2. This means that every integer can be expressed in base √2 without the need of a decimal point. The base can also be used to show the relationship between the side of a square to its diagonal as a square with a side length of 1_√2 will have a circumference of 10_√2 and a square with a side length of 10_√2 will have a circumference of 100_√2. Another use of the base is to show the silver ratio as its representation in base √2 is simply 11_√2.

Properties

In no positional number system can every number be expressed uniquely. For example, in base 10, the number 1 has two representations: 1.000... and 0.999.... The set of numbers with two different representations is dense in the reals (Petkovšek 1990), but the question of classifying real numbers with unique β-expansions is considerably more subtle than that of integer bases (Glendinning & Sidorov 2001).

Another problem is to classify the real numbers whose β-expansions are periodic. Let β > 1, and Q(β) be the smallest field extension of the rationals containing β. Then any real number in [0,1) having a periodic β-expansion must lie in Q(β). On the other hand, the converse need not be true. The converse does hold if β is a Pisot number (Schmidt 1980), although necessary and sufficient conditions are not known.

See also

• Non-standard positional numeral systems
• Decimal expansion
• Power series

References

• Parry, W. (1960), "On the β-expansions of real numbers", Acta Mathematica Academiae Scientiarum Hungaricae, 11: 401–416, ISSN 0001-5954, MR0142719.

• Glendinning, Paul; Sidorov, Nikita (2001), "Unique representations of real numbers in non-integer bases", Mathematical Research Letters, 8 (4): 535–543, ISSN 1073-2780, MR1851269.

• Frougny, Christiane (1992), "How to write integers in non-integer base", LATIN '92, Lecture Notes in Computer Science, doi:10.1007/BFb0023826, ISBN 978-3-540-55284-0, ISSN 0302-9743 {{citation}}: Unknown parameter |Pages= ignored (|pages= suggested) (help); Unknown parameter |Publisher= ignored (|publisher= suggested) (help); Unknown parameter |Volume= ignored (|volume= suggested) (help).

• Schmidt, Klaus (1980), "On periodic expansions of Pisot numbers and Salem numbers", The Bulletin of the London Mathematical Society, 12 (4): 269–278, ISSN 0024-6093, MR576976

• Burdik, Č.; Frougny, Ch.; Gazeau, J. P.; Krejcar, R. (1998), "Beta-integers as natural counting systems for quasicrystals", Journal of Physics. A. Mathematical and General, 31 (30): 6449–6472, ISSN 0305-4470, MR1644115

• Kautz, William H. (1965), "Fibonacci codes for synchronization control", Institute of Electrical and Electronics Engineers. Transactions on Information Theory, IT-11: 284–292, ISSN 0018-9448, MR0191744

• Rényi, Alfréd (1957), "Representations for real numbers and their ergodic properties", Acta Mathematica Academiae Scientiarum Hungaricae, 8: 477–493, doi:10.1007/BF02020331, ISSN 0001-5954, MR0097374

• Hayes, Brian (2001), "Third base", American Scientist, 89 (6): 490–494.

• Petkovšek, Marko (1990), "Ambiguous numbers are dense", The American Mathematical Monthly, 97 (5): 408–411, ISSN 0002-9890, MR1048915

External links

• Weisstein, Eric W. "Base". MathWorld.