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^[1] and has also been used to solve balance puzzles.^[2]

Different sources use different glyphs 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".^[1]

Balanced ternary makes an early appearance in Michael Stifel's book Arithmetica Integra (1544).^[3] 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.^[2]

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

${\displaystyle {\begin{aligned}f_{}(\operatorname {T} )&=-1,\\f_{}(0)&=0,\\f_{}(1)&=1,\end{aligned}}}$^[4]

where the right hand sides are integers with their usual values. This function, ${\displaystyle f_{},}$ is what rigorously and formally establishes how integer values are assigned to the symbols/glyphs in ${\displaystyle {\mathcal {D}}_{3}.}$ 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 ${\displaystyle {\mathcal {D}}_{3}}$ together with the function ${\displaystyle f_{}}$ forms a balanced signed-digit representation called the balanced ternary system. It can be used to represent integers and real numbers.

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

${\displaystyle v\left(d_{n}\ldots d_{0}\right)~=~\sum _{i=0}^{n}f_{}\left(d_{i}\right)3^{i}.}$

The string ${\displaystyle d_{n}\ldots d_{0}}$ represents (with respect to ${\displaystyle v}$) the integer ${\displaystyle v\left(d_{n}\ldots d_{0}\right).}$ The value ${\displaystyle v\left(d_{n}\ldots d_{0}\right)}$ may alternatively be denoted by ${\displaystyle {d_{n}\ldots d_{0}}_{\operatorname {bal} 3}.}$ The map ${\displaystyle v:{\mathcal {D}}_{3}^{+}\to \mathbb {Z} }$ is surjective but not injective since, for example, ${\displaystyle 0=v(0)=v(00)=v(000)=\cdots .}$ However, every nonzero integer has exactly one representation under ${\displaystyle v}$ that does not end (on the left) with the symbol ${\displaystyle 0,}$ i.e. ${\displaystyle d_{n}=0.}$

If ${\displaystyle d_{n}\ldots d_{0}\in {\mathcal {D}}_{3}^{+}}$ and ${\displaystyle n>0}$ then ${\displaystyle v}$ satisfies:

${\displaystyle v\left(d_{n}d_{n-1}\ldots d_{0}\right)~=~f_{}\left(d_{n}\right)3^{n}+v\left(d_{n-1}\ldots d_{0}\right)}$

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

This implies that for every string ${\displaystyle d_{n}\ldots d_{0}\in {\mathcal {D}}_{3}^{+},}$

${\displaystyle v\left(0d_{n}\ldots d_{0}\right)=v\left(d_{n}\ldots d_{0}\right)}$

