Balanced ternary

Balanced ternary is a ternary numeral system (i.e. base 3 with three digits) that uses a balanced signed-digit representation of the integers in which the digits have the values −1, 0, and 1. This stands in contrast to the standard (unbalanced) ternary system, in which digits have values 0, 1 and 2.
The balanced ternary system can represent all integers without using a separate minus sign; the value of the leading non-zero digit of a number has the sign of the number itself. The balanced ternary system is an example of a non-standard positional numeral system. It was used in some early computers and also in some solutions of balance puzzles.

Different sources use different glyphs used to represent the three digits in balanced ternary. In this article, T (which resembles a ligature of the minus sign and 1) represents −1, while 0 and 1 represent themselves. Other conventions include using '−' and '+' to represent −1 and 1 respectively, or using Greek letter theta (Θ), which resembles a minus sign in a circle, to represent −1. In publications about the Setun computer, −1 is represented as overturned 1: "1".

Balanced ternary makes an early appearance in Michael Stifel's book ''Arithmetica Integra'' (1544). It also occurs in the works of Johannes Kepler and Léon Lalanne. Related signed-digit schemes in other bases have been discussed by John Colson, John Leslie, Augustin-Louis Cauchy, and possibly even the ancient Indian Vedas.. Reprinted in

Definition

Let $\mathcal_$ denote the set of symbols (also called glyphs or characters) $\mathcal_ = \lbrace \operatorname, 0, 1 \rbrace$, where the symbol $\bar$ is sometimes used in place of $\operatorname.$
Define an integer-valued function $f = f_ : \mathcal_ \to \mathbb$ by

:$f_(\operatorname) = -1,$
:$f_(0) = 0,$The symbol $0$ appears twice in the equality $f_(0) = 0$ but these instances do not represent the same thing. The right hand side $0$ means the integer zero but the instance of $0$ inside $f$'s parentheses (which belongs to $\mathcal_$) should be thought of as being nothing more than a symbol (without meaning). The reason for this is because although this article happened to choose $\mathcal_ = \lbrace \operatorname, 0, 1 \rbrace$ (it is this choice introduced the ambiguity), this set could, for example, have instead been chosen to consist of the symbols $\mathcal_ = \lbrace \operatorname, \operatorname, \operatorname \rbrace.$ This ambiguity can be removed by replacing "$f(0) = 0$" with the sentence "$f(0)$ is equal to the integer zero" or with "$f(0) = 0_$" where the symbol $0_$ denotes the usual integer value in base ten. The same is true of the symbol $1$ in the equality $f_(1) = 1.$ and
:$f_(1) = 1$

where the right hand sides are integers with their usual (decimal) values. This function, $f_,$ is what rigorously and formally establishes how integer values are assigned to the symbols/glyphs in $\mathcal_.$ One benefit of this formalism is that the definition of "the integers" (however they may be defined) is not conflated with any particular system for writing/representing them; in this way, these two distinct (albeit closely related) concepts are kept separate.

The set $\mathcal_$ together with the function $f_$ forms a balanced signed-digit representation called the balanced ternary system.
It can be used to represent integers and real numbers.

Ternary integer evaluation

Let $\mathcal_^$ be the Kleene plus of $\mathcal_$, which is the set of all finite length concatenated strings $d_n \ldots d_0$ of one or more symbols (called its digits) where $n$ is a non-negative integer and all $n + 1$ digits $d_n, \ldots, d_0$ are taken from $\mathcal_ = \lbrace \operatorname, 0, 1 \rbrace.$ The start of $d_n \ldots d_0$ is the symbol $d_0$ (at the right), its end is $d_n$ (at the left), and its length is $n + 1$. The ternary evaluation is the function $v = v_ ~:~ \mathcal_^ \to \mathbb$ defined by assigning to every string $d_n \ldots d_0 \in \mathcal_^$ the integer

:$v\left( d_n \ldots d_0 \right) ~=~ \sum_^ f_ \left( d_ \right) 3^.$

