Combinatorial number system 601 and 1010001011 = 651, which again shows that "C" comes before "C"<nowiki>'</nowiki>. This number is not however the one one wants to represent the "k"-combination with, since many binary numbers have a number of raised bits different from "k"; one wants to find the relative position of "C" in the ordered list of (only) "k"-combinations. The number associated in the combinatorial number system of degree "k" to a "k"-combination "C" is the number of "k"-combinations strictly less than "C" in the given ordering. This number can be computed from "C" = { "c", ..., "c", "c" } with "c"
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