Golden mean base

\nThe Golden mean (φ) can be used as a number base. It is known as the golden mean base, or colloquially, phinary (since the symbolism for the golden mean is the Greek letter "phi"). Any real number has a standard representation as a base-φ numeral in which only the digits 0 and 1 are used, and the digit sequence "11" is avoided. A nonstandard base-φ numeral with this digit sequence (or with other digits) can always be rewritten in standard form, relying on algebraic properties of the number φ -- most notably that φ+1 = φ². For instance 11_φ = 100_φ. Despite using an irrational base, it is a remarkable fact that all integers have a unique representation as a terminating (or finite) base-φ expansion. Other numbers have standard representations in base φ, with rational numbers having recurring representations. These representations are unique, except that numbers with a terminating expansion also have a non-terminating expansion. (As they do in base 10: 2.2=2.199999...) Examples:\n\n\n\n\n\n\n\n\n\n\n\n

Decimal	Powers of φ	Base φ
1	φ0	1
2	φ1+φ-2	10.01
3	φ2+φ-2	100.01
4	φ2+φ0+φ-2	101.01
5	φ3+φ-1+φ-4	1000.1001
6	φ3+φ1+φ-4	1010.0001
7	φ4+φ-4	10000.0001
8	φ4+φ0+φ-4	10001.0001
9	φ4+φ1+φ-2+φ-4\n	10010.0101

Table of contents

1 Writing a φ-base number in standard form 2 Representing integers as Golden mean base numbers 2.1 Non-uniqueness 3 Representing Rationals as Golden mean base numbers 4 Addition, subtraction, multiplication 4.2 Avoiding digits other than 0 and 1 5 Division 6 A close relation: Fibonacci Representation 7 External links

Writing a φ-base number in standard form

211.01_φ is not a standard φ-base numeral, since it contains a "11" and a "2", which isn't a "0" or "1", and contains a 1=-1, which isn't a "0" or "1" either. To "standardize" a numeral, we can use the following substitutions: 011_φ = 100_φ, 0200_φ = 1001_φ and 010_φ = 101_φ. We can apply the substitutions in any order we like, as the result is the same. Below, the substitutions used are on the right, the resulting number on the left.

  211.01φ\n   300.01φ     011φ → 100φ\n  1101.01φ     0200φ → 1001φ\n 10001.01φ     011φ → 100φ (again)\n 10001.101φ    010φ → 101φ\n 10000.011φ    010φ → 101φ (again)\n 10000.1φ      011φ → 100φ (again)

Any positive number with a non-standard terminating base-φ representation can be uniquely standardized in this manner. If we get to a point, where all digits are "0" or "1", except for the first digit being negative, then the number is negative. This can be converted to the negative of a base-φ representation by negating every digit, standardizing the result, and then mark it as negative. For example, use a minus sign, or some other significance to denote negative numbers. If the arithmetic is being performed on a computer, an error message may be returned. Note that when adding the digits "9" and "1", the result is a single digit "(10)", "A" or similar, as we are not working in decimal.

Representing integers as Golden mean base numbers

We can either consider our integer to be the (only) digit of a nonstandard φ-base numeral, and standardize it, or do the following: Note that 1×1 = 1, φ × φ = 1 + φ and 1/φ = -1 + φ. Therefore, we can compute

(a + bφ) + (c + dφ) = ((a + c) + (b + d)φ), (a + bφ) - (c + dφ) = ((a - c) + (b - d)φ)

and

(a + bφ) × (c + dφ) = ((a × c + b × d) + (a × d + b × c + b × d)φ).

So, using integer values only, we can add, subtract and multiply numbers of the form (a + bφ), and even represent positive and negative integer powerss of φ. (Note that φ^-1 = 1/φ.) (a + bφ) > (c + dφ) if and only if 2(a - c) - (d - b) > (d - b) × √5. If one side is negative, the other positive, the comparison is trivial. Otherwise, square both sides, to get an integer comparison, reversing the comparison direction if both sides were negative. On squaring both sides, the √5 is replaced with the integer 5. So, using integer values only, we can also compare numbers of the form (a + bφ).

1. To convert an integer x to a φ-base number, note that x = (x + 0φ).\n# Subtract the highest power of φ, which is still smaller than the number we have, to get out new number, and record a "1" in the appropriate place in the resulting φ-base number.\n# Unless our number is 0, go to step 2.\n# Finished.

The above procedure will never result in the sequence "11", since 11_φ = 100_φ, so getting a "11" would mean we missed a "1" prior to the sequence "11". e.g Start with integer=5, with the result so far being ...00000.00000..._φ
\nHighest power of φ ≤ 5 is φ³ = 1 + 2φ ≈ 4.236067977 Subtracting this from 5, we have 5 - (1 + 2φ) = 4 - 2φ ≈ 0.763932023..., with the result so far being 1000.00000..._φ Highest power of φ ≤ 4 - 2φ ≈ 0.763932023... is φ^-1 = -1 + 1φ ≈ 0.618033989... Subtracting this from 4 - 2φ ≈ 0.763932023..., we have 4 - 2φ - (-1 + 1φ) = 5 - 3φ ≈ 0.145898034..., with the result so far being 1000.10000..._φ Highest power of φ ≤ 5 - 3φ ≈ 0.145898034... is φ^-4 = 5 - 3φ ≈ 0.145898034... Subtracting this from 5 - 3φ ≈ 0.145898034..., we have 5 - 3φ - (5 - 3φ) = 0 + 0φ = 0, with the final result being 1000.1001_φ.

