# 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. While binary numerals with digits 0 and 1 provide the simplest positional numeral system for natural numbers (or for positive integers if using 1 and 2 as the digits), balanced ternary provides the simplest self-contained positional numeral system[definition needed] for integers. 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.

## Definition

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

$f_{}(\operatorname {T} )=-1,$ $f_{}(0)=0,$ [note 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 {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 ${\mathcal {D}}_{3}$ 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 {D}}_{3}^{+}$ be the Kleene plus of ${\mathcal {D}}_{3}$ , 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 {D}}_{3}=\lbrace \operatorname {T} ,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_{3}~:~{\mathcal {D}}_{3}^{+}\to \mathbb {Z}$ defined by assigning to every string $d_{n}\ldots d_{0}\in {\mathcal {D}}_{3}^{+}$ the integer

$v\left(d_{n}\ldots d_{0}\right)~=~\sum _{i=0}^{n}f_{}\left(d_{i}\right)3^{i}.$ 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 ${d_{n}\ldots d_{0}}_{\operatorname {bal} 3}.$ The map $v:{\mathcal {D}}_{3}^{+}\to \mathbb {Z}$ is surjective but not injective since, for example, $0=v(0)=v(00)=v(000)=\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 {D}}_{3}^{+}$ and $n>0$ then $v$ satisfies:

$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 $v$ satisfies a sort of recurrence relation. This recurrence relation has three initial conditions, one for every $d\in {\mathcal {D}}_{3},$ where $v\left(d\right)=f_{}\left(d\right)\,3^{0}=f_{}\left(d\right).$ Explicitly, they are $v\left(\operatorname {T} \right)=-1,$ $v\left(0\right)=0,$ and $v\left(1\right)=1.$ This implies that for every string $d_{n}\ldots d_{0}\in {\mathcal {D}}_{3}^{+},$ $v\left(0d_{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 {D}}_{3}^{+}$ are just symbols.

{\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

$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.$ ## 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 3n. This is useful when converting between decimal and balanced ternary. In the following the strings denoting balanced ternary carry the suffix, bal3. For instance,

10bal3 = 1 × 31 + 0 × 30 = 310
10ᴛbal3 = 1 × 32 + 0 × 31 + (−1) × 30 = 810
−910 = −1 × 32 + 0 × 31 + 0 × 30 = ᴛ00bal3
810 = 1 × 32 + 0 × 31 + (−1) × 30 = 10ᴛbal3

Similarly, the first place to the right of the radix point holds 3−1 = 1/3, the second place holds 3−2 = 1/9, and so on. For instance,

2/310 = −1 + 1/3 = −1 × 30 + 1 × 3−1 = ᴛ.1bal3.
Dec Bal3 Expansion Dec Bal3 Expansion
0 0 0
1 1 +1 −1 −1
2 1ᴛ +3−1 −2 ᴛ1 −3+1
3 10 +3 −3 ᴛ0 −3
4 11 +3+1 −4 ᴛᴛ −3−1
5 1ᴛᴛ +9−3−1 −5 ᴛ11 −9+3+1
6 1ᴛ0 +9−3 −6 ᴛ10 −9+3
7 1ᴛ1 +9−3+1 −7 ᴛ1ᴛ −9+3−1
8 10ᴛ +9−1 −8 ᴛ01 −9+1
9 100 +9 −9 ᴛ00 −9
10 101 +9+1 −10 ᴛ0ᴛ −9−1
11 11ᴛ +9+3−1 −11 ᴛᴛ1 −9−3+1
12 110 +9+3 −12 ᴛᴛ0 −9−3
13 111 +9+3+1 −13 ᴛᴛᴛ −9−3−1

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.

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.12 = 0.102 = 0.012. Some balanced ternary fractions have multiple representations too. For example, 1/6 = 0.1bal3 = 0.01bal3. 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 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.

## Conversion to and from a fraction

Fraction Balanced ternary Fraction Balanced ternary
1 1 1/11 0.01ᴛ11
1/2 0.1 1. 1/12 0.01ᴛ
1/3 0.1 1/13 0.01ᴛ
1/4 0.1ᴛ 1/14 0.01ᴛ0ᴛ1
1/5 0.1ᴛᴛ1 1/15 0.01ᴛᴛ1
1/6 0.01 0.1 1/16 0.01ᴛᴛ
1/7 0.0110ᴛᴛ 1/17 0.01ᴛᴛᴛ10ᴛ0ᴛ111ᴛ01
1/8 0.01 1/18 0.001 0.01
1/9 0.01 1/19 0.00111ᴛ10100ᴛᴛᴛ1ᴛ0ᴛ
1/10 0.010ᴛ 1/20 0.0011

The conversion of a repeating balanced ternary number to a fraction is analogous to converting a repeating decimal. For example (because of 111111bal3 = (36 − 1/3 − 1)10):

$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} }}$ ## Irrational numbers

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

Decimal Balanced ternary
${\sqrt {2}}=1.4142135623731\ldots$ ${\sqrt {\mathrm {1T} }}=\mathrm {1.11T1TT00T00T01T0T00T00T01TT\ldots }$ ${\sqrt {3}}=1.7320508075689\ldots$ ${\sqrt {\mathrm {10} }}=\mathrm {1T.T1TT10T0000TT1100T0TTT011T0\ldots }$ ${\sqrt {5}}=2.2360679774998\ldots$ ${\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 } }$ $\tau =6.28318530717959\ldots$ $\tau =\mathrm {1T0.10TT0T1100T110TT0T1TT000001} \ldots$ $\pi =3.14159265358979\ldots$ $\pi =\mathrm {10.011T111T000T011T1101T111111} \ldots$ $e=2.71828182845905\ldots$ $e=\mathrm {10.T0111TT0T0T111T0111T000T11T} \ldots$ The balanced ternary expansions of $\pi$ is given in OEIS as A331313, that of $e$ in A331990.

## 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,
0213 + 113 = 1023, 1023 − 113 = 1T1bal3 = 710.
• If a 2 is present in ternary, turn it into 1T. For example,
02123 = 0010bal3 + 1T00bal3 + 001Tbal3 = 10TTbal3 = 2310
Balanced Logic Unsigned
1 True 2
0 Unknown 1
T False 0

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 {3^{n}}{2}}\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 x + yb 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.

## Conversion to balanced ternary from any integer base

We may convert to balanced ternary with the following formula:

$\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,

anan−1...a1a0.c1c2c3... is the original representation in the original numeral system.
b is the original radix. b is 10 if converting from decimal.
ak and ck are the digits k places to the left and right of the radix point respectively.

For instance,

 −25.410 = −(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


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

+ 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  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.510 = 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)^{\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:

$(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 32 = 1.25992110 = 1.1T1 000 111 001 T01 00T 1T1 T10 111bal3.

## 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 _{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 (6010 = 1T1T0bal3) 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¤ (710 = 1T1bal3), 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.