Binary number

The modern binary number system was first studied in Europe in the 16th and 17th centuries by Thomas Harriot, and decades later by Gottfried Leibniz, who is credited for the invention. However, systems related to binary numbers have appeared earlier in multiple cultures including ancient Egypt, China, Europe and India, e.g. in relation to divination using binary lots. Egypt The scribes of ancient Egypt used two different systems for their fractions, Egyptian fractions (not related to the binary number system) and Horus-Eye fractions (so called because some historians of mathematics believed that the symbols used for this system could be arranged to form the eye of Horus, although this has been disputed). Horus-Eye fractions are a binary numbering system for fractional quantities of grain, liquids, or other measures, in which a fraction of a hekat is expressed as a sum of the binary fractions , , , , , and . Early forms of this system can be found in documents from the Fifth Dynasty of Egypt, approximately 2400 BC, and its fully developed hieroglyphic form dates to the Nineteenth Dynasty of Egypt, approximately 1200 BC. The method used for ancient Egyptian multiplication is also closely related to binary numbers. In this method, multiplying one number by a second is performed by a sequence of steps in which a value (initially the first of the two numbers) is either doubled or has the first number added back into it; the order in which these steps are to be performed is given by the binary representation of the second number. This method can be seen in use, for instance, in the Rhind Mathematical Papyrus, which dates to around 1650 BC. China The I Ching dates from the 9th century BC in China. The binary notation in the I Ching is used to interpret its quaternary technique of divination. Eight trigrams (Bagua) and a set of 64 hexagrams ("sixty-four" gua), analogous to the three-bit and six-bit binary numerals, were in use at least as early as the Zhou dynasty of ancient China. Viewing the least significant bit on top of single hexagrams in Shao Yong's square and reading along rows either from bottom right to top left with solid lines as 0 and broken lines as 1 or from top left to bottom right with solid lines as 1 and broken lines as 0 hexagrams can be interpreted as sequence from 0 to 63. Classical antiquity Etruscans divided the outer edge of divination livers into sixteen parts, each inscribed with the name of a divinity and its region of the sky. Each liver region produced a binary reading which was combined into a final binary for divination. Divination at Ancient Greek Dodona oracle worked by drawing from separate jars, questions tablets and "yes" and "no" pellets. The result was then combined to make a final prophecy. India The Indian scholar Pingala (c. 2nd century BC) developed a binary system for describing prosody. He described meters in the form of short and long syllables (the latter equal in length to two short syllables). They were known as laghu (light) and guru (heavy) syllables. Pingala's Hindu classic titled Chandaḥśāstra (8.23) describes the formation of a matrix in order to give a unique value to each meter. "Chandaḥśāstra" literally translates to science of meters in Sanskrit. The binary representations in Pingala's system increases towards the right, and not to the left like in the binary numbers of the modern positional notation. In Pingala's system, the numbers start from number one, and not zero. Four short syllables "0000" is the first pattern and corresponds to the value one. The numerical value is obtained by adding one to the sum of place values. West Africa The Ifá is a West African divination system popular among the Yoruba tribe of the Old Oyo Empire. Similar to the I Ching, but has up to 256 binary signs, unlike the I Ching which has 64. The number comes from squaring 16 which also matches the total possibilities in an 8-bit sequence. In Ifá divination, this reflects the possible outcomes called Odú. These Odú are determined using an Ọpẹlẹ chain, which has 8 seeds. Each seed can land in one of two positions (open or closed) creating all the possible combinations. The Ifá originated in 15th century West Africa among Yoruba people. In 2008, UNESCO added Ifá to its list of the "Masterpieces of the Oral and Intangible Heritage of Humanity". Other cultures The residents of the island of Mangareva in French Polynesia were using a hybrid binary-decimal system before 1450. Slit drums with binary tones are used to encode messages across Africa and Asia. Western predecessors to Leibniz In the late 13th century Ramon Llull had the ambition to account for all wisdom in every branch of human knowledge of the time. For that purpose he developed a general method or "Ars generalis" based on binary combinations of a number of simple basic principles or categories, for which he has been considered a predecessor of computing science and artificial intelligence. In 1605, Francis Bacon discussed a system whereby letters of the alphabet could be reduced to sequences of binary digits, which could then be encoded as scarcely visible variations in the font in any random text. In 1617, John Napier described a system he called location arithmetic for doing binary calculations using a non-positional representation by letters. Thomas Harriot investigated several positional numbering systems, including binary, but did not publish his results; they were found later among his papers. Possibly the first publication of the system in Europe was by Juan Caramuel y Lobkowitz, in 1700. Leibniz Leibniz wrote in excess of a hundred manuscripts on binary, most of them remaining unpublished. Before his first dedicated work in 1679, numerous manuscripts feature early attempts to explore binary concepts, including tables of numbers and basic calculations, often scribbled in the margins of works unrelated to mathematics. Leibniz's system uses 0 and 1, like the modern binary numeral system. An example of Leibniz's binary numeral system is as follows: Of this parallel invention, Leibniz wrote in his "Explanation Of Binary Arithmetic" that "this restitution of their meaning, after such a great interval of time, will seem all the more curious." The relation was a central idea to his universal concept of a language or characteristica universalis, a popular idea that would be followed closely by his successors such as Gottlob Frege and George Boole in forming modern symbolic logic. Leibniz was first introduced to the I Ching through his contact with the French Jesuit Joachim Bouvet, who visited China in 1685 as a missionary. Leibniz saw the I Ching hexagrams as an affirmation of the universality of his own religious beliefs as a Christian. Binary numerals were central to Leibniz's theology. He believed that binary numbers were symbolic of the Christian idea of creatio ex nihilo or creation out of nothing. Later developments In 1854, British mathematician George Boole published a landmark paper detailing an algebraic system of logic that would become known as Boolean algebra. His logical calculus was to become instrumental in the design of digital electronic circuitry. In 1937, Claude Shannon produced his master's thesis at MIT that implemented Boolean algebra and binary arithmetic using electronic relays and switches for the first time in history. Entitled A Symbolic Analysis of Relay and Switching Circuits, Shannon's thesis essentially founded practical digital circuit design. In November 1937, George Stibitz, then working at Bell Labs, completed a relay-based computer he dubbed the "Model K" (for "Kitchen", where he had assembled it), which calculated using binary addition. Bell Labs authorized a full research program in late 1938 with Stibitz at the helm. Their Complex Number Computer, completed 8 January 1940, was able to calculate complex numbers. In a demonstration to the American Mathematical Society conference at Dartmouth College on 11 September 1940, Stibitz was able to send the Complex Number Calculator remote commands over telephone lines by a teletype. It was the first computing machine ever used remotely over a phone line. Some participants of the conference who witnessed the demonstration were John von Neumann, John Mauchly and Norbert Wiener, who wrote about it in his memoirs. The Z1 computer, which was designed and built by Konrad Zuse between 1935 and 1938, used Boolean logic and binary floating-point numbers. ==Representation==

