Binary 1

Binary Code

Binary code is the most simplistic form of data. It is represented by a series of

consecutive zeros and ones. Binary code is often associated with machine code in that
binary sets can be combined to form raw code, which is interpreted by a computer or
other piece of hardware. Binary has had its origins from 4000 years ago. Gottfried
Leibniz- the man who made modern-day binary credits the invention of binary
numbers to Fu Xi, who he claims invented the "I Ching". The full power of Binary,
however, was finally unlocked by a man named "George Boole" in the 1800s when he
invented Boolean algebra which brought all the ideas together. Therefore creating
the binary we have today. This form of binary was created at 52.202614° N,
0.115244° E. Or as we now call it oxford university. He named the series of 1's and
zeros after himself calling it the boolean symbols. There were many forms of binary
and many different uses. Although the modern binary trend started by Gottfried
Leibniz used it as a series code.

How to Calculate Numerical Binary

When studying mathematics people often use a 10 base number system. 0, 1, 2, 3, 4,
5, 6, 7, 8, 9. However in Binary there are only 2 boolean symbols. 0 and 1, therefore a
wide variety of consistent numbers have to be used. The 10 base numerical system
uses place value by multiplying the numbers by 10, whereas in the base 2 system
(Binary) the place value increases by multiplying by 2. Numbers are presented by
either on (1) or off (0). From 2 to the power of zero to the highest value used, all need
to be represented as added in the calculation or not. If I were to calculate 5 it would
be written as 0101. This is because the values used were 4 and 1 not the rest so they
are displayed as 0. Furthermore they are read from right to left.

20 21 22 23 24 25 26 27 28 29

1 2 4 8 16 32 64 128 256 512

Steps to Calculate Binary

1. Calculate all the multiples of 2 to lead past the number of calculation

2. Find the highest value that is inbound with the number
 Binary 2

3. Deduct the highest value from your number and get a remainder
4. Find the highest value to fit the remainder
5. Deduct the highest value from the remainder
6. Continue with steps 3 - 5 to have all of your calculations in multiples of 2
7. Write the highest value that you used
8. Add a zero then 1 to start off - Zero is not necessary
9. Write from left to right if you are doing from high to low or vice versa
10. Write if you used all the other multiples of 2 in the process to find the best fit
11. If yes add 1 if not add 0

Examples

*Red means not used

Finding 38 in binary

38 - 32 = 6

38 - 32= 4 + 2

= 0100110

20 21 22 23 24 25

1 2 4 8 16 32

Finding 95 in binary

95 - 64 = 31 = 16 + 15 = 8 + 4 + 2 + 1

95 = 1 + 2 + 4 + 8 + 16 + 64
 Binary 3

= 1011111
It is read from right to left.

They all are broken down into powers of 2.

20 21 22 23 24 25 26

1 2 4 8 16 32 64

This process involves the same step although the layout is horizontal instead of
vertical.

Finding the binary code for 162

162 - 128 = 34 = 32 + 2

=10100010

20 21 22 23 24 25 26 27

1 2 4 8 16 32 64 128

Binary for 512

01000000000

512 is already a multiple of 2.

20 21 22 23 24 25 26 27 28 29

1 2 4 8 16 32 64 128 256 512

Different Calculations
In binary all number calculations are possible as they are just numbers formatted as
1&0. They use the same type of formatting as there is in base 10 calculations so it is
easy to get the hang of.
 Binary 4

Addition
56 + 43 = 99

56
+43
--------
99
This is a basic addition formula where the numbers are added on top of eachother
and added onto each other. Binary is quite similar in this process it uses the same
method and format of calculation but is limited to 1’s and 0’s.

The first step would be to convert the 10 base numbers into binary. If 1 & 1 are
together they make 2 but that is represented in binary as 10. So then the 0 will be
kept in place and the 1 will be carried like every 10 base equation that goes beyond 9.
Although if it is 1 & 0 then the numbers will make 1. If perchance the numbers go
beyond 2 they are represented using binary and the first digit on the right is
stationary while the rest of the number is carried.

56 - 32 = 24 -16 = 8
111000

43 - 32 = 11 - 8 = 3 = 2 + 1
101011

111000
+101011
-------------
1100011

In this case at the end a 3 was made so in binary a 3 is represented as 11. We can even
check our answer by adding up all the numbers that were used in the process.

64 + 32 + 0 + 0 + 0 + 2 + 1 = 99

Subtraction
 Binary 5

Subtraction in binary is layout in the same way as the 10 base number system
addition and subtraction.

56
- 43
-------
13
This is a standard setup where you get remainders and use the number on the left.
Just like in adding binary you format the numbers vertically and minus each place
value by its own. As well as that first of all you need to find the binary number for
both these numbers.

111000
- 101011
-------------
001101
There are a few generalistic rules to follow when subtracting
0-0=0
1-1=0
1-0=0
0-1=?
This will need a one to back up the number 0 and make it 10 which is 2 in base 10.
We can recheck our answers by adding all the place values up.

0 + 0 + 8 + 4 + 0 + 1 = 13

Multiplication
Multiplication in binary is the exact same format and steps. The procedures though
slightly differ at the addition bit it still represents the same answer.

56
X 43
---------
2408

Like all the other calculations the first step is to change the number into its binary
context. The rest of the steps are the exact same multiplication steps that you do in
base 10 calculations.

111000
X 101011
 Binary 6

----------------
111000
111000x
000000xx
111000xxx
000000xxxx
111000xxxxx
------------------
100101101000

There were many steps or procedures to this multiplication as the binary code has
more symbols to represent the same number compared to the 10 base system. This
calculation is very easy because the only times table there is to know is the 1’s times
table the rest is just addition which had been mentioned before in the report. We can
check our answer by adding up all of the place values.

8 + 32 + 64 + 256 + 2048 = 2408

Division
The process of binary division is similar to long division in the decimal system. The
dividend is still divided by the divisor in the same manner, with the only significant
difference being the use of binary rather than decimal subtraction.

69 ÷ 23 = 3

The first step which has been the first step in all of them is to convert your numbers
into binary.

1000101 ÷ 10111

In this calculation the divisor was large enough to occupy 5/7 of the dividend which
made lots of 0's. The process of elimination or carrying will support this to become
easier.

General Rules of Calculations in Binary (Base 2)

Addition- Addition has very simplistic rules that are similar to the decimal system.
These include 0+0=0,0+1=1, 1+0=1, 1+1=10. The last one means 1 + 1 = 2 so therefore
 Binary 7

2 is represented as 10. If you have any number more than 1 that will turn into a
remainder and will be carried for the next operation.

Subtraction- As mentioned before subtraction has very clear and certain rules 0 - 0
= 0, 1 - 1 = 0, 1 - 0 = 0, 0 - 1 = ? The last one would need a carry 1 to make the
number 2 as 10 s 2 to complete the equation other use it would be negative and that
would not work if you were doing binary.

Multiplication- The rules of multiplication in binary are exactly the same as the 10
base numerical system. You need to add a space on the right of each number you go
further down. Another rule would be that you have to multiply a single number at a
time not all in a clot with remainders. Lastly, you would have to add up all the
gathered data.

Division- The rules of division can vary to if you are doing short or long division.
Mostly you should add the number of times the number goes into the other number
in the form of the boolean symbols.