Non-integer base of numeration

β-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 {{harvtxt|Rényi|1957}} and formulated as given here by {{harvtxt|Frougny|1992}}.

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

:$d\_k\; =\; \backslash lfloor\; x/\backslash beta^k\backslash rfloor$

and

:$r\_k\; =\; \backslash \{x/\backslash beta^k\backslash \}.\backslash ,$

For {{math|k − 1 ≥  j > −∞}}, put

:$d\_j\; =\; \backslash lfloor\backslash beta\; r\_\{j+1\}\backslash rfloor,\; \backslash quad\; r\_j\; =\; \backslash \{\backslash beta\; r\_\{j+1\}\backslash \}.$

In other words, the canonical β-expansion of x is defined by choosing the largest d_k such that {{math|β^kd_k ≤ x}}, then choosing the largest d_k−1 such that {{math|β^kd_k + β^k−1d_k−1 ≤ x}}, and so on. 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 possibly non-integer values of β.

Following the steps above, we can create a β-expansion for a real number $n\; \backslash geq\; 0$ (the steps are identical for an , although {{mvar|n}} must first be multiplied by {{val|-1}} to make it positive, then the result must be multiplied by {{val|-1}} to make it negative again).

First, we must define our {{mvar|k}} value (the exponent of the nearest power of {{mvar|β}} greater than {{mvar|n}}, as well as the amount of digits in $\backslash lfloor\; n\_\backslash beta\; \backslash rfloor$, where $n\_\backslash beta$ is {{mvar|n}} written in base {{mvar|β}}). The {{mvar|k}} value for {{mvar|n}} and {{mvar|β}} can be written as:

:$k\; =\; \backslash lfloor\; \backslash log\_\backslash beta(n)\; \backslash rfloor\; +\; 1$

After a {{mvar|k}} value is found, $n\_\backslash beta$ can be written as {{mvar|d}}, where

:$d\_j\; =\; \backslash lfloor\; (n/\backslash beta^j)\; \backslash bmod\; \backslash beta\; \backslash rfloor,\; \backslash quad\; n\; =\; n-d\_j*\backslash beta^j$

for {{math|k − 1 ≥  j > −∞}}. The first {{mvar|k}} values of {{mvar|d}} appear to the left of the decimal place.

