# Trinary

Like computers, human thought is naught but electric signals. I posited to Random_Tangent that humans (and the world as we experience it) is binary, and that God is the 1 state.

He rebutted quite deliciously that humans are at least ternary systems (alternately referred to as trinary).

Things got a little nutty from there.

Trinary is base 3. Lucky number seven is written in base 10 as **7**, in base 2 (binary) as **111**, and in base 3 as **21**.

Explained in the deliciously readable article Third Base in *Scientific American*, base 3 is actually the most efficient base available to us, because it is closest to *e*.

The cultural preference for base 10 and the engineering advantages of base 2 have nothing to do with any intrinsic properties of the decimal and binary numbering systems. Base 3, on the other hand, does have a genuine mathematical distinction in its favor. By one plausible measure, it is the most efficient of all integer bases; it offers the most economical way of representing numbers.

How do you measure the cost of a numeric representation? If you simply count digits, then the biggest base will always win; for example, base 1,000,000 can represent any number between 0 and decimal 999,999 in a single digit. The trouble is, that single digit can be any of a million different symbols, all of which you must somehow recognize. At the opposite pole are unary, or base-1, numbers. The unary representation of decimal 1,000,000 needs only one type of symbol, but that symbol is repeated a million times. (Unary notation is in a category apart from other bases—it’s not really a positional number system—but in the present context it serves as a useful limiting case.)

Among all possible ways of writing the numbers up to a million, neither base 1,000,000 nor base 1 seems ideal; as a matter of fact, you could hardly do worse than either of these choices. Minimizing the number of digits causes an explosion in the alphabet of symbols, and vice versa; when you squish down one factor, the other squirts out. Evidently we need to optimize some joint measure of a number’s width (how many digits it has) and its depth (how many different symbols can occupy each digit position). An obvious strategy is to minimize the product of these two quantities. In other words, if r is the radix and w is the width in digits, we want to minimize rw while holding rw constant.

Curiously, this problem is easier to solve if r and w are treated as continuous rather than integer variables—that is, if we allow a fractional base and a fractional number of digits. Then it turns out (see Figure 1) that the optimum radix is e, the base of the natural logarithms, with a numerical value of about 2.718. Because 3 is the integer closest to e, it is almost always the most economical integer radix (see Figure 2).

Consider again the task of representing all numbers from 0 through decimal 999,999. In base 10 this obviously requires a width of six digits, so that rw = 60. Binary does better: 20 binary digits suffice to cover the same range of numbers, for rw = 40. But ternary is better still: The ternary representation has a width of 13 digits, so that rw = 39. (If base e were a practical choice, the width would be 14 digits, yielding rw=38.056.)

Whether this efficiency of 3 reflects an efficiency with regard to personal computing is undetermined. But in terms of other logic systems it is TOTALLY WICKED.

Read the article’s explanation of balanced ternary numbers and TRY NOT TO PEE.