Home » » About Binary Digits

About Binary Digits

 A Binary Digit can only be 0 or 1


In the Computer World "binary digit" is often reduced to the phrase "bit"
More Than One Digit
So, there are only two methods we can have a binary variety ("0" and "1", or "On" and "Off") ... but what about 2 or more binary digits?
Let's create them all down, beginning with 1 variety (you can analyze it yourself using the switches):
2 methods to have one variety ...
    0
1

... 4 methods to have two figures ...
    0    0    →    00
    1    →    01
1    0    →    10
    1    →    11



... 8 methods to have three figures ...
    0    0    0    →    000
        1    →    001
    1    0    →    010
        1    →    011
1    0    0    →    100
        1    →    101
    1    0    →    110
        1    →    111

... and 16 methods to have four figures.
    0    0    0    0    →    0000
            1    →    0001
        1    0    →    0010
            1    →    0011
    1    0    0    →    0100
            1    →    0101
        1    0    →    0110
            1    →    0111
1    0    0    0    →    1000
            1    →    1001
        1    0    →    1010
            1    →    1011
    1    0    0    →    1100
            1    →    1101
        1    0    →    1110
            1    →    1111

And, actually, we have designed the first 16 binary numbers:
Decimal:    0    1    2    3    4    5    6    7    8    9    10    11    12    13    14    15
Binary:    0    1    10    11    100    101    110    111    1000    1001    1010    1011    1100    1101    1110    1111
This is useful! To keep in mind the series of binary figures just think:
•    "0" and "1" {0,1}
•    then do it again "0" and "1" again but with a "1" in front: {0,1,10,11}
•    then do it again those four with "1"s as a third digit: {0,1,10,11,100,101,110,111}
•    and so on!
(It is also how we depend using decimal figures, but we then also use 2, 3 , 4, 5, 6, 7, 8 or 9.)
Now discover out how to use Binary to depend previous 1,000 on your fingers:
Activity: Binary Fingers
     Also have a Perform with 4 different percussion.

Binary Digits ... They Double!
Also observe that everytime we add another binary variety we dual the opportunities.
Why double? Because we to take all previous periods possible roles and coordinate them with a "0" and a "1" like above.
•    So just one binary variety has 2 possible positions
•    Two binary figures have 4 possible positions
•    Three have 8 possible positions
•    Four have 16 possible positions
•    Five have 32 possible roles
•    Six have 64 possible positions
•    etc.
Using exponents, this can be proven as:
No of Digits    Formula    Settings
1    21    2
2    22    4
3    23    8
4    24    16
5    25    32
6    26    64
etc...    etc...    etc...
Example: when you have 50 binary figures (or even 50 factors that can only have two roles each), how many different methods is that?
Answer 250 = 2 × 2 × 2 × 2 ... (fifty of these) = 1,125,899,906,842,624
So, a binary variety with 50 figures could have 1,125,899,906,842,624 different principles.
Or to put it another way, it could display a variety up to 1,125,899,906,842,623 (note: this is one less than the depend of principles, because one of the is 0).
Chess Board

There is an old Native indian tale about a Master who was pushed to a sport of poker by a going to Sage. The Master requested "what will be the award if you win?".
The Sage said he would basically like some feed of rice: one on the first rectangle, 2 on the second, 4 on the third and so on, increasing on each rectangle. The Master was amazed by this modest demand.
Well, the Sage won, so how many feed of feed should he receive?
On the first square: 1 feed, on the second square: 2 feed (for a complete of 3) and so on like this:
Square    Grains    Total
1    1    1
2    2    3
3    4    7
4    8    15
       
10    512    1,027
       
20    524,288    1,048,575
       
30    53,6870,912    1,073,741,823
       
64    ???    ???
By the 30 rectangle you can see it is already a lot of rice! A billion dollars feed of feed is about 25 loads (1,000 feed is about 25g ... I considered some!)
Notice that the Total of any rectangle is 1 less than the Grains on the next rectangle (Example: rectangle 3's complete is 7, and rectangle 4 has 8 grains). So the complete of all pieces is a formula: 2n−1, where n is the variety of the rectangle. For example, for rectangle 3, the complete is 23−1 = 8−1 = 7
So, to complete all 64 pieces in a poker panel would need:
264−1 = 18,446,744,073,709,551,615 feed (460 billion dollars loads of rice),
many periods more feed than in the whole empire.
So, the energy of binary increasing is nothing to be taken gently (460 billion dollars loads is not light!)
(By the way, in the tale the Sage shows himself to be Master Krishna and informs the Master that he does not have to pay the debts instantly but can pay him eventually, just provide feed to pilgrims every day until the financial debts are compensated off.)
Hexadecimal
Lastly, I would like to tell you about the unique connection between Binary and Hexadecimal.
There are 16 Hexadecimal figures, and we already know that 4 binary figures have 16 possible principles. Well, this is exactly how they correspond with each other:
Binary:    0    1    10    11    100    101    110    111    1000    1001    1010    1011    1100    1101    1110    1111
Hexadecimal:    0    1    2    3    4    5    6    7    8    9    A    B    C    D    E    F
So, when individuals use pc systems (which choose binary numbers), it is a lot simpler to use the individual hexadecimal variety rather than 4 binary figures.
For example, the binary variety "100110110100" is "9B4" in hexadecimal. I know which I would want to write!


0 comments:

Post a Comment

Blog Archive