Any number can be represented by a sequence of bits (binary digits), which in turn may be represented by any mechanism capable of being in two mutually exclusive states. Any of the following rows of symbols can be interpreted as the binary numeric value of 667: might use LEDs to express binary values. In this clock, each column of LEDs shows a binary-coded decimal numeral of the traditional sexagesimal time. The numeric value represented in each case depends on the value assigned to each symbol. In the earlier days of computing, switches, punched holes, and punched paper tapes were used to represent binary values. In a modern computer, the numeric values may be represented by two different voltages; on a magnetic disk, magnetic polarities may be used. A "positive", "yes", or "on" state is not necessarily equivalent to the numerical value of one; it depends on the architecture in use. In keeping with the customary representation of numerals using Arabic numerals, binary numbers are commonly written using the symbols 0 and 1. When written, binary numerals are often subscripted, prefixed, or suffixed to indicate their base, or radix. The following notations are equivalent: • 100101 binary (explicit statement of format) • 100101b (a suffix indicating binary format; also known as Intel convention) • 100101B (a suffix indicating binary format) • bin 100101 (a prefix indicating binary format) • 1001012 (a subscript indicating base-2 (binary) notation) • %100101 (a prefix indicating binary format; also known as Motorola convention) • 0b100101 (a prefix indicating binary format, common in programming languages) • 6b100101 (a prefix indicating number of bits in binary format, common in programming languages) • #b100101 (a prefix indicating binary format, common in Lisp programming languages) When spoken, binary numerals are usually read digit-by-digit, to distinguish them from decimal numerals. For example, the binary numeral 100 is pronounced one zero zero, rather than one hundred, to make its binary nature explicit and for purposes of correctness. Since the binary numeral 100 represents the value four, it would be confusing to refer to the numeral as one hundred (a word that represents a completely different value, or amount). Alternatively, the binary numeral 100 can be read out as "four" (the correct value), but this does not make its binary nature explicit. ==Counting in binary==

