Skew binary number system non-zero digits, a form called the sparse representations of numbers by Okasaki, incrementation and decrementation can be performed in constant time. Other arithmetic operations are performed by switching between the skew binary representation and the binary representation. Given a skew binary number, its value can be computed by a loop, computing the successive values of formula_4 and adding it once or twice for each formula_5 such that the formula_5th digit is 1 or 2 respectively. A more efficient method is now given, with only bit representation and one substraction. The skew binary number of the form formula_7 without 2 and
Binary number only two possible outcomes of each partial multiplication: For example, the binary numbers 1011 and 1010 are multiplied as follows: Binary numbers can also be multiplied with bits after a binary point: See also Booth's multiplication algorithm. The binary multiplication table is the same as the truth table of the logical conjunction operation formula_6. Long division in binary is again similar to its decimal counterpart. In the example below, the divisor is 101, or 5 decimal, while the dividend is 11011, or 27 decimal. The procedure is the same as that of decimal long division; here, the divisor 101 goes