Non-uniqueness

Just as with any base-n system, numbers with a terminating representation have an alternative recurring representation. In base 10, this relies on the observation that if x = 0.9999... then 10x = 9.99999... so that 9x = 9 and x=1. In base φ, the numeral 0.1010101... can be see to be equal to 1 in several ways:\n*Conversion to nonstandard form: 1 = 0.11_φ = 0.1011_φ = 0.101011_φ = ... = 0.10101010...._φ\n*Geometric series: 1.0101010..._φ is equal to\n:: \n*Difference between "shifts": φ² x - x = 10.101010..._φ - 0.101010..._φ = 10_φ = φ so that x = φ/(φ²-1) = 1\nThis non-uniqueness is a feature of the numeration system, since both 1.0000 and 0.101010... are in standard form.

Representing Rationals as Golden mean base numbers

Every rational number can be represented as a recurring base φ expansion, as can any element of the field Q[√5] = Q + √5Q, the field generated by the rational numbers and √5. Conversely any recurring (or terminating) base φ expansion is an element of Q[√5]. Some examples (with spaces added for emphasis):

• 1/2 = 0.010 010 010 ... _φ\n*1/3 = 0.00101000 00101000 00101000... _φ \n*√5 = 10.100000_φ\n*2+(1/13)√5 = 10.010 1000100010101000100010000000 1000100010101000100010000000 1000100010101000100010000000 ..._φ

The justification that a rational gives a recurring expansion is analogous to the equivalent proof for a base-n numeration system (n=2,3,4,...). Essentially in base-φ long division, there are only a finite number of possible remainders, and so once there must be a recurring pattern. For example with 1/2 = 1/10.01_φ = 100_φ/1001_φ long division looks like this (note that subtraction is a bit freaky)

               .0 1 0 0 1\n         ------------------------\n 1 0 0 1 ) 1 0 0.0 0 0 0 0 0 0 0\n             1 0 0 1                        trade: 10000 = 1100 = 1011\n             -------                            so 10000-1001 = 1011-1001 = 10\n                 1 0 0 0 0\n                   1 0 0 1\n                   -------\n                       etc

\nThe converse is also true, in that a number with a recurring base-φ representation is an element of the field Q[√5]. This follows from the observation that a recurring representation with period k involves a geometric series with ratio φ^-k, which will sum to an element of Q[√5].

Addition, subtraction, multiplication

\nIt is possible to adapt all the standard algorithms of base-10 arithmetic to base-φ arithmetic. There are two approaches to this:\n

Calculate then convert to standard form

\nTo add two φ-base numbers, add each pair of digits, without carry, and then convert the numeral to standard form. To subtract, subtract each pair of digits without borrow (borrow is a negative amount of carry), and then convert the numeral to standard form. To multiply, multiply how you normally multiply, without carry, and then convert the numeral to standard form. For example\n*2+3 = 10.01 + 100.01 = 110.02 = 110.1001 = 1000.1001\n*2×3 = 10.01 × 100.01 = 1000.1 + 1.0001 = 1001.1001 = 1010.0001\n*7-2 = 10000.0001 - 10.01 = 10010.0101 = 1110.0101 = 1001.0101 = 1000.1001

Avoiding digits other than 0 and 1

\nA more "native" approach is to avoid having to add digits 1+1 or to subtract 0-1. This is done by reorganising the operands into nonstandard form so that these combinations do not occur. For example\n*2+3 = 10.01 + 100.01 = 10.01 + 100.0011 = 110.0111 = 1000.1001\n*7-2 = 10000.0001 - 10.01 = 1100.0001 - 10.01 = 1011.0001 - 10.01 = 1010.1101 - 10.01 = 1000.1001\nThe subtraction seen here uses a modified form of the standard "trading" algorithm for subtraction.

Division

\nNo fractions (a/b, where a and b are integers, a not divisible by b) can be represented as a finite φ-base number, in other words, all finitely representable φ-base numbers are either integers or (more likely) an irrational in the field Q[√5]. Due to long division having only a finite number of possible remainders, a division of two integers (or other numbers with finite base-φ representation) will have a recurring expansion, as demonstrated above.

A close relation: Fibonacci Representation

\nA closely related numeration system is Fibonacci representation used for integers. In this system, only digits 0 and 1 are used and the place values of the digits are the Fibonacci numbers. As with base-φ, the digit sequence "11" is avoided by rearranging to a standard form, using the Fibonacci recurrence relation F_k+1 = F_k + F_k-1. For example\n::30 = 1×21 + 0×13 + 1×8 + 0×5 + 0×3 + 0×2 + 1×1 + 0×1 = 10100010_fib.

External links

\n* Using Powers of Phi to represent Integers (Base Phi)