Counting in binary is similar to counting in any other number system. Beginning with a single digit, counting proceeds 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 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 and overflow is repeated for each digit of significance. Counting progresses as follows: :000, 001, 002, ... 007, 008, 009, (rightmost digit is reset to zero, and the digit to its left is incremented) :010, 011, 012, ... :   ... :090, 091, 092, ... 097, 098, 099, (rightmost two digits are reset to zeroes, and next digit is incremented) :100, 101, 102, ... Binary counting Binary counting follows the exact same procedure, and again the incremental substitution begins with the least significant binary digit, or bit (the rightmost one, also called the first bit), except that only the two symbols 0 and 1 are available. Thus, after a bit reaches 1 in binary, an increment resets it to 0 but also causes an increment of the next bit to the left: :0000, :0001, (rightmost bit starts over, and the next bit is incremented) :0010, 0011, (rightmost two bits start over, and the next bit is incremented) :0100, 0101, 0110, 0111, (rightmost three bits start over, and the next bit is incremented) :1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111 ... In the binary system, each bit represents an increasing power of 2, with the rightmost bit representing 20, the next representing 21, then 22, and so on. The value of a binary number is the sum of the powers of 2 represented by each "1" bit. For example, the binary number 100101 is converted to decimal form as follows: :1001012 = [ ( 1 ) × 25 ] + [ ( 0 ) × 24 ] + [ ( 0 ) × 23 ] + [ ( 1 ) × 22 ] + [ ( 0 ) × 21 ] + [ ( 1 ) × 20 ] :1001012 = [ 1 × 32 ] + [ 0 × 16 ] + [ 0 × 8 ] + [ 1 × 4 ] + [ 0 × 2 ] + [ 1 × 1 ] :1001012 = 3710 ==Binary arithmetic==