The string $d_n \ldots d_0$ represents (with respect to $v$) the integer $v\left( d_n \ldots d_0 \right).$ The value $v\left( d_n \ldots d_0 \right)$ may alternatively be denoted by $_.$
The map $v : \mathcal_^ \to \mathbb$ is surjective but not injective since, for example, $0 = v(0) = v(00) = v(0 0 0) = \cdots.$ However, every integer has exactly one representation under $v$ that does not end (on the left) with the symbol $0,$ i.e. $d_n = 0 .$

If $d_n \ldots d_0 \in \mathcal_^$ and $n > 0$ then $v$ satisfies:

:$v\left( d_n d_ \ldots d_0 \right) ~=~ f_ \left( d_ \right) 3^ + v\left( d_ \ldots d_0 \right)$

which shows that $v$ satisfies a sort of recurrence relation. This recurrence relation has the initial condition
$v\left( \varepsilon \right) = 0$
where $\varepsilon$ is the empty string.

This implies that for every string $d_n \ldots d_0 \in \mathcal_^,$

:$v\left( 0 d_n \ldots d_0 \right) = v\left( d_n \ldots d_0 \right)$

which in words says that leading $0$ symbols (to the left in a string with 2 or more symbols) do not affect the resulting value.

The following examples illustrate how some values of $v$ can be computed, where (as before) all integer are written in decimal (base 10) and all elements of $\mathcal_^$ are just symbols.

:$\begin v\left( \operatorname \operatorname \right) &= && f_\left( \operatorname \right) 3^ + && f_\left( \operatorname \right) 3^ &&= &&(-1) &&3 &&\,+\, &&(-1) &&1 &&= -4 \\ v\left( \operatorname 1 \right) &= && f_\left( \operatorname \right) 3^ + && f_\left( 1 \right) 3^ &&= &&(-1) &&3 &&\,+\, &&(1) &&1 &&= -2 \\ v\left( 1 \operatorname \right) &= && f_\left( 1 \right) 3^ + && f_\left( \operatorname \right) 3^ &&= &&(1) &&3 &&\,+\, &&(-1) &&1 &&= 2 \\ v\left( 1 1 \right) &= && f_\left( 1 \right) 3^ + && f_\left( 1 \right) 3^ &&= &&(1) &&3 &&\,+\, &&(1) &&1 &&= 4 \\ v\left( 1 \operatorname 0 \right) &= f_\left( 1 \right) 3^ + && f_\left( \operatorname \right) 3^ + && f_\left( 0 \right) 3^ &&= (1) 9 \,+\, &&(-1) &&3 &&\,+\, &&(0) &&1 &&= 6 \\ v\left( 1 0 \operatorname \right) &= f_\left( 1 \right) 3^ + && f_\left( 0 \right) 3^ + && f_\left( \operatorname \right) 3^ &&= (1) 9 \,+\, &&(0) &&3 &&\,+\, &&(-1) &&1 &&= 8 \\ \end$

and using the above recurrence relation

:$v\left( 1 0 1 \operatorname \right) = f_\left( 1 \right) 3^ + v\left( 0 1 \operatorname \right) = (1) 27 + v\left( 1 \operatorname \right) = 27 + 2 = 29.$

Conversion to decimal

In the balanced ternary system the value of a digit ''n'' places left of the radix point is the product of the digit and 3^''n''. This is useful when converting between decimal and balanced ternary. In the following the strings denoting balanced ternary carry the suffix, ''bal3''. For instance,
: 10_bal3 = 1 × 3¹ + 0 × 3⁰ = 3₁₀
: 10𝖳_bal3 = 1 × 3² + 0 × 3¹ + (−1) × 3⁰ = 8₁₀
: −9₁₀ = −1 × 3² + 0 × 3¹ + 0 × 3⁰ = 𝖳00_bal3
: 8₁₀ = 1 × 3² + 0 × 3¹ + (−1) × 3⁰ = 10𝖳_bal3

Similarly, the first place to the right of the radix point holds 3⁻¹ = , the second place holds 3⁻² = , and so on. For instance,
: −₁₀ = −1 + = −1 × 3⁰ + 1 × 3⁻¹ = 𝖳.1_bal3.

An integer is divisible by three if and only if the digit in the units place is zero.

