Binary code The modern binary number system, the basis for binary code, was invented by Gottfried Leibniz in 1689 and appears in his article "Explication de l'Arithmétique Binaire". The full title is translated into English as the "Explanation of the binary arithmetic", which uses only the characters 1 and 0, with some remarks on its usefulness, and on the light it throws on the ancient Chinese figures of Fu Xi." (1703). Leibniz's system uses 0 and 1, like the modern binary numeral system. Leibniz encountered the "I Ching" through French Jesuit Joachim Bouvet and noted with fascination how its hexagrams correspond to
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