Arithmetic in binary is much like arithmetic in other numeral systems using positional notation. Addition, subtraction, multiplication, and division can be performed on binary numerals. Addition for a binary half adder, which adds two bits together, producing sum and carry bits The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple, using a form of carrying: :0 + 0 → 0 :0 + 1 → 1 :1 + 0 → 1 :1 + 1 → 0, carry 1 (since 1 + 1 = 2 = 0 + (1 × 21) ) Adding two "1" digits produces a digit "0", while 1 will have to be added to the next column. This is similar to what happens in decimal when certain single-digit numbers are added together; if the result equals or exceeds the value of the radix (10), the digit to the left is incremented: :5 + 5 → 0, carry 1 (since 5 + 5 = 10 = 0 + (1 × 101) ) :7 + 9 → 6, carry 1 (since 7 + 9 = 16 = 6 + (1 × 101) ) This is known as carrying. When the result of an addition exceeds the value of a digit, the procedure is to "carry" the excess amount divided by the radix (that is, 10/10) to the left, adding it to the next positional value. This is correct since the next position has a weight that is higher by a factor equal to the radix. Carrying works the same way in binary: 0 1 1 0 1 + 1 0 1 1 1 ------------- = 1 0 0 1 0 0 = 36 In this example, two numerals are being added together: 011012 (1310) and 101112 (2310). The top row shows the carry bits used. Starting in the rightmost column, 1 + 1 = 102. The 1 is carried to the left, and the 0 is written at the bottom of the rightmost column. The second column from the right is added: 1 + 0 + 1 = 102 again; the 1 is carried, and 0 is written at the bottom. The third column: 1 + 1 + 1 = 112. This time, a 1 is carried, and a 1 is written in the bottom row. Proceeding like this gives the final answer 1001002 (3610). When computers must add two numbers, the rule that: x xor y = (x + y) mod 2 for any two bits x and y allows for very fast calculation, as well. Long carry method A simplification for many binary addition problems is the "long carry method" or "Brookhouse Method of Binary Addition". This method is particularly useful when one of the numbers contains a long stretch of ones. It is based on the simple premise that under the binary system, when given a stretch of digits composed entirely of ones (where is any integer length), adding 1 will result in the number 1 followed by a string of zeros. That concept follows, logically, just as in the decimal system, where adding 1 to a string of 9s will result in the number 1 followed by a string of 0s: Binary Decimal 1 1 1 1 1 likewise 9 9 9 9 9 + 1 + 1 ——————————— ——————————— 1 0 0 0 0 0 1 0 0 0 0 0 Such long strings are quite common in the binary system. From that one finds that large binary numbers can be added using two simple steps, without excessive carry operations. In the following example, two numerals are being added together: 1 1 1 0 1 1 1 1 1 02 (95810) and 1 0 1 0 1 1 0 0 1 12 (69110), using the traditional carry method on the left, and the long carry method on the right: Traditional Carry Method Long Carry Method vs. carry the 1 until it is one digit past the "string" below 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 cross out the "string", + 1 0 1 0 1 1 0 0 1 1 + 1 0 1 0 1 1 0 0 1 1 and cross out the digit that was added to it ——————————————————————— —————————————————————— = 1 1 0 0 1 1 1 0 0 0 1 1 1 0 0 1 1 1 0 0 0 1 The top row shows the carry bits used. Instead of the standard carry from one column to the next, the lowest-ordered "1" with a "1" in the corresponding place value beneath it may be added and a "1" may be carried to one digit past the end of the series. The "used" numbers must be crossed off, since they are already added. Other long strings may likewise be cancelled using the same technique. Then, simply add together any remaining digits normally. Proceeding in this manner gives the final answer of 1 1 0 0 1 1 1 0 0 0 12 (164910). In our simple example using small numbers, the traditional carry method required eight carry operations, yet the long carry method required only two, representing a substantial reduction of effort. Addition table The binary addition table is similar to, but not the same as, the truth table of the logical disjunction operation \lor. The difference is that 1 \lor 1 = 1, while 1+1=10. Subtraction Subtraction works in much the same way: :0 − 0 → 0 :0 − 1 → 1, borrow 1 :1 − 0 → 1 :1 − 1 → 0 Subtracting a "1" digit from a "0" digit produces the digit "1", while 1 will have to be subtracted from the next column. This is known as borrowing. The principle is the same as for carrying. When the result of a subtraction is less than 0, the least possible value of a digit, the procedure is to "borrow" the deficit divided by the radix (that is, 10/10) from the left, subtracting it from the next positional value. * * * * (starred columns are borrowed from) 1 1 0 1 1 1 0 − 1 0 1 1 1 ---------------- = 1 0 1 0 1 1 1 * (starred columns are borrowed from) 1 0 1 1 1 1 1 – 1 0 1 0 1 1 ---------------- = 0 1 1 0 1 0 0 Subtracting a positive number is equivalent to adding a negative number of equal absolute value. Computers use signed number representations to handle negative numbers—most commonly the two's complement notation. Such representations eliminate the need for a separate "subtract" operation. Using two's complement notation, subtraction can be summarized by the following formula: : Multiplication Multiplication in binary is similar to its decimal counterpart. Two numbers and can be multiplied by partial products: for each digit in , the product of that digit in is calculated and written on a new line, shifted leftward so that its rightmost digit lines up with the digit in that was used. The sum of all these partial products gives the final result. Since there are only two digits in binary, there are only two possible outcomes of each partial multiplication: • If the digit in is 0, the partial product is also 0 • If the digit in is 1, the partial product is equal to For example, the binary numbers 1011 and 1010 are multiplied as follows: 1 0 1 1 () × 1 0 1 0 () --------- 0 0 0 0 ← to the rightmost 'zero' in + 1 0 1 1 ← to the next 'one' in + 0 0 0 0 + 1 0 1 1 --------------- = 1 1 0 1 1 1 0 Binary numbers can also be multiplied with bits after a binary point: 1 0 1 . 1 0 1 (5.625 in decimal) × 1 1 0 . 0 1 (6.25 in decimal) ------------------- 1 . 0 1 1 0 1 ← to a 'one' in + 0 0 . 0 0 0 0 ← to a 'zero' in + 0 0 0 . 0 0 0 + 1 0 1 1 . 0 1 + 1 0 1 1 0 . 1 --------------------------- = 1 0 0 0 1 1 . 0 0 1 0 1 (35.15625 in decimal) See also Booth's multiplication algorithm. Multiplication table The binary multiplication table is the same as the truth table of the logical conjunction operation \land. Division Long division in binary is again similar to its decimal counterpart. In the example below, the divisor is 1012, or 5 in decimal, while the dividend is 110112, or 27 in decimal. The procedure is the same as that of decimal long division; here, the divisor 1012 goes into the first three digits 1102 of the dividend one time, so a "1" is written on the top line. This result is multiplied by the divisor, and subtracted from the first three digits of the dividend; the next digit (a "1") is included to obtain a new three-digit sequence: 1 ___________ 1 0 1 ) 1 1 0 1 1 − 1 0 1 ----- 0 0 1 The procedure is then repeated with the new sequence, continuing until the digits in the dividend have been exhausted: 1 0 1 ___________ 1 0 1 ) 1 1 0 1 1 − 1 0 1 ----- 1 1 1 − 1 0 1 ----- 0 1 0 Thus, the quotient of 110112 divided by 1012 is 1012, as shown on the top line, while the remainder, shown on the bottom line, is 102. In decimal, this corresponds to the fact that 27 divided by 5 is 5, with a remainder of 2. Aside from long division, one can also devise the procedure so as to allow for over-subtracting from the partial remainder at each iteration, thereby leading to alternative methods which are less systematic, but more flexible as a result. Square root The process of taking a binary square root digit by digit is essentially the same as for a decimal square root but much simpler, due to the binary nature. First group the digits in pairs, using a leading 0 if necessary so there are an even number of digits. Now at each step, consider the answer so far, extended with the digits 01. If this can be subtracted from the current remainder, do so. Then extend the remainder with the next pair of digits. If you subtracted, the next digit of the answer is 1, otherwise it's 0. 1 1 1 1 1 0 1 1 0 1 ------------- ------------- ------------- ------------- ------------- √ 10 10 10 01 √ 10 10 10 01 √ 10 10 10 01 √ 10 10 10 01 √ 10 10 10 01 - 1 - 1 - 1 - 1 Answer so far is 0, ---- ---- ---- ---- extended by 01 is 001, 1 10 1 10 1 10 1 10 this CAN be subtracted - 1 01 - 1 01 - 1 01 from first pair 10, Answer so far is 1, ------- ------- ------- so first digit of extended by 01 is 101, 1 10 1 10 01 1 10 01 answer is 1. this CAN be subtracted - 1 10 01 from remainder 110, so Answer so far is 11, Answer so far is 110, ---------- next answer digit is 1. extended by 01 is 1101, extended by 01 is 11001, 0 this is TOO BIG to this CAN be subtracted subtract from remainder from remainder 11001, so Done! 110, so next digit of next digit of answer is 1. answer is 0. ==Fractions==

