Binary number through each symbol, in increasing order. Before examining binary counting, it is useful to briefly discuss the more familiar decimal counting system as a frame of reference. Decimal counting uses the ten symbols "0" through "9". Counting begins with the incremental substitution of the least significant digit (rightmost digit) which is often called the "first digit". When the available symbols for this position are exhausted, the least significant digit is reset to "0", and the next digit of higher significance (one position to the left) is incremented ("overflow"), and incremental substitution of the low-order digit resumes. This method of reset
Binary logarithm and ISO 80000-2), and (with a prior statement that the default base is 2) . Historically, the first application of binary logarithms was in music theory, by Leonhard Euler: the binary logarithm of a frequency ratio of two musical tones gives the number of octaves by which the tones differ. Binary logarithms can be used to calculate the length of the representation of a number in the binary numeral system, or the number of bits needed to encode a message in information theory. In computer science, they count the number of steps needed for binary search and related algorithms. Other