Sistem panomeran bineri, atawa sistem angka basis-2, mangrupa sistem panomeran anu narjamahkeun harga-harga angka kana dua simbul, biasana 0 jeung 1. Lantaran palaksanaannana anu gampang dina rangkean elektronik, sistem bineri digunakeun dina sakabéh kompiyuter modérn. Contona, dina kompiyuter digunakeun sistem panomeran bineri ASCII anu ngodekeun aksara "a" jadi "01100001", "i" jadi "01101001", "d" jadi "01100100", "e" jadi "01100101", "k" jadi "01101011", "p" jadi "01110000", sarta "w" jadi "01010111". dumasar kana kode ASCII kasebut, kecap "wikipedia" ditulis dina sistem panomeran salaku "010101110110100101101011011010010111000001100101011001000110100101100001"

Sajarah 
The ancient Indian mathematician Pingala presented the first known description of a binary numeral system between the 8th and 4th centuries BC, written in Hindu numerals. The numeration system was based on the Eye of Horus Old Kingdom numeration system.

A full set of 8 trigrams and 64 hexagrams, analogous to the 3-bit and 6-bit binary numerals, were known to the ancient Chinese in the classic text I Ching. Similar sets of binary combinations have also been used in 
traditional African divination systems such as Ifá as well as in medieval Western geomancy.

An ordered binary arrangement of the hexagrams of the I Ching, representing the decimal sequence from 0 to 63, and a method for generating the same, was developed by the Chinese scholar and philosopher Shao Yong in the 11th century. However, there is no evidence that Shao understood binary computation.

In 1605 Francis Bacon discussed a system by which 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. Importantly for the general théory of binary encoding, he added that this method could be used with any objects at all: "provided those objects be capable of a twofold difference only; as by Bells, by Trumpets, by Lights and Torches, by the report of Muskets, and any instruments of like nature." (See Bacon's cipher.)

The modérn binary number system was fully documented by Gottfried Leibniz in the 17th century in his article Explication de l'Arithmétique Binaire. Leibniz's system used 0 and 1, like the modérn binary numeral system.

In 1854, British mathematician George Boole published a landmark paper detailing a system of logic that would become known as Boolean algebra. His logical system proved instrumental in the development of the binary system, particularly in its implementation in 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 of 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 thus authorized a full reséarch program in late 1938 with Stibitz at the helm.  Their Complex Number Computer, completed January 8, 1940, was able to  calculate complex numbers.  In a demonstration to the American Mathematical Society conference at Dartmouth College on September 11, 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.

Representation 

A binary number can be represented by any sequence of bits (binary digits), which in turn may be represented by any mechanism capable of being in two mutually exclusive states. The following sequences of symbols could all be interpreted as the same binary numeric value of 667:

 1 0 1 0 0 1 1 0 1 1
 | - | - - | | - | |
 x o x o o x x o x x
 y n y n n y y n y y

The numeric value represented in éach case is dependent upon the value assigned to éach symbol. In a 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 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 in order to indicate their base, or radix. The following notations are equivalent:

100101 binary (explicit statement of format)
100101b (a suffix indicating binary format)
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)
0b100101 (a prefix indicating binary format, common in programming languages)

When spoken, binary numerals are usually pronounced by pronouncing éach individual digit, in order to distinguish them from decimal numbers. For example, the binary numeral "100" is pronounced "one zero zero", rather than "one hundred", to maké its binary nature explicit, and for purposes of correctness. Since the binary numeral "100" is equal to the decimal value four, it would be confusing, and numerically incorrect, to refer to the numeral as "one hundred" so to spéak.

Counting in binary 

Counting in binary is similar to counting in any other number system. Beginning with a single digit, counting proceeds through éach symbol, in incréasing order. Decimal counting uses the symbols 0 through 9, while binary only uses the symbols 0 and 1.

When the symbols for the first digit are exhausted, the next-higher digit (to the left) is incremented, and counting starts over at 0. In decimal, counting proceeds like so:

000, 001, 002, ... 007, 008, 009, (rightmost digit starts over, and next digit is incremented)
010, 011, 012, ... 
   ...