In binary arithmetic, the binary expansion of a fraction terminates only if the denominator is a power of 2. As a result, 1/10 does not have a finite binary representation (10 has prime factors 2 and 5). This causes 10 × 1/10 not to precisely equal 1 in binary floating-point arithmetic. As an example, to the binary expansion of 1/3 is .010101..., which means that :\frac 13 = 0 \times 2^{-1} + 1 \times 2^{-2} + 0 \times 2^{-3} + 1 \times 2^{-4} + \cdots. An exact value cannot be found with a sum of a finite number of inverse powers of two, the zeros and ones in the binary representation of 1/3 alternate forever. ==Bitwise operations==

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 on individual bits in a single binary numeral provided as input. Sometimes, such operations may be used as arithmetic short-cuts, and may have other computational benefits as well. For example, an arithmetic shift left of a binary number is the equivalent of multiplication by a (positive, integral) power of 2. ==Conversion to and from other numeral systems==

Decimal to binary To convert from a base-10 integer to its base-2 (binary) equivalent, the number is divided by two. The remainder is the least-significant bit. The quotient is again divided by two; its remainder becomes the next least significant bit. This process repeats until a quotient of one is reached. The sequence of remainders (including the final quotient of one) forms the binary value, as each remainder must be either zero or one when dividing by two. For example, (357)10 is expressed as (101100101)2. Binary to decimal Conversion from base-2 to base-10 simply inverts the preceding algorithm. The bits of the binary number are used one by one, starting with the most significant (leftmost) bit. Beginning with the value 0, the prior value is doubled, and the next bit is then added to produce the next value. This can be organized in a multi-column table. For example, to convert 100101011012 to decimal: The result is 119710. 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.110101101012, the first digit is \frac{1}{2} , the second (\frac{1}{2})^2 = \frac{1}{4} , etc. So if there is a 1 in the first place after the decimal, then the number is at least \frac{1}{2} , and vice versa. Double that number is at least 1. This suggests the algorithm: Repeatedly double the number to be converted, record if the result is at least 1, and then throw away the integer part. For example, (\frac{1}{3})_{10} , in binary, is: Thus the repeating decimal fraction 0.... is equivalent to the repeating binary fraction 0.... . Or for example, 0.110, in binary, is: This is also a repeating binary fraction 0.0... . It may come as a surprise that terminating decimal fractions can have repeating expansions in binary. It is for this reason that many are surprised to discover that 1/10 + ... + 1/10 (addition of 10 numbers) differs from 1 in binary floating-point arithmetic. In fact, the only binary fractions with terminating expansions are of the form of an integer divided by a power of 2, which 1/10 is not. The final conversion is from binary to decimal fractions. The only difficulty arises with repeating fractions, but otherwise the method is to shift the fraction to an integer, convert it as above, and then divide by the appropriate power of two in the decimal base. For example: \begin{align} x & = & 1100&.1\overline{01110}\ldots \\ x\times 2^6 & = & 1100101110&.\overline{01110}\ldots \\ x\times 2 & = & 11001&.\overline{01110}\ldots \\ x\times(2^6-2) & = & 1100010101 \\ x & = & 1100010101/111110 \\ x & = & (789/62)_{10} \end{align} Another way of converting from binary to decimal, often quicker for a person familiar with hexadecimal, is to do so indirectly—first converting (x in binary) into (x in hexadecimal) and then converting (x in hexadecimal) into (x in decimal). For very large numbers, these simple methods are inefficient because they perform a large number of multiplications or divisions where one operand is very large. A simple divide-and-conquer algorithm is more effective asymptotically: given a binary number, it is divided by 10k, where k is chosen so that the quotient roughly equals the remainder; then each of these pieces is converted to decimal and the two are concatenated. Given a decimal number, it can be split into two pieces of about the same size, each of which is converted to binary, whereupon the first converted piece is multiplied by 10k and added to the second converted piece, where k is the number of decimal digits in the second, least-significant piece before conversion. Hexadecimal Binary may be converted to and from hexadecimal more easily. This is because the radix of the hexadecimal system (16) is a power of the radix of the binary system (2). More specifically, 16 = 24, so it takes four digits of binary to represent one digit of hexadecimal, as shown in the adjacent table. To convert a hexadecimal number into its binary equivalent, simply substitute the corresponding binary digits: :3A16 = 0011 10102 :E716 = 1110 01112 To convert a binary number into its hexadecimal equivalent, divide it into groups of four bits. If the number of bits is not a multiple of four, simply insert extra 0 bits at the left (called padding). For example: :10100102 = 0101 0010 grouped with padding = 5216 :110111012 = 1101 1101 grouped = DD16 To convert a hexadecimal number into its decimal equivalent, multiply the decimal equivalent of each hexadecimal digit by the corresponding power of 16 and add the resulting values: :C0E716 = (12 × 163) + (0 × 162) + (14 × 161) + (7 × 160) = (12 × 4096) + (0 × 256) + (14 × 16) + (7 × 1) = 49,38310 Octal Binary is also easily converted to the octal numeral system, since octal uses a radix of 8, which is a power of two (namely, 23, so it takes exactly three binary digits to represent an octal digit). The correspondence between octal and binary numerals is the same as for the first eight digits of hexadecimal in the table above. Binary 000 is equivalent to the octal digit 0, binary 111 is equivalent to octal 7, and so forth. Converting from octal to binary proceeds in the same fashion as it does for hexadecimal: :658 = 110 1012 :178 = 001 1112 And from binary to octal: :1011002 = 101 1002 grouped = 548 :100112 = 010 0112 grouped with padding = 238 And from octal to decimal: :658 = (6 × 81) + (5 × 80) = (6 × 8) + (5 × 1) = 5310 :1278 = (1 × 82) + (2 × 81) + (7 × 80) = (1 × 64) + (2 × 8) + (7 × 1) = 8710 ==Representing real numbers==

