Binary number 1197. Note that the first Prior Value of 0 is simply an initial decimal value. This method is an application of the Horner scheme. The fractional parts of a number are converted with similar methods. They are again based on the equivalence of shifting with doubling or halving. In a fractional binary number such as 0.11010110101, the first digit is formula_7, the second formula_8, etc. So if there is a 1 in the first place after the decimal, then the number is at least formula_7, and vice versa. Double that number is at least 1. This suggests the algorithm: Repeatedly
Binary number 5 is 5, with a remainder of 2. The process of taking a binary square root digit by digit is the same as for a decimal square root, and is explained here. An example is: Though not directly related to the numerical interpretation of binary symbols, sequences of bits may be manipulated using Boolean logical operators. When a string of binary symbols is manipulated in this way, it is called a bitwise operation; the logical operators AND, OR, and XOR may be performed on corresponding bits in two binary numerals provided as input. The logical NOT operation may be performed