Golden ratio base is a
non-integer positional numeral system that uses the
golden ratio
In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Expressed algebraically, for quantities a and b with a > b > 0,
where the Greek letter phi ( ...
(the irrational number ≈ 1.61803399 symbolized by the
Greek letter
The Greek alphabet has been used to write the Greek language since the late 9th or early 8th century BCE. It is derived from the earlier Phoenician alphabet, and was the earliest known alphabetic script to have distinct letters for vowels as ...
φ) as its
base. It is sometimes referred to as base-φ, golden mean base, phi-base, or, colloquially, phinary. Any
non-negative
In mathematics, the sign of a real number is its property of being either positive, negative, or zero. Depending on local conventions, zero may be considered as being neither positive nor negative (having no sign or a unique third sign), or it ...
real number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every ...
can be represented as a base-φ numeral using only the digits 0 and 1, and avoiding the digit sequence "11" – this is called a ''standard form''. A base-φ numeral that includes the digit sequence "11" can always be rewritten in standard form, using the algebraic properties of the base φ — most notably that φ (φ
1) + 1 (φ
0) = φ
2. For instance, 11
φ = 100
φ.
Despite using an
irrational number
In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two inte ...
base, when using standard form, all non-negative
integer
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s have a unique representation as a terminating (finite) base-φ expansion. The set of numbers which possess a finite base-φ representation is the
ring
Ring may refer to:
* Ring (jewellery), a round band, usually made of metal, worn as ornamental jewelry
* To make a sound with a bell, and the sound made by a bell
:(hence) to initiate a telephone connection
Arts, entertainment and media Film and ...
Z ">/a> it plays the same role in this numeral systems as
dyadic rationals play in
binary number
A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method of mathematical expression which uses only two symbols: typically "0" (zero) and "1" ( one).
The base-2 numeral system is a positional notatio ...
s, providing a possibility to
multiply
Multiplication (often denoted by the cross symbol , by the mid-line dot operator , by juxtaposition, or, on computers, by an asterisk ) is one of the four elementary mathematical operations of arithmetic, with the other ones being additi ...
.
Other numbers have standard representations in base-φ, with
rational number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ration ...
s having recurring representations. These representations are unique, except that numbers with a terminating expansion also have a non-terminating expansion. For example, 1 = 0.1010101… in base-φ just as
1 = 0.99999… in
base-10
The decimal numeral system (also called the base-ten positional numeral system and denary or decanary) is the standard system for denoting integer and non-integer numbers. It is the extension to non-integer numbers of the Hindu–Arabic numeral ...
.
Examples
Writing golden ratio base numbers in standard form
In the following example the notation
1 is used to represent −1.
211.0
1φ is not a standard base-φ numeral, since it contains a "11" and additionally a "2" and a "
1" = −1, which are not "0" or "1".
To "standardize" a numeral, we can use the following substitutions: 011
φ = 100
φ, 0200
φ = 1001
φ, 0
10
φ =
101
φ and 1
10
φ = 001
φ. We can apply the substitutions in any order we like, as the result is the same. Below, the substitutions applied to the number on the previous line are on the right, the resulting number on the left.
Any
positive number
In mathematics, the sign of a real number is its property of being either positive, negative, or zero. Depending on local conventions, zero may be considered as being neither positive nor negative (having no sign or a unique third sign), or it ...
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. (The exception to this is when the first digit is negative one and the next two digits are one, like
1111.001=1.001.) This can be converted to the negative of a base-φ representation by
negating every digit, standardizing the result, and then marking it as negative. For example, use a
minus sign
The plus and minus signs, and , are mathematical symbols used to represent the notions of positive and negative, respectively. In addition, represents the operation of addition, which results in a sum, while represents subtraction, resul ...
, or some other significance to denote negative numbers. If the arithmetic is being performed on a computer, an
error message
An error message is information displayed when an unforeseen occurs, usually on a computer or other device. On modern operating systems with graphical user interfaces, error messages are often displayed using dialog boxes. Error messages are use ...
may be returned.
Representing integers as golden ratio 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:
1 × 1 = 1, φ × φ = 1 + φ and = −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''φ) = ((''ac'' + ''bd'') + (''ad'' + ''bc'' + ''bd'')φ).
So, using integer values only, we can add, subtract and multiply numbers of the form (''a'' + ''b''φ), and even represent positive and negative integer
powers of φ.
(''a'' + ''b''φ) > (''c'' + ''d''φ) if and only if 2(''a'' − ''c'') − (''d'' − ''b'') > (''d'' − ''b'') × . 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 is replaced with the integer 5.
So, using integer values only, we can also compare numbers of the form (''a'' + ''b''φ).
# To convert an integer ''x'' to a base-φ number, note that ''x'' = (''x'' + 0φ).
# Subtract the highest power of φ, which is still smaller than the number we have, to get our new number, and record a "1" in the appropriate place in the resulting base-φ number.
# Unless our number is 0, go to step 2.
# 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".
Start, e.g., with integer = 5, with the result so far being ...00000.00000...
φ
Highest power of φ ≤ 5 is φ
3 = 1 + 2φ ≈ 4.236067977
Subtracting this from 5, we have 5 − (1 + 2φ) = 4 − 2φ ≈ 0.763932023..., 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..., 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
0.999...=1. In base-φ, the numeral 0.1010101... can be seen to be equal to 1 in several ways:
*Conversion to nonstandard form: 1 = 0.11
φ = 0.1011
φ = 0.101011
φ = ... = 0.10101010....
φ
*
Geometric series
In mathematics, a geometric series is the sum of an infinite number of terms that have a constant ratio between successive terms. For example, the series
:\frac \,+\, \frac \,+\, \frac \,+\, \frac \,+\, \cdots
is geometric, because each suc ...
: 1.0101010...
φ is equal to
:
*Difference between "shifts": φ
2 ''x'' − ''x'' = 10.101010...
φ − 0.101010...
φ = 10
φ = φ so that ''x'' = = 1
This non-uniqueness is a feature of the numeration system, since both 1.0000 and 0.101010... are in standard form.
In general, the final 1 of any number in base-φ can be replaced with a recurring 01 without changing the value of that number.
Representing rational numbers as golden ratio base numbers
Every non-negative rational number can be represented as a recurring base-φ expansion, as can any non-negative element of the
field
Field may refer to:
Expanses of open ground
* Field (agriculture), an area of land used for agricultural purposes
* Airfield, an aerodrome that lacks the infrastructure of an airport
* Battlefield
* Lawn, an area of mowed grass
* Meadow, a grass ...
Q[] = Q + Q, the field generated by the
rational number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ration ...
s and
. Conversely any recurring (or terminating) base-φ expansion is a non-negative element of Q[]. For recurring decimals, the recurring part has been overlined:
* ≈ 0.
00101000φ
* = 10.1
φ
*2 + ≈ 10.01
long division
In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit Hindu-Arabic numerals (Positional notation) that is simple enough to perform by hand. It breaks down a division problem into a series of easier steps ...
there are only a finite number of possible remainders, and so once there must be a recurring pattern. For example, with = = long division looks like this (note that base-φ subtraction may be hard to follow at first):
The converse is also true, in that a number with a recurring base-φ; representation is an element of the field Q[]. This follows from the observation that a recurring representation with period k involves a geometric series with ratio φ
, which will sum to an element of Q[].
≈ 100.0100 1010 1001 0001 0101 0100 0001 0100 ...
* ≈ 100.0000 1000 0100 1000 0000 0100 ...
≈ 1.0100 0001 0100 1010 0100 0000 0101 0000 0000 0101 ...
It is possible to adapt all the standard algorithms of base-10 arithmetic to base-φ arithmetic. There are two approaches to this:
of two base-φ numbers, add each pair of digits, without carry, and then convert the numeral to standard form. For
, subtract each pair of digits without borrow (borrow is a negative amount of carry), and then convert the numeral to standard form. For
, multiply in the typical base-10 manner, without carry, then convert the numeral to standard form.
For example,
*2 + 3 = 10.01 + 100.01 = 110.02 = 110.1001 = 1000.1001
*2 × 3 = 10.01 × 100.01 = 1000.1 + 1.0001 = 1001.1001 = 1010.0001
*7 − 2 = 10000.0001 − 10.01 = 100
A 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,
* 2 + 3 = 10.01 + 100.01 = 10.01 + 100.0011 = 110.0111 = 1000.1001
* 7 − 2 = 10000.0001 − 10.01 = 1100.0001 − 10.01 = 1011.0001 − 10.01 = 1010.1101 − 10.01 = 1000.1001
The subtraction seen here uses a modified form of the standard "trading" algorithm for subtraction.
base-φ number. In other words, all finitely representable base-φ numbers are either integers or (more likely) an irrational in a
Q[]. 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.
is a closely related numeration system used for integers. In this system, only digits 0 and 1 are used and the place values of the digits are the
s. As with base-φ, the digit sequence "11" is avoided by rearranging to a standard form, using the Fibonacci
. For example,
:30 = 1×21 + 0×13 + 1×8 + 0×5 + 0×3 + 0×2 + 1×1 + 0×1 = 10100010
.
. The sum of numbers in a General Fibonacci integer sequence that correspond with the nonzero digits in the base-φ number, is the multiplication of the base-φ number and the element at the zero-position in the sequence. For example:
*product 10 (10100.0101 base-φ) and 25 (zero position) = 5 + 10 + 65 + 170 = 250
*:base-φ: 1 0 1 0 0. 0 1 0 1
*:partial sequence: ... 5 5 10 15 ''25'' 40 65 105 170 275 445 720 1165 ...
*product 10 (10100.0101 base-φ) and 65 (zero position) = 10 + 25 + 170 + 445 = 650
*:base-φ: 1 0 1 0 0. 0 1 0 1
*:partial sequence: ... 5 5 10 15 25 40 ''65'' 105 170 275 445 720 1165 ...