Non-integers can be represented by using negative powers, which are set off from the other digits by means of a radix point (called a decimal point in the decimal system). For example, the binary number 11.012 means: For a total of 3.25 decimal. All dyadic rational numbers \frac{p}{2^a} have a terminating binary numeral—the binary representation has a finite number of terms after the radix point. Other rational numbers have binary representation, but instead of terminating, they recur, with a finite sequence of digits repeating indefinitely. For instance \frac{1_{10}}{3_{10}} = \frac{1_2}{11_2} = 0.01010101\overline{01}\ldots\,_2 \frac{12_{10}}{17_{10}} = \frac{1100_2}{10001_2} = 0.10110100 10110100\overline{10110100}\ldots\,_2 The phenomenon that the binary representation of any rational is either terminating or recurring also occurs in other radix-based numeral systems. See, for instance, the explanation in decimal. Another similarity is the existence of alternative representations for any terminating representation, relying on the fact that 0.111111... is the sum of the geometric series 2−1 + 2−2 + 2−3 + ... which is 1. Binary numerals that neither terminate nor recur represent irrational numbers. For instance, • 0.10100100010000100000100... does have a pattern, but it is not a fixed-length recurring pattern, so the number is irrational • 1.0110101000001001111001100110011111110... is the binary representation of \sqrt{2}, the square root of 2, another irrational. It has no discernible pattern. ==See also==