We may check the parity of a balanced ternary integer by checking the parity of the sum of all trits. This sum has the same parity as the integer itself.

Balanced ternary can also be extended to fractional numbers similar to how decimal numbers are written to the right of the radix point.

:

In decimal or binary, integer values and terminating fractions have multiple representations. For example, = 0.1 = 0.1 = 0.0. And, = 0.1₂ = 0.1₂ = 0.0₂. Some balanced ternary fractions have multiple representations too. For example, = 0.1_bal3 = 0.0_bal3. Certainly, in the decimal and binary, we may omit the rightmost trailing infinite 0s after the radix point and gain a representations of integer or terminating fraction. But, in balanced ternary, we can't omit the rightmost trailing infinite −1s after the radix point in order to gain a representations of integer or terminating fraction.

Donald Knuth has pointed out that truncation and rounding are the same operation in balanced ternary—they produce exactly the same result (a property shared with other balanced numeral systems). The number is not exceptional; it has two equally valid representations, and two equally valid truncations: 0. (round to 0, and truncate to 0) and 1. (round to 1, and truncate to 1). With an odd radix, double rounding is also equivalent to directly rounding to the final precision, unlike with an even radix.

The basic operations—addition, subtraction, multiplication, and division—are done as in regular ternary. Multiplication by two can be done by adding a number to itself, or subtracting itself after a-trit-left-shifting.

An arithmetic shift left of a balanced ternary number is the equivalent of multiplication by a (positive, integral) power of 3; and an arithmetic shift right of a balanced ternary number is the equivalent of division by a (positive, integral) power of 3.

Conversion to and from a fraction

The conversion of a repeating balanced ternary number to a fraction is analogous to converting a repeating decimal. For example (because of 111111_bal3 = ()₁₀):
: $0.1\overline =\tfrac=\tfrac =\tfrac =\tfrac =\tfrac=\tfrac =\tfrac$

Irrational numbers

As in any other integer base, algebraic irrationals and transcendental numbers do not terminate or repeat. For example:
:

The balanced ternary expansions of $\pi$ is given in OEIS as , that of $e$ in .

Conversion from ternary

Unbalanced ternary can be converted to balanced ternary notation in two ways:
*Add 1 trit-by-trit from the first non-zero trit with carry, and then subtract 1 trit-by-trit from the same trit without borrow. For example,
*: 021₃ + 11₃ = 102₃, 102₃ − 11₃ = 1T1_bal3 = 7₁₀.
*If a 2 is present in ternary, turn it into 1T. For example,
*: 0212₃ = 0010_bal3 + 1T00_bal3 + 001T_bal3 = 10TT_bal3 = 23₁₀

If the three values of ternary logic are ''false'', ''unknown'' and ''true'', and these are mapped to balanced ternary as T, 0 and 1 and to conventional unsigned ternary values as 0, 1 and 2, then balanced ternary can be viewed as a biased number system analogous to the offset binary system.
If the ternary number has ''n'' trits, then the bias ''b'' is
:$b=\left\lfloor \frac \right\rfloor$
which is represented as all ones in either conventional or biased form.

As a result, if these two representations are used for balanced and unsigned ternary numbers, an unsigned ''n''-trit positive ternary value can be converted to balanced form by adding the bias ''b'' and a positive balanced number can be converted to unsigned form by subtracting the bias ''b''. Furthermore, if ''x'' and ''y'' are balanced numbers, their balanced sum is when computed using conventional unsigned ternary arithmetic. Similarly, if ''x'' and ''y'' are conventional unsigned ternary numbers, their sum is when computed using balanced ternary arithmetic.

Conversion to balanced ternary from any integer base

We may convert to balanced ternary with the following formula:
:$\left(a_na_\cdots a_1a_0.c_1 c_2 c_3\cdots\right)_b = \sum_^n a_kb^k + \sum_^\infty c_kb^.$

where,
: ''a_na''_''n''−1...''a''₁''a''₀.''c''₁''c''₂''c''₃... is the original representation in the original numeral system.
: ''b'' is the original radix. ''b'' is 10 if converting from decimal.
: ''a_k'' and ''c_k'' are the digits ''k'' places to the left and right of the radix point respectively.