which in words says that leading ${\displaystyle 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 ${\displaystyle v}$ can be computed, where (as before) all integer are written in decimal (base 10) and all elements of ${\displaystyle {\mathcal {D}}_{3}^{+}}$ are just symbols.

${\displaystyle {\begin{alignedat}{10}v\left(\operatorname {T} \operatorname {T} \right)&=&&f_{}\left(\operatorname {T} \right)3^{1}+&&f_{}\left(\operatorname {T} \right)3^{0}&&=&&(-1)&&3&&\,+\,&&(-1)&&1&&=-4\\v\left(\operatorname {T} 1\right)&=&&f_{}\left(\operatorname {T} \right)3^{1}+&&f_{}\left(1\right)3^{0}&&=&&(-1)&&3&&\,+\,&&(1)&&1&&=-2\\v\left(1\operatorname {T} \right)&=&&f_{}\left(1\right)3^{1}+&&f_{}\left(\operatorname {T} \right)3^{0}&&=&&(1)&&3&&\,+\,&&(-1)&&1&&=2\\v\left(11\right)&=&&f_{}\left(1\right)3^{1}+&&f_{}\left(1\right)3^{0}&&=&&(1)&&3&&\,+\,&&(1)&&1&&=4\\v\left(1\operatorname {T} 0\right)&=f_{}\left(1\right)3^{2}+&&f_{}\left(\operatorname {T} \right)3^{1}+&&f_{}\left(0\right)3^{0}&&=(1)9\,+\,&&(-1)&&3&&\,+\,&&(0)&&1&&=6\\v\left(10\operatorname {T} \right)&=f_{}\left(1\right)3^{2}+&&f_{}\left(0\right)3^{1}+&&f_{}\left(\operatorname {T} \right)3^{0}&&=(1)9\,+\,&&(0)&&3&&\,+\,&&(-1)&&1&&=8\\\end{alignedat}}}$

and using the above recurrence relation

${\displaystyle v\left(101\operatorname {T} \right)=f_{}\left(1\right)3^{3}+v\left(01\operatorname {T} \right)=(1)27+v\left(1\operatorname {T} \right)=27+2=29.}$

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ⁿ. 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_dec

10𝖳_bal3 = 1 × 3² + 0 × 3¹ + (−1) × 3⁰ = 8_dec

−9_dec = −1 × 3² + 0 × 3¹ + 0 × 3⁰ = 𝖳00_bal3

8_dec = 1 × 3² + 0 × 3¹ + (−1) × 3⁰ = 10𝖳_bal3

Similarly, the first place to the right of the radix point holds 3⁻¹ = ⁠1/3⁠, the second place holds 3⁻² = ⁠1/9⁠, and so on. For instance,

−⁠2/3⁠_dec = −1 + ⁠1/3⁠ = −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.^[5]

Decimal	−0.9	−0.8	−0.7	−0.6	−0.5	−0.4	−0.3	−0.2	−0.1	0
Balanced Ternary	𝖳.010𝖳	𝖳.1𝖳𝖳1	𝖳.10𝖳0	𝖳.11𝖳𝖳	0.𝖳 or 𝖳.1	0.𝖳𝖳11	0.𝖳010	0.𝖳11𝖳	0.0𝖳01	0
Decimal	0.9	0.8	0.7	0.6	0.5	0.4	0.3	0.2	0.1	0
Balanced Ternary	1.0𝖳01	1.𝖳11𝖳	1.𝖳010	1.𝖳𝖳11	0.1 or 1.𝖳	0.11𝖳𝖳	0.10𝖳0	0.1𝖳𝖳1	0.010𝖳	0

In decimal or binary, integer values and terminating fractions have multiple representations. For example, ⁠1/10⁠ = 0.1 = 0.10 = 0.09. And, ⁠1/2⁠ = 0.1₂ = 0.10₂ = 0.01₂. Some balanced ternary fractions have multiple representations too. For example, ⁠1/6⁠ = 0.1𝖳_bal3 = 0.01_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^[6] 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 ⁠1/2⁠ is not exceptional; it has two equally valid representations, and two equally valid truncations: 0.1 (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.

The conversion of a repeating balanced ternary number to a fraction is analogous to converting a repeating decimal. For example (because of 111111_bal3 = (⁠3⁶ − 1/3 − 1⁠)_dec):

${\displaystyle 0.1{\overline {\mathrm {110TT0} }}={\tfrac {\mathrm {1110TT0-1} }{\mathrm {111111\times 1T\times 10} }}={\tfrac {\mathrm {1110TTT} }{\mathrm {111111\times 1T0} }}={\tfrac {\mathrm {111\times 1000T} }{\mathrm {111\times 1001\times 1T0} }}={\tfrac {\mathrm {1111\times 1T} }{\mathrm {1001\times 1T0} }}={\tfrac {1111}{10010}}={\tfrac {\mathrm {1T1T} }{\mathrm {1TTT0} }}={\tfrac {101}{\mathrm {1T10} }}}$

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_dec.

• If a 2 is present in ternary, turn it into 1T. For example,

  0212₃ = 0010_bal3 + 1T00_bal3 + 001T_bal3 = 10TT_bal3 = 23_dec

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

${\displaystyle b=\left\lfloor {\frac {3^{n}}{2}}\right\rfloor }$

which is represented as all ones in either conventional or biased form.^[7]

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 x + y − b when computed using conventional unsigned ternary arithmetic. Similarly, if x and y are conventional unsigned ternary numbers, their sum is x + y + b when computed using balanced ternary arithmetic.

We may convert to balanced ternary with the following formula:

${\displaystyle \left(a_{n}a_{n-1}\cdots a_{1}a_{0}.c_{1}c_{2}c_{3}\cdots \right)_{b}=\sum _{k=0}^{n}a_{k}b^{k}+\sum _{k=1}^{\infty }c_{k}b^{-k}.}$

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.4dec = −(1T×1011 + 1TT×1010 + 11×101−1)           = −(1T×101 + 1TT + 11÷101)           = −10T1.11TT           =  T01T.TT11 

 1010.12 = 1T10 + 1T1 + 1T−1            = 10T + 1T + 0.1            = 101.1 

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.

Addition + T 0 1 T T1 T 0 0 T 0 1 1 0 1 1T

Subtraction − T 0 1 T 0 T T1 0 1 0 T 1 1T 1 0

Multiplication × T 0 1 T 1 0 T 0 0 0 0 1 T 0 1

Division ÷ T 1 T 1 T 0 0 0 1 T 1

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  T1          ______________         ________________                             ________________            1T1110.0TT1              1110TT.TTT1                                 1110TT.TTT1          +   T                    + T   1                                     + T   1          ______________         ________________                             ________________            1T0110.0TT1               1100T.TTT1                                  1100T.TTT1 

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 

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

However, 0.5_dec = 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... 

The process of extracting the square root in balanced ternary is analogous to that in decimal or binary.

${\displaystyle (10\cdot x+y)^{\mathrm {1T} }-100\cdot x^{\mathrm {1T} }=\mathrm {1T0} \cdot x\cdot y+y^{\mathrm {1T} }={\begin{cases}\mathrm {T10} \cdot x+1,&y=\mathrm {T} \\0,&y=0\\\mathrm {1T0} \cdot x+1,&y=1\end{cases}}}$

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                   T1T0T<TTT0, set T                        100T0   −T0010                                _________                 111T×10=111T0    1TTT0T                 1TTT0T>111T0, set 1                        10T110   −10T110                                 __________                111T1×10=111T10    TT1TT0T               TT1TT0T<TTT1T0, set T                        100TTT0   −T001110                                  ___________               111T1T×10=111T1T0    T001TT0T             T001TT0T<TTT1T10, set T                        10T11110   −T01TTTT0                                   ____________                111T1TT×10=111T1TT0    T001T0T           TTT1T110<T001T0T<111T1TT0, set 0                                      −      T           Return 1                                      ___________              111T1TT0×10=111T1TT00    T001T000T         TTT1T1100<T001T000T<111T1TT00, set 0                                      −        T         Return 1                                      _____________            111T1TT00*10=111T1TT000    T001T00000T                                              ...  

Extraction of the cube root in balanced ternary is similarly analogous to extraction in decimal or binary:

${\displaystyle (10\cdot x+y)^{10}-1000\cdot x^{10}=y^{10}+1000\cdot x^{\mathrm {1T} }\cdot y+100\cdot x\cdot y^{\mathrm {1T} }={\begin{cases}\mathrm {T} +\mathrm {T000} \cdot x^{\mathrm {1T} }+100\cdot x,&y=\mathrm {T} \\0,&y=0\\1+1000\cdot x^{\mathrm {1T} }+100\cdot x,&y=1\end{cases}}}$

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           TT1T00<T01000, set T        11×11×1000+1=1TT1001   −T11T00T                               ____________                                 1TTT01000            11T×100             −    11T00        borrow 100×, do division                                ___________                    1T1T01TT     1TTTT0100        1TTTT0100>1T1T01TT, 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 ³√2 = 1.259921_dec = 1.1T1 000 111 001 T01 00T 1T1 T10 111_bal3.

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

Decimal	Balanced ternary
${\displaystyle {\sqrt {2}}=1.4142135623731\ldots }$	${\displaystyle {\sqrt {\mathrm {1T} }}=\mathrm {1.11T1TT00T00T01T0T00T00T01TT\ldots } }$
${\displaystyle {\sqrt {3}}=1.7320508075689\ldots }$	${\displaystyle {\sqrt {\mathrm {10} }}=\mathrm {1T.T1TT10T0000TT1100T0TTT011T0\ldots } }$
${\displaystyle {\sqrt {5}}=2.2360679774998\ldots }$	${\displaystyle {\sqrt {\mathrm {1TT} }}=\mathrm {1T.1T0101010TTT1TT11010TTT01T1\ldots } }$
${\textstyle \varphi ={\frac {1+{\sqrt {5}}}{2}}=1.6180339887499\ldots }$	${\textstyle \varphi ={\frac {1+{\sqrt {\mathrm {1TT} }}}{\mathrm {1T} }}=\mathrm {1T.T0TT01TT0T10TT11T0011T10011\ldots } }$
${\displaystyle \tau =6.28318530717959\ldots }$	${\displaystyle \tau =\mathrm {1T0.10TT0T1100T110TT0T1TT000001} \ldots }$
${\displaystyle \pi =3.14159265358979\ldots }$	${\displaystyle \pi =\mathrm {10.011T111T000T011T1101T111111} \ldots }$
${\displaystyle e=2.71828182845905\ldots }$	${\displaystyle e=\mathrm {10.T0111TT0T0T111T0111T000T11T} \ldots }$

The balanced ternary expansions of ${\displaystyle \pi }$ is given in OEIS as A331313, that of ${\displaystyle e}$ in A331990.

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. Knuth wrote that "Perhaps the symmetric properties and simple arithmetic of this number system will prove to be quite important some day,"^[6] noting that,

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 ${\displaystyle \log _{3}2\approx 63\%}$ as many digit positions for its representation."^[6]

More recently, balanced ternary numbers have been proposed for some highly-efficient low-resolution implementations of artificial neural networks. In deep learning, neural nets usually use continuous (floating-point) values, but there are many works investigating quantisation and binarisation to create neural nets that can run with much lower power and/or lower memory requirements. Balanced ternary numbers are proposed to be used for the network parameters, because they are extremely compact, but can naturally represent excitatory/inhibitory/null activation patterns.^[8][9]

Balanced ternary may also provide a more natural representation for the qutrit and quantum computing systems that use it.

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^[10]

${\displaystyle \prod _{n=0}^{\infty }\left(x^{-3^{n}}+1+x^{3^{n}}\right)=\sum _{n=-\infty }^{\infty }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_dec = 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_dec = 1T1_bal3), the buyer pays 1¤ + 9¤ and receives 3¤ in change.

• Signed-digit representation
• Methods of computing square roots
• Numeral system
• Qutrit
• Salamis Tablet
• Ternary computer
  • Setun, a ternary computer
• Ternary logic
• Generalized balanced ternary

Wikimedia Commons has media related to Balanced ternary.

• Development of ternary computers at Moscow State University
• Representation of Fractional Numbers in Balanced Ternary
• "Third base", ternary and balanced ternary number systems
• The Balanced Ternary Number System (includes decimal integer to balanced ternary converter)
• OEIS sequence A182929 (The binomial triangle reduced to balanced ternary lists)
• Balanced (Signed) Ternary Notation Archived 2016-03-03 at the Wayback Machine by Brian J. Shelburne (PDF file)
• The ternary calculating machine of Thomas Fowler by Mark Glusker