Persistence of a number assumed. The single-digit final state reached in the process of calculating an integer's additive persistence is its digital root. Put another way, a number's additive persistence counts how many times we must sum its digits to arrive at its digital root. The additive persistence of 2718 is 2: first we find that 2 + 7 + 1 + 8 = 18, and then that 1 + 8 = 9. The multiplicative persistence of 39 is 3, because it takes three steps to reduce 39 to a single digit: 39 → 27 → 14 → 4. Also, 39 is the smallest
Numerical digit 0 and –1. Balanced ternary turns out to have some useful properties and the system has been used in the experimental Russian Setun computers. Several authors in the last 300 years have noted a facility of positional notation that amounts to a "modified" decimal representation. Some advantages are cited for use of numerical digits that represent negative values. In 1840 Augustin-Louis Cauchy advocated use of signed-digit representation of numbers, and in 1928 Florian Cajori presented his collection of references for negative numerals. The concept of signed-digit representation has also been taken up in computer design. Despite the essential role of