090, 091, 092, ... 097, 098, 099, (rightmost two digits start over, and next digit is incremented)
100, 101, 102, ...

After a digit réaches 9, an increment resets it to 0 but also causes an increment of the next digit to the left. In binary, counting is the same except that only the two symbols 0 and 1 are used. Thus after a digit réaches 1 in binary, an increment resets it to 0 but also causes an increment of the next digit to the left:

000, 001, (rightmost digit starts over, and next digit is incremented)
010, 011, (rightmost two digits start over, and next digit is incremented)
100, 101, ...

Binary simplified 
One can think about binary by comparing it with our usual numbers. We use a base ten system.  This méans that the value of éach position in a numerical value can be represented by one of ten possible symbols:  0, 1, 2, 3, 4, 5, 6, 7, 8, or 9.   We are all familiar with these and how the decimal system works using these ten symbols.  When we begin counting values, we should start with the symbol 0, and proceed to 9 when counting.  We call this the "ones", or "units" place.

The "ones" place, with those digits, might be thought of as a multiplication problem.  5 can be thought of as 5 × 100 (10 to the zeroeth power, which equals 5 × 1, since any nonzero number to the zero power is one). As we move to the left of the ones place, we incréase the power of 10 by one.  Thus, to represent 50 in this same manner, it can be thought of as 5 × 101, or 5 × 10.

When we run out of symbols in the decimal numeral system, we "move to the left" one place and use a "1" to represent the "tens" place.  Then we reset the symbol in the "ones" place back to the first symbol, zero.

Binary is a base two system which works just like our decimal system, however with only two symbols which can be used to represent numerical values:  0 and 1.  We begin in the "ones" place with 0, then go up to 1.  Now we are out of symbols, so to represent a higher value, we must place a "1" in the "twos" place, since we don't have a symbol we can use in the binary system for 2, like we do in the decimal system.

In the binary numeral system, the value represented as 10 is (1 × 21) + (0 × 20).  Thus, it equals "2" in our decimal system.

Binary-to-decimal equivalence:

To see the actual algorithm used in computing the conversion, see the conversion guide below.

Here is another way of thinking about it:  When you run out of symbols, for example 11111, add a "1" on the left end and reset all the numerals on the right to "0", producing 100000.  This also works for symbols in the middle.  Say the number is 100111.  If you add one to it, you move the leftmost repéating "1" one space to the left (from the "fours" place to the "eights" place) and reset all the numerals on the right to "0", producing 101000.

Binary arithmetic 

Arithmetic in binary is much like arithmetic in other numeral systems. Addition, subtraction, multiplication, and division can be performed on binary numerals.

Addition 

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple:

0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10 (carry:1)
Adding two "1" values produces the value "10" (spoken as "one-zero"), equivalent to the decimal value 2. 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 = 10
7 + 9 = 16

This is known as carrying in most numeral systems. When the result of an addition exceeds the value of the radix, the procedure is to "carry the one" to the left, adding it to the next positional value. Carrying works the same way in binary:

   1 1 1 1 1  (carried digits)
     0 1 1 0 1
 +   1 0 1 1 1
 -------------
 = 1 0 0 1 0 0

In this example, two numerals are being added together: 011012 (13 decimal) and 101112 (23 decimal). 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 (36 decimal).

When computers must add two numbers, the rule that:
x ^ y = x + y % 2
for any two bits x and y allows for very fast calculation, as well.

Subtraction 

Subtraction works in much the same way:

0 − 0 = 0
0 − 1 = 1 (with borrow)
1 − 0 = 1
1 − 1 = 0

One binary numeral can be subtracted from another as follows:

     *   * * *   (starred columns are borrowed from)
   1 1 0 1 1 1 0
 −     1 0 1 1 1
 ----------------
 = 1 0 1 0 1 1 1

Subtracting a positive number is equivalent to adding a negative number of equal absolute value; computers typically use two's complement notation to represent negative values. This notation eliminates the need for a separate "subtract" operation. The subtraction can be summarized with this formula:

A - B = A + not B + 1

For further details, see two's complement.