For instance,
−25.4₁₀ = −(1T×101¹ + 1TT×101⁰ + 11×101⁻¹)
= −(1T×101 + 1TT + 11÷101)
= −10T1.
= T01T.

1010.1₂ = 1T¹⁰ + 1T¹ + 1T⁻¹
= 10T + 1T + 0.
= 101.

Addition, subtraction and multiplication and division

The single-trit addition, subtraction, multiplication and division tables are shown below. For subtraction and division, which are not commutative, the first operand is given to the left of the table, while the second is given at the top. For instance, the answer to 1 − T = 1T is found in the bottom left corner of the subtraction table.
:

Multi-trit addition and subtraction

Multi-trit addition and subtraction is analogous to that of binary and decimal. Add and subtract trit by trit, and add the carry appropriately.
For example:

1TT1TT.1TT1 1TT1TT.1TT1 1TT1TT.1TT1 1TT1TT.1TT1
+ 11T1.T − 11T1.T − 11T1.T → + TT1T.1
______________ ______________ _______________
1T0T10.0TT1 1T1001.TTT1 1T1001.TTT1
+ 1T + T T1 + T T
______________ ________________ ________________
1T1110.0TT1 1110TT.TTT1 1110TT.TTT1
+ T + T 1 + T 1
______________ ________________ ________________
1T0110.0TT1 1100T.TTT1 1100T.TTT1

Multi-trit multiplication

Multi-trit multiplication is analogous to that of binary and decimal.

1TT1.TT
× T11T.1
_____________
1TT.1TT multiply 1
T11T.11 multiply T
1TT1T.T multiply 1
1TT1TT multiply 1
T11T11 multiply T
_____________
0T0000T.10T

Multi-trit division

Balanced ternary division is analogous to that of binary and decimal.

However, 0.5₁₀ = 0.1111..._bal3 or 1.TTTT..._bal3. If the dividend over the plus or minus half divisor, the trit of the quotient must be 1 or T. If the dividend is between the plus and minus of half the divisor, the trit of the quotient is 0. The magnitude of the dividend must be compared with that of half the divisor before setting the quotient trit. For example,

1TT1.TT quotient
0.5 × divisor T01.0 _____________
divisor T11T.1 ) T0000T.10T dividend
T11T1 T000 < T010, set 1
_______
1T1T0
1TT1T 1T1T0 > 10T0, set T
_______
111T
1TT1T 111T > 10T0, set T
_______
T00.1
T11T.1 T001 < T010, set 1
________
1T1.00
1TT.1T 1T100 > 10T0, set T
________
1T.T1T
1T.T1T 1TT1T > 10T0, set T
________
0
Another example,
1TTT
0.5 × divisor 1T _______
Divisor 11 )1T01T 1T = 1T, but 1T.01 > 1T, set 1
11
_____
T10 T10 < T1, set T
TT
______
T11 T11 < T1, set T
TT
______
TT TT < T1, set T
TT
____
0
Another example,
101.TTTTTTTTT...
or 100.111111111...
0.5 × divisor 1T _________________
divisor 11 )111T 11 > 1T, set 1
11
_____
1 T1 < 1 < 1T, set 0
___
1T 1T = 1T, trits end, set 1.TTTTTTTTT... or 0.111111111...

Square roots and cube roots

The process of extracting the square root in balanced ternary is analogous to that in decimal or binary.
:$(10\cdot x+y)^-100\cdot x^=\mathrm\cdot x\cdot y+y^= \begin \mathrm\cdot x+1, & y=\mathrm \\ 0, & y=0 \\ \mathrm\cdot x+1, & y=1 \end$

As in division, we should check the value of half the divisor first. For example,
1. 1 1 T 1 T T 0 0 ...
_________________________
√ 1T 1<1T<11, set 1
− 1
_____
1×10=10 1.0T 1.0T>0.10, set 1
1T0 −1.T0
________
11×10=110 1T0T 1T0T>110, set 1
10T0 −10T0
________
111×10=1110 T1T0T T1T0T111T0, set 1
10T110 −10T110
__________
111T1×10=111T10 TT1TT0T TT1TT0T(10\cdot x+y)^-1000\cdot x^=y^+1000\cdot x^\cdot y+ 100\cdot x\cdot y^=
\begin
\mathrm+\mathrm\cdot x^+100\cdot x, & y=\mathrm\\
0, & y=0\\
1+1000\cdot x^+100\cdot x, & y=1
\end

