Difference between revisions of "Addition"
(→Binary Addition) |
(→Revision) |
||
Line 95: | Line 95: | ||
|| This is an overflow. | || This is an overflow. | ||
− | { | + | {What do you do when you have an overflow? |
|type="()"} | |type="()"} | ||
− | + | ||
-Add it anyway and then forget the overflow | -Add it anyway and then forget the overflow |
Revision as of 11:08, 15 November 2017
Binary Addition
Binary is being able to add two numbers together but are represented in binary form, which consist of 1s and 0s
There are for possibilities when adding binary numbers, these possibilities are:
a total of 0 (0+0) put down 0 a total of 1 (1+0, 0+1 or 0+0+carried 1) put down 1 a total of 2 (1+1) put down 0, carry 1 a total of 3 (1+1+ carried 1) put down 1, carry 1
For example, solve 6+7 using binary addition:
First convert 6 and 7 from denary to binary using your preferred method
6 = 4+2+0 = 110 7 = 4+2+1 = 111
Then add them keeping in mind the 4 possibilities and add each digit together, starting on the right:
110 + 111
So:
0+1 = 1
1+1 = 0 carry 1
1+1+ carried 1 = 1 carry 1
1 + 0 = 1
so 110+111 = 1101. Converting this number back to denary gives us an answer of 13.
You could get 3 numbers to add however you wont be given a situation in which there are more than a total of 3.
For example:
101
101
011+
Which would = 1101