Binary addition and subtraction are two of the most basic arithmetic operations used in computer science and digital electronics. Unlike the decimal number system, which uses ten digits from 0 to 9, the binary number system uses only two digits: 0 and 1. Since computers and digital devices process information using two basic states, binary arithmetic forms an important part of how computers represent and process numerical data.
Understanding binary addition and subtraction makes it easier to learn more advanced topics such as binary multiplication, Boolean logic, digital circuits, computer memory, processors, and data representation. The rules may look unfamiliar at first, but they are actually quite simple because there are only two possible digits.
In this article, we will learn the basic rules of binary addition and subtraction, understand carries and borrows, work through examples step by step, and see how these operations are used in computing.
What Is Binary Arithmetic?
Binary arithmetic is arithmetic performed using the binary number system, also called the base-2 number system. In binary, every number is represented using only 0 and 1.
For example:
Decimal 0 = Binary 0
Decimal 1 = Binary 1
Decimal 2 = Binary 10
Decimal 3 = Binary 11
Decimal 4 = Binary 100
Decimal 5 = Binary 101
Decimal 6 = Binary 110
Decimal 7 = Binary 111
Decimal 8 = Binary 1000
Each position in a binary number represents a power of 2.
For example:
1011₂
can be expanded as:
1 × 2³ + 0 × 2² + 1 × 2¹ + 1 × 2⁰
= 8 + 0 + 2 + 1
= 11₁₀
The subscript ₂ indicates that the number is binary, while the subscript ₁₀ indicates decimal notation.
Binary addition and subtraction follow rules similar to decimal arithmetic, but the calculations are based on only two digits.
Binary Addition
Binary addition means adding two binary numbers together. The process is similar to decimal addition: numbers are aligned according to their place values, and the calculation is performed from right to left.
The main difference is that binary has only 0 and 1. Therefore, whenever the result of adding two binary digits reaches 2, a carry is produced.
Basic Binary Addition Rules
There are four fundamental binary addition rules:
| A | B | Result |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 10 |
The first three rules are straightforward.
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
The fourth rule is especially important:
1 + 1 = 10₂
The result is not written as 2 because 2 is not a binary digit. Instead, decimal 2 is represented as 10₂.
This means:
Write 0 in the current position.
Carry 1 to the next position.
Therefore:
1 + 1 = 10
is the binary equivalent of decimal:
1 + 1 = 2
Binary Addition With a Carry
When adding binary numbers, a carry may move from one column to the next.
For example:
101 + 011
Write the numbers one below the other:
101
Start from the rightmost column.
Step 1: Rightmost column
1 + 1 = 10
Write 0 and carry 1.
Step 2: Middle column
Now add:
0 + 1 + 1 = 10
Write 0 and carry 1.
Step 3: Leftmost column
Add:
1 + 0 + 1 = 10
Write 0 and carry 1.
The final carry becomes the leftmost digit.
Therefore:
101
So:
101₂ + 011₂ = 1000₂
To check the answer in decimal:
101₂ = 5₁₀
011₂ = 3₁₀
5 + 3 = 8
1000₂ = 8₁₀
Therefore, the answer is correct.
Binary Addition Table With Carry
When a carry is already present, three binary digits may need to be added. The possible cases are:
| A | B | Carry-in | Sum | Carry-out |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
For example:
1 + 1 + 1 = 11₂
In decimal:
1 + 1 + 1 = 3
and decimal 3 is 11₂.
So, when all three inputs are 1, we write 1 and carry 1.
Example of Binary Addition
Consider:
1101
Start from the right.
Rightmost:
1 + 1 = 10
Write 0 and carry 1.
Next:
0 + 1 + 1 = 10
Write 0 and carry 1.
Next:
1 + 0 + 1 = 10
Write 0 and carry 1.
Leftmost:
1 + 1 + 1 = 11
Write 1 and carry 1.
Therefore:
1101
So:
1101₂ + 1011₂ = 11000₂
Checking in decimal:
1101₂ = 13₁₀
1011₂ = 11₁₀
13 + 11 = 24
11000₂ = 24₁₀
The result is correct.
What Is Binary Subtraction?
Binary subtraction is the process of subtracting one binary number from another. Like decimal subtraction, the calculation is normally performed from right to left.
The basic difference is that binary has only 0 and 1. When a larger digit needs to be subtracted from a smaller digit, we must borrow from the next position.
Basic Binary Subtraction Rules
There are four fundamental rules:
| A | B | Result |
|---|---|---|
| 0 | 0 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
| 0 | 1 | 1 with borrow |
The first three rules are simple:
0 − 0 = 0
1 − 0 = 1
1 − 1 = 0
The important case is:
0 − 1
Since 0 is smaller than 1, we cannot subtract 1 directly from 0. We must borrow from the next binary position.
In binary, borrowing 1 from the next position gives the current position a value of 10₂, which is equal to decimal 2.
Therefore:
10₂ − 1₂ = 1₂
This is similar to borrowing in decimal subtraction, but the value being borrowed is based on powers of 2.
Binary Subtraction With Borrowing
Consider:
101
Start from the rightmost column.
Step 1: Rightmost column
We have:
1 − 1 = 0
Step 2: Middle column
We have:
0 − 1
We need to borrow from the left.
The leftmost 1 gives one unit to the middle position. The middle position becomes 10₂.
Therefore:
10₂ − 1₂ = 1₂
The leftmost position is now 0.
Step 3: Leftmost column
We have:
0 − 0 = 0
Therefore:
101
So:
101₂ − 011₂ = 010₂
or simply:
101₂ − 11₂ = 10₂
In decimal:
5 − 3 = 2
and 2 is 10₂.
Another Binary Subtraction Example
Consider:
1101
Start from the right.
Rightmost:
1 − 1 = 0
Next:
0 − 0 = 0
Next:
1 − 1 = 0
Leftmost:
1 − 0 = 1
Therefore:
1101
So:
1101₂ − 0101₂ = 1000₂
In decimal:
13 − 5 = 8
and 8 is 1000₂.
Binary Subtraction With Multiple Borrows
Some subtraction problems require borrowing across more than one zero.
Consider:
1000
The rightmost digit requires:
0 − 1
But the next position is also 0, so we cannot borrow directly from it.
We must move left until we find a 1.
The leftmost 1 is borrowed and transferred through the zeros. After the borrowing process, the calculation becomes:
1000
Therefore:
1000₂ − 0001₂ = 0111₂
or:
1000₂ − 1₂ = 111₂
In decimal:
8 − 1 = 7
and 7 is 111₂.
This type of problem is important because it shows why careful handling of borrowing is necessary in binary subtraction.
Binary Addition vs Binary Subtraction
Binary addition and subtraction are closely related, but their rules are different.
| Feature | Binary Addition | Binary Subtraction |
|---|---|---|
| Basic operation | Adding binary values | Subtracting binary values |
| Main special process | Carrying | Borrowing |
| Important rule | 1 + 1 = 10 | 0 − 1 requires borrowing |
| Direction | Usually right to left | Usually right to left |
| Digits used | 0 and 1 | 0 and 1 |
In addition, a carry moves toward the left when the sum reaches 2 or more.
In subtraction, a borrow is taken from a higher position when the digit being subtracted is larger than the digit available in the current position.
Why Binary Addition and Subtraction Are Important
Binary arithmetic is fundamental to the operation of digital computers. Computers represent data internally using binary values because electronic circuits can conveniently represent two distinct states.
These states can be associated with:
0 and 1
Off and on
Low and high voltage
False and true
Processors perform enormous numbers of arithmetic operations every second. Binary addition is especially important because computer hardware can use binary adders to perform many other arithmetic operations.
Binary subtraction is also essential for calculations involving differences, comparisons, addresses, counters, and numerical processing.
Understanding these basic operations helps explain how arithmetic circuits inside processors work.
Binary Addition in Digital Circuits
Binary addition can be implemented using logic gates. Two important circuits are the half adder and full adder.
A half adder adds two binary digits and produces two outputs:
Sum
Carry
For example:
1 + 1
produces:
Sum = 0
Carry = 1
A full adder also considers a carry from a previous position. This allows several binary digits to be added together.
By connecting multiple full adders, digital systems can perform addition on larger binary numbers.
For example, a processor can use an arithmetic logic unit, commonly called an ALU, to perform binary arithmetic and logical operations.
Binary Subtraction Using Two’s Complement
Computers commonly perform subtraction using a method called two’s complement rather than relying only on the traditional borrowing method.
Two’s complement provides an efficient way for digital circuits to perform subtraction using addition hardware.
The general idea is:
A − B = A + two’s complement of B
For example, suppose we want to calculate:
7 − 3
Using four-bit binary:
7 = 0111
3 = 0011
The two’s complement of 0011 is obtained by:
- Inverting every bit:1100
- Adding 1:1101
Now add:
0111
Ignoring the extra carry outside the four-bit result gives:
0100
which is decimal 4.
Therefore:
7 − 3 = 4
This method is extremely important in computer systems because the same binary addition circuitry can be used to perform both addition and subtraction.
Common Mistakes in Binary Addition
Beginners often make a few common mistakes when working with binary numbers.
Treating 1 + 1 as 2
In binary:
1 + 1 = 10
not a single digit 2.
The result contains a 0 and a carry of 1.
Forgetting the Carry
When a carry is generated, it must be included in the next column.
For example:
1 + 1 + 1 = 11
Ignoring the carry produces an incorrect answer.
Misaligning the Numbers
Binary numbers should normally be aligned from the rightmost digit before performing addition or subtraction.
For example:
1011
The place values must line up correctly.
Forgetting a Borrow
During subtraction, a borrow changes the value of the position from which it is taken. It is important to update that position before continuing the calculation.
Common Mistakes in Binary Subtraction
One common mistake is treating:
0 − 1 = −1
as an ordinary binary digit operation. In standard unsigned binary subtraction, the correct approach is to borrow from the next position.
Another mistake is forgetting that borrowing from the next binary position gives the current position a value of 10₂, which represents decimal 2.
It is also easy to lose track of multiple borrows when several zeros occur in a row. Writing each step carefully makes the process much easier.
Quick Reference for Binary Arithmetic
Binary Addition
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10
With carry:
1 + 1 + 1 = 11
Binary Subtraction
0 − 0 = 0
1 − 0 = 1
1 − 1 = 0
0 − 1 = 1 with borrow
These simple rules form the foundation of binary arithmetic.
Final Thoughts
Binary addition and subtraction are fundamental operations in computer science and digital electronics. Although they initially look different from decimal arithmetic, their basic principles are straightforward. Binary addition mainly requires understanding carrying, while binary subtraction requires understanding borrowing.
The most important addition rule to remember is 1 + 1 = 10₂. For subtraction, the key idea is that when a 0 needs to subtract 1, we borrow from the next higher position, giving the current position a value of 10₂.
Once these rules become familiar, working with larger binary numbers becomes much easier. They also provide a strong foundation for understanding binary multiplication, division, two’s complement, logic circuits, digital electronics, computer processors, and the way computers perform arithmetic internally.
FAQs
1. What is binary addition?
Binary addition is the process of adding numbers represented in the binary number system. Unlike decimal numbers, which use digits from 0 to 9, binary numbers use only 0 and 1. The basic binary addition rules are 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, and 1 + 1 = 10. When 1 + 1 produces 10, the 0 is written in the current position and 1 is carried to the next position. Binary addition is fundamental to computer arithmetic because computers represent and process numerical information using binary values.
2. What are the basic rules of binary addition?
There are four basic rules of binary addition. They are 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, and 1 + 1 = 10. The last rule is particularly important because binary has only two digits. When two 1s are added, their decimal value is 2, which is represented as 10 in binary. Therefore, 0 is written in the current position and 1 is carried to the next position. These simple rules are repeatedly applied from right to left when adding larger binary numbers.
3. What is a carry in binary addition?
A carry in binary addition occurs when the sum in one position is too large to be represented by a single binary digit. The most common example is 1 + 1, which equals 10₂. In this situation, 0 is written in the current position and 1 is carried to the next position on the left. A carry can also occur when adding three binary digits, such as 1 + 1 + 1 = 11₂. Correctly transferring each carry to the next position is essential for obtaining an accurate binary addition result.
4. What is binary subtraction?
Binary subtraction is the process of subtracting one binary number from another. It follows principles similar to decimal subtraction but uses only the digits 0 and 1. The basic rules are 0 − 0 = 0, 1 − 0 = 1, and 1 − 1 = 0. When 0 − 1 occurs, borrowing is necessary because 0 is smaller than 1. The borrowed value is 10₂, which equals decimal 2. After borrowing, 10₂ − 1₂ = 1₂. Binary subtraction is widely used in computer arithmetic and digital electronic systems.
5. What are the basic rules of binary subtraction?
The four basic binary subtraction rules are 0 − 0 = 0, 1 − 0 = 1, 1 − 1 = 0, and 0 − 1 = 1 with a borrow. The first three rules can be performed directly. The final rule requires borrowing from the next higher binary position. When 1 is borrowed, the current position receives 10₂, which represents decimal 2. Therefore, 10₂ − 1₂ gives 1₂. Understanding these four rules makes it possible to perform subtraction on larger binary numbers using the same right-to-left process.
6. Why is borrowing required in binary subtraction?
Borrowing is required when the digit being subtracted is larger than the digit available in the current position. For example, in 0 − 1, the subtraction cannot be completed directly because 0 is smaller than 1. A value is therefore borrowed from the next higher position. In binary, borrowing one unit from that position gives the current position 10₂, which is equal to decimal 2. The calculation then becomes 10₂ − 1₂ = 1₂. This borrowing process allows binary subtraction to follow the same basic principle as ordinary decimal subtraction.
7. What is the result of 1 + 1 in binary?
The result of 1 + 1 in binary is 10₂. This can be understood by comparing binary with decimal notation. In decimal, 1 + 1 = 2. However, the binary number system has only two digits, 0 and 1, so the value 2 cannot be written as a single binary digit. Instead, decimal 2 is represented as 10₂. During binary addition, the 0 is written in the current position and 1 is carried to the next position. This rule is one of the most important concepts in binary arithmetic.
8. How do computers perform binary subtraction?
Computers commonly perform binary subtraction using a method called two’s complement. Instead of relying only on traditional borrowing, a computer can convert the number being subtracted into its two’s complement and then add it to the first number. The two’s complement is obtained by inverting all the bits and adding 1. This method allows the same electronic addition circuitry to perform both addition and subtraction. It makes arithmetic operations efficient in digital systems. Two’s complement is therefore an important concept in computer architecture, processors, and the representation of signed binary numbers.
9. Why are binary addition and subtraction important in computer science?
Binary addition and subtraction are important because computers represent numerical information using binary digits. At the hardware level, digital circuits work with two basic states, which can be represented by 0 and 1. Processors use binary arithmetic to perform calculations, comparisons, address operations, and many other tasks. Binary addition can be implemented using circuits such as half adders and full adders, while subtraction can be performed using techniques such as two’s complement. Learning these operations provides a foundation for understanding digital logic, computer architecture, processors, memory, and other areas of computer science.
10. What is the difference between binary addition and subtraction?
The main difference between binary addition and subtraction is the special process used when a calculation cannot be completed directly. Binary addition uses carrying when the sum reaches 2 or more. For example, 1 + 1 = 10₂, so 1 is carried to the next position. Binary subtraction uses borrowing when the upper digit is smaller than the lower digit. For example, 0 − 1 requires borrowing from the next position. Both operations are normally performed from right to left and are fundamental to computer arithmetic and digital electronic systems.
