Skew binary number system must be the first non-zero least significant digit. In this case 15 is written canonically as 1000. Skew binary representations of the numbers from 0 to 15 are shown in following table: The advantage of skew binary is that each increment operation can be done with at most one carry operation. This exploits the fact that formula_3. Incrementing a skew binary number is done by setting the only two to a zero and incrementing the next digit from zero to one or one to two. When numbers are represented using a form of run-length encoding as linked lists of the
Skew binary number system with formula_8 1s is equal to the binary number formula_9 minus formula_8. Let formula_11 represents the digit formula_12 repeated formula_13 times. The skew binary number of the form formula_14 with formula_8 1s is equal to the binary number formula_16 minus formula_8. Similarly to the preceding section, the binary number formula_18 of the form formula_7 with formula_8 1s equals the skew binary number formula_21 plus formula_8. Note that since addition is not defined, adding formula_8 corresponds to incrementing the number formula_8 times. However, formula_8 is bounded by the logarithm of formula_18 and incrementation takes constant time. Hence transforming a binary number