This can also be written in the following pseudocode:{{citation |url=https://decimalsystem.js.org/ |title=Home |website=decimalsystem.js.org}}

function toBase(n, b) {

k = floor(log(b, n)) + 1

precision = 8

result = ""

for (i = k - 1, i > -precision-1, i--) {

if (result.length == k) result += "."

digit = floor((n / b^i) mod b)

n -= digit * b^i

result += digit

}

return result

}

Note that the above code is only valid for and $n\; \backslash geq\; 0$, as it does not convert each digits to their correct symbols or correct negative numbers. For example, if a digit's value is {{val|10}}, it will be represented as {{val|10}} instead of {{mvar|A}}.

• JavaScript:

function toBasePI(num, precision = 8) {

let k = Math.floor(Math.log(num)/Math.log(Math.PI)) + 1;

if (k < 0) k = 0;

let digits = [];

for (let i = k-1; i > (-1*precision)-1; i--) {

let digit = Math.floor((num / Math.pow(Math.PI, i)) % Math.PI);

num -= digit * Math.pow(Math.PI, i);

digits.push(digit);

if (num < 0.1**(precision+1) && i <= 0)

break;

}

if (digits.length > k)

digits.splice(k, 0, ".");

return digits.join("");

}

• JavaScript:

function fromBasePI(num) {

let numberSplit = num.split(/\./g);

let numberLength = numberSplit[0].length;

let output = 0;

let digits = numberSplit.join("");

for (let i = 0; i < digits.length; i++) {

output += digits[i] * Math.pow(Math.PI, numberLength-i-1);

}

return output;

}

Base Square root of 2 behaves in a very similar way to base 2 as all one has to do to convert a number from binary into base {{radic|2}} is put a zero digit in between every binary digit; for example, 1911₁₀ = 11101110111₂ becomes 101010001010100010101_{{radic|2}} and 5118₁₀ = 1001111111110₂ becomes 1000001010101010101010100_{{radic|2}}. This means that every integer can be expressed in base {{radic|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_{{radic|2}} will have a diagonal of 10_{{radic|2}} and a square with a side length of 10_{{radic|2}} will have a diagonal of 100_{{radic|2}}. Another use of the base is to show the silver ratio as its representation in base {{radic|2}} is simply 11_{{radic|2}}. In addition, the area of a regular octagon with side length 1_{{radic|2}} is 1100_{{radic|2}}, the area of a regular octagon with side length 10_{{radic|2}} is 110000_{{radic|2}}, the area of a regular octagon with side length 100_{{radic|2}} is 11000000_{{radic|2}}, etc...

{{main|Golden ratio base}}

In the golden base, some numbers have more than one decimal base equivalent: they are ambiguous. For example:

11_φ = 100_φ.

There are some numbers in base ψ that are also ambiguous. For example, 101_ψ = 1000_ψ.

With base e the natural logarithm behaves like the common logarithm in base 10, as ln(1_e) = 0, ln(10_e) = 1, ln(100_e) = 2 and ln(1000_e) = 3 (or more precisely the representation in base e of 3, which is of course a non-terminating number). This means that the integer part of the natural logarithm of a number in base e counts the number of digits before the separating point in that number, minus one.

The base e is the most economical choice of radix β > 1,{{harvnb|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. A binary number uses only two different digits, but it needs a lot of digits for representing a number; base 10 writes shorter numbers, but it needs 10 different digits to write them. The balance between those is base e, which therefore would store numbers optimally.

Base π can be used to more easily show the relationship between the diameter of a circle to its circumference, which corresponds to its perimeter; since circumference = diameter × π, a circle with a diameter 1_π will have a circumference of 10_π, a circle with a diameter 10_π will have a circumference of 100_π, etc. Furthermore, since the area = π × radius², 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_π.{{Citation|url=http://datagenetics.com/blog/december22015/index.html|title=Weird Number Bases|website=DataGenetics|access-date=2018-02-01}}

In every positional number system, not all numbers 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,{{harvnb|Petkovšek|1990}} but the question of classifying real numbers with unique β-expansions is considerably more subtle than that of integer bases.{{harvnb|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,{{harvnb|Schmidt|1980}} although necessary and sufficient conditions are not known.

• Beta encoder
• Non-standard positional numeral systems
• Decimal expansion
• Power series
• Ostrowski numeration

{{Reflist}}

{{refbegin|30em|indent=yes}}

• {{citation | last=Bugeaud | first=Yann | title=Distribution modulo one and Diophantine approximation | series=Cambridge Tracts in Mathematics | volume=193 | location=Cambridge | publisher=Cambridge University Press | year=2012 | isbn=978-0-521-11169-0 | zbl= 1260.11001}}
• {{Citation | last1=Burdik | first1=Č. | last2=Frougny | first2=Ch. | last3=Gazeau | first3=J. P. | last4=Krejcar | first4=R. | title=Beta-integers as natural counting systems for quasicrystals | doi=10.1088/0305-4470/31/30/011 | bibcode=1998JPhA...31.6449B | mr=1644115 | year=1998 | journal=Journal of Physics A: Mathematical and General | issn=0305-4470 | volume=31 | issue=30 | pages=6449–6472| citeseerx=10.1.1.30.5106 }}.
• {{citation|series=Lecture Notes in Computer Science

|publisher=Springer Berlin / Heidelberg

|issn=0302-9743

|volume=583/1992

|title=LATIN '92

|doi=10.1007/BFb0023826

|year=1992

|isbn=978-3-540-55284-0

|pages=154–164

|chapter=How to write integers in non-integer base

|first=Christiane

|last=Frougny

|chapter-url=https://books.google.com/books?id=I3fC6batwokC&pg=PA154

}}.

• {{Citation | last1=Glendinning | first1=Paul | author1-link=Paul Glendinning | last2=Sidorov | first2=Nikita | title=Unique representations of real numbers in non-integer bases | url=http://intlpress.com/site/pub/pages/journals/items/mrl/content/vols/0008/0004/00019835/index.html | mr=1851269 | year=2001 | journal=Mathematical Research Letters | issn=1073-2780 | volume=8 | issue=4 | pages=535–543 | doi=10.4310/mrl.2001.v8.n4.a12| doi-access=free }}.
• {{citation | first=Brian|last=Hayes|title=Third base|journal=American Scientist|url=http://www.americanscientist.org/issues/pub/third-base/2|year=2001|volume=89|issue=6|pages=490–494|doi=10.1511/2001.40.3268 | archive-url = https://web.archive.org/web/20160324100419/http://www.americanscientist.org/issues/pub/2001/11/third-base/2 | archive-date = 2016-03-24 | url-status = dead }}.
• {{Citation | last1=Kautz | first1=William H. | title=Fibonacci codes for synchronization control | mr=0191744 | year=1965 | journal=Institute of Electrical and Electronics Engineers. Transactions on Information Theory | issn=0018-9448 | volume=IT-11 | issue=2 | pages=284–292| doi=10.1109/TIT.1965.1053772 }}.
• {{Citation | last1=Parry | first1=W. | authorlink=Bill Parry (mathematician) | title=On the β-expansions of real numbers | mr=0142719 | year=1960 | journal=Acta Mathematica Academiae Scientiarum Hungaricae | issn=0001-5954 | volume=11 | issue=3–4 | pages=401–416 | doi=10.1007/bf02020954| hdl=10338.dmlcz/120535 | s2cid=116417864 | hdl-access=free }}.
• {{Citation | last1=Petkovšek | first1=Marko | author1-link=Marko Petkovšek | title=Ambiguous numbers are dense | doi=10.2307/2324393 | mr=1048915 | year=1990 | journal=The American Mathematical Monthly | issn=0002-9890 | volume=97 | issue=5 | pages=408–411| jstor=2324393 }}.
• {{Citation | last1=Rényi | first1=Alfréd | authorlink=Alfréd Rényi | title=Representations for real numbers and their ergodic properties | mr=0097374 | doi=10.1007/BF02020331 | hdl=10338.dmlcz/102491 | year=1957 | journal=Acta Mathematica Academiae Scientiarum Hungaricae | issn=0001-5954 | volume=8 | issue=3–4 | pages=477–493| s2cid=122635654 | hdl-access=free }}.
• {{Citation | last1=Schmidt | first1=Klaus | title=On periodic expansions of Pisot numbers and Salem numbers | doi=10.1112/blms/12.4.269 | hdl=10338.dmlcz/141479 | mr=576976 | year=1980 | journal=The Bulletin of the London Mathematical Society | issn=0024-6093 | volume=12 | issue=4 | pages=269–278| hdl-access=free }}.
• {{Citation | last1=Thurston | first1=W.P. | title=Groups, tilings and finite state automata |journal=AMS Colloquium Lectures | year=1989}}

{{refend}}

• {{citation | last=Sidorov | first=Nikita | chapter=Arithmetic dynamics | zbl=1051.37007 | editor1-last=Bezuglyi | editor1-first=Sergey | editor2-last=Kolyada | editor2-first=Sergiy | title=Topics in dynamics and ergodic theory. Survey papers and mini-courses presented at the international conference and US-Ukrainian workshop on dynamical systems and ergodic theory, Katsiveli, Ukraine, August 21–30, 2000 | location=Cambridge | publisher=Cambridge University Press | isbn=978-0-521-53365-2 | series=Lond. Math. Soc. Lect. Note Ser. | volume=310 | pages=145–189 | year=2003 }}

• {{mathworld|title=Base|urlname=Base}}

{{DEFAULTSORT:Non-Integer Representation}}

Category:Number theory

Category:Ring theory

Category:Coding theory

Category:Non-standard positional numeral systems