Multiplication 

Multiplication in binary is similar to its decimal counterpart. Two numbers A and B can be multiplied by partial products: for éach digit in B, the product of that digit in A is calculated and written on a new line, shifted leftward so that its rightmost digit lines up with the digit in B 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 éach partial multiplication:

 If the digit in B is 0, the partial product is also 0
 If the digit in B is 1, the partial product is equal to A

For example, the binary numbers 1011 and 1010 are multiplied as follows:

            1 0 1 1   (A)
          × 1 0 1 0   (B)
          ---------
            0 0 0 0   ← Corresponds to a zero in B
    +     1 0 1 1     ← Corresponds to a one in B
    +   0 0 0 0  
    + 1 0 1 1  
    ---------------
    = 1 1 0 1 1 1 0

See also Booth's multiplication algorithm.

Division 

Binary division is again similar to its decimal counterpart:

         __
 1 0 1  | 1 1 0 1 1

Here, the divisor is 1012, or 5 decimal, while the dividend is 110112, or 27 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 1 1

The procedure is then repéated 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
          -----
            0 1 1
          − 0 0 0
            -----
              1 1 1
            − 1 0 1
              -----
                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, 27 divided by 5 is 5, with a remainder of 2.

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 convert from a base-10 integer numeral to its base-2 (binary) equivalent, the number is divided by two, and the remainder is the least-significant bit. The (integer) result is again divided by two, its remainder is the next most significant bit. This process repéats until the result of further division becomes zero.

For example, 11810, in binary, is:

{| class="wikitable"
!Operation!!Remainder
|-
|118 ÷ 2 = 59 ||align="center"|0
|-
|59 ÷ 2 = 29  ||align="center"|1
|-
|29 ÷ 2 = 14  ||align="center"|1
|-
|14 ÷ 2 = 7   ||align="center"|0
|-
|7 ÷ 2 = 3    ||align="center"|1
|-
|3 ÷ 2 = 1    ||align="center"|1
|-
|1 ÷ 2 = 0    ||align="center"|1
|}

réading the sequence of remainders from the bottom up gives the binary numeral .

This method works for conversion from any base, but there are better methods for bases which are powers of two, such as octal and hexadecimal given below.

To convert from base-2 to base-10 is the reverse algorithm. Starting from the left, double the result and add the next digit until there are no more. For example to convert 1100101011012 to decimal:

{| class="wikitable"
!Result!!Remaining digits
|-
|0||align="right"|110010101101
|-
|0 × 2 + 1 = 1||align="right"|10010101101
|-
|1 × 2 + 1 = 3||align="right"|0010101101
|-
|3 × 2 + 0 = 6||align="right"|010101101
|-
|6 × 2 + 0 = 12||align="right"|10101101
|-
|12 × 2 + 1 = 25||align="right"|0101101
|-
|25 × 2 + 0 = 50||align="right"|101101
|-
|50 × 2 + 1 = 101||align="right"|01101
|-
|101 × 2 + 0 = 202||align="right"|1101
|-
|202 × 2 + 1 = 405||align="right"|101
|-
|405 × 2 + 1 = 811||align="right"|01
|-
|811 × 2 + 0 = 1622||align="right"|1
|-
|1622 × 2 + 1 = 3245||align="right"| 
|}

The result is 324510.

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 .110101101012, the first digit is , the second , etc. So if there is a 1 in the first place after the decimal, then the number is at léast , and vice versa. Double that number is at léast 1. This suggests the algorithm: Repéatedly double the number to be converted, record if the result is at léast 1, and then throw away the integer part.

For example, 10, in binary, is:

{| class="wikitable"
!Converting!!Result
|-
| || 0.
|-
| || 0.0
|-
| || 0.01
|-
| || 0.010
|-
| || 0.0101
|}

Thus the repéating decimal fraction 0.... is equivalent to the repéating binary fraction 0.... .

Or for example, 0.110, in binary, is:

{| class="wikitable"
! Converting                !! Result
|-
|          0.1        || 0.
|-
|0.1 × 2 = 0.2 < 1    || 0.0
|-
|0.2 × 2 = 0.4 < 1    || 0.00
|-
|0.4 × 2 = 0.8 < 1    || 0.000
|-
|0.8 × 2 = 1.6 ≥ 1 || 0.0001
|-
|0.6 × 2 = 1.2 ≥ 1 || 0.00011
|-
|0.2 × 2 = 0.4 < 1    || 0.000110
|-
|0.4 × 2 = 0.8 < 1    || 0.0001100
|-
|0.8 × 2 = 1.6 ≥ 1 || 0.00011001
|-
|0.6 × 2 = 1.2 ≥ 1 || 0.000110011
|-
|0.2 × 2 = 0.4 < 1    || 0.0001100110
|}

This is also a repéating binary fraction 0.00011... .  It may come as a surprise that terminating decimal fractions can have repéating expansions in binary. It is for this réason that many are surprised to discover that 0.1 + ... + 0.1, (10 additions) differs from 1 in 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 repéating 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:

{|
|                   ||align="right"|= ||align="right"|1100      ||align="left"|.1011100...
|-
|        ||align="right"|= ||align="right"|1100101110||align="left"|.01110...
|-
|          ||align="right"|= ||align="right"|11001     ||align="left"|.01110...
|-
|  ||align="right"|= ||align="right"|1100010101
|-
|-
|                   ||align="right"|= ||align="right"|(789/62)10
|}

Another way of converting from binary to decimal, often quicker for a person familiar with hexadecimal, is to do so indirectly—first converting ( in binary) into ( in hexadecimal) and then converting ( in hexadecimal) into ( 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, we divide by 10k, where k is chosen so that the quotient roughly equals the remainder, then éach of these pieces is converted to decimal and the two are concatenated. Given a decimal number, we split it into two pieces of about the same size, convert éach to binary, then multiply the first piece by 10k and add them, where k is the number of digits in the léast-significant (rightmost) piece.

Hexadecimal 

Binary may be converted to and from hexadecimal somewhat more éasily. This is due to the fact that 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.

The following table shows éach hexadecimal digit along with the equivalent decimal value and four-digit binary sequence:

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 isn't a multiple of four, simply insert extra 0 bits at the left (called padding). For example:

010100102 = 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 éach 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 éasily 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.

{| class="wikitable"
!Octal!!Binary
|-align=center
| 0 || 000
|-align=center
| 1 || 001
|-align=center
| 2 || 010
|-align=center
| 3 || 011
|-align=center
| 4 || 100
|-align=center
| 5 || 101
|-align=center
| 6 || 110
|-align=center
| 7 || 111
|}

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 méans of a radix point (called a decimal point in the decimal system). For example, the binary number 11.012 thus méans:

{|
|1 × 21  || (1 × 2 = 2)           || plus
|-
|1 × 20  || (1 × 1 = 1)           || plus
|-
|0 × 2−1 || (0 × ½ = 0)    || plus
|-
|1 × 2−2 || (1 × ¼ = 0.25)
|}

For a total of 3.25 decimal.

All dyadic rational numbers  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 instéad of terminating, they recur, with a finite sequence of digits repéating indefinitely.  For instance

 =  = 0.01010101...2

 =  = 0.10110100 10110100 ...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 which 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 , the square root of 2, another irrational.  It has no discernible pattern, although a proof that  is irrational requires more than this. See irrational number.

References

See also
Two's complement
Finger binary
Binary-coded decimal
 reflected binary code, also known as Gray code
 linear feedback shift register
 Asymmetric binary system

Tumbu luar 

 BinaryMath.info - arithmetic examples and conversion methods
 Introduction to Binary Numbers
 A brief overview of Leibniz and the connection to binary numbers
 Simple Conversion Methods
 Binary System at cut-the-knot
 Conversion of Fractions at cut-the-knot
 Binary Digits at Math Is Fun
 How to Convert from Decimal to Binary at wikiHow
 Binary numbers conversion software Software for conversion of Numbers from Binary to other number systems and vice versa.
 Binary and Hexadecimal Tutorial 
 Binary & ASCII conversions 

Aritmatika komputer
Aritmatika dasar
 2