Like division, we should check the value of half the divisor first too.
For example:
1. 1 T 1 0 ...
_____________________
³√ 1T
− 1 1<1T<10T,set 1
_______
1.000
1×100=100 −0.100 borrow 100×, do division
_______
1TT 1.T00 1T00>1TT, set 1
1×1×1000+1=1001 −1.001
__________
T0T000
11×100 − 1100 borrow 100×, do division
_________
10T000 TT1T00 TT1T001T1T01TT, set 1
11T×11T×1000+1=11111001 − 11111001
______________
1T10T000
11T1×100 − 11T100 borrow 100×, do division
__________
10T0T01TT 1T0T0T00 T01010T11<1T0T0T00<10T0T01TT, set 0
11T1×11T1×1000+1=1TT1T11001 − TT1T00 return 100×
_____________
1T10T000000
...
Hence = 1.259921₁₀ = 1.1T1 000 111 001 T01 00T 1T1 T10 111_bal3.

Applications

In computer design

In the early days of computing, a few experimental Soviet computers were built with balanced ternary instead of binary, the most famous being the Setun, built by Nikolay Brusentsov and Sergei Sobolev. The notation has a number of computational advantages over traditional binary and ternary. Particularly, the plus–minus consistency cuts down the carry rate in multi-digit multiplication, and the rounding–truncation equivalence cuts down the carry rate in rounding on fractions. In balanced ternary, the one-digit multiplication table remains one-digit and has no carry and the addition table has only two carries out of nine entries, compared to unbalanced ternary with one and three respectively.

"The complexity of arithmetic circuitry for balanced ternary arithmetic is not much greater than it is for the binary system, and a given number requires only $\log_3 2 \approx 63 \%$ as many digit positions for its representation."
"Perhaps the symmetric properties and simple arithmetic of this number system will prove to be quite important some day."

Other applications

The theorem that every integer has a unique representation in balanced ternary was used by Leonhard Euler to justify the identity of formal power series
:$\prod_^ \left(x^+1+x^\right)=\sum_^x^n.$

Balanced ternary has other applications besides computing. For example, a classical two-pan balance, with one weight for each power of 3, can weigh relatively heavy objects accurately with a small number of weights, by moving weights between the two pans and the table. For example, with weights for each power of 3 through 81, a 60-gram object (60₁₀ = 1T1T0_bal3) will be balanced perfectly with an 81 gram weight in the other pan, the 27 gram weight in its own pan, the 9 gram weight in the other pan, the 3 gram weight in its own pan, and the 1 gram weight set aside.

Similarly, consider a currency system with coins worth 1¤, 3¤, 9¤, 27¤, 81¤. If the buyer and the seller each have only one of each kind of coin, any transaction up to 121¤ is possible. For example, if the price is 7¤ (7₁₀ = 1T1_bal3), the buyer pays 1¤ + 9¤ and receives 3¤ in change.

They may also provide a more natural representation for the qutrit and systems that use it.

See also

* Methods of computing square roots
* Numeral system
* Qutrit
* Salamis Tablet
* Ternary computer
** Setun, a ternary computer
* Ternary logic

References

External links

Development of ternary computers at Moscow State University"Third base"
ternary and balanced ternary number systems
The Balanced Ternary Number System
(includes decimal integer to balanced ternary converter)
*
Balanced (Signed) Ternary Notation
{{Webarchive, url=https://web.archive.org/web/20160303182504/http://userpages.wittenberg.edu/bshelburne/BalancedTernaryTalkSu09.pdf , date=2016-03-03 by Brian J. Shelburne (PDF file)
The ternary calculating machine of Thomas Fowler
by Mark Glusker

Computer arithmetic
Non-standard positional numeral systems
Ternary computers
Numeral systems

de:Ternärsystem#Balanciert