Binary Arithmetic: Adding Binary Numbers Explained for KS3 Computing

Binary addition works exactly like decimal addition in columns — except you only have two digits (0 and 1), so you carry into the next column after reaching 2 instead of 10. Master the four core rules and every binary addition problem becomes a mechanical, step-by-step process.

Why do computers use binary arithmetic?

Before learning the rules, it helps to understand why. A computer's CPU performs all arithmetic in binary because transistors — the tiny switches inside — are either on (1) or off (0). Adding two binary numbers is therefore the fundamental operation every calculation in a computer eventually reduces to. Decimal addition is a human convenience; binary addition is what the hardware actually does millions of times per second.

What are the four rules of binary addition?

There is also a fifth rule needed when a carry is involved:

Think of it like decimal: 9 + 1 = 10, so you write 0 and carry 1. In binary, 1 + 1 = 2 in decimal = 10 in binary, so you write 0 and carry 1.

How do you add two binary numbers column by column?

Worked example 1 — Add 0101 (5) + 0011 (3):

  Carry:    0 0 1 0
            -------
            0 1 0 1   (5)
          + 0 0 1 1   (3)
            -------
            1 0 0 0   (8)

Step-by-step (working right to left):

1. Column 1 (ones): 1 + 1 = 0, carry 1
2. Column 2 (twos): 0 + 1 + 1 carry = 0, carry 1
3. Column 3 (fours): 1 + 0 + 1 carry = 0, carry 1
4. Column 4 (eights): 0 + 0 + 1 carry = 1, no carry

Result: 1000 = 8 ✓

Worked example 2 — Add 0110 (6) + 0101 (5):

  Carry:    0 1 1 0
            -------
            0 1 1 0   (6)
          + 0 1 0 1   (5)
            -------
            1 0 1 1   (11)

Step-by-step:

1. Column 1: 0 + 1 = 1, no carry
2. Column 2: 1 + 0 = 1, no carry
3. Column 3: 1 + 1 = 0, carry 1
4. Column 4: 0 + 0 + 1 carry = 1, no carry

Result: 1011 = 11 ✓

What is a carry bit and how does it move?

A carry bit is a 1 that overflows from one column into the column immediately to its left — exactly like carrying in decimal. In the worked examples above, the carry row records these migrating 1s. When working through exam questions, always draw a separate carry row above the sum; missing carries is the most common source of errors.

What is binary overflow and when does it occur?

Overflow occurs when the result of an addition is too large to fit in the fixed number of bits available. For an 8-bit system, the maximum value is 11111111 = 255. If you add two numbers whose sum exceeds 255, the carry bit escapes beyond bit 7 and is lost, leaving a wrong, smaller answer.

Worked example — overflow in 4-bit addition:

  Carry:  1 1 1 0
          -------
          1 1 0 1   (13)
        + 0 1 0 1   (5)
          -------
         (1)0 0 1 0  → result stored = 0010 = 2  ✗

The true answer is 18, but in 4 bits only 4 digits are kept — the leading 1 is lost. The stored result (2) is completely wrong. This is why programs must check for overflow; in safety-critical software (aeroplanes, medical devices) an undetected overflow error can be catastrophic.

How can you check your binary addition answer?

Convert both original binary numbers to decimal, add them in decimal, then convert the expected decimal answer back to binary and compare. If they match, your binary addition is correct.

Frequently asked questions

Do I need to know subtraction as well as addition at KS3?

The KS3 national curriculum focuses on binary addition and the concept of binary representation. Subtraction via two's complement is typically examined at GCSE (see the separate article on two's complement). At KS3, you should be confident with addition rules and the carry mechanism.

What happens if there is a carry out of the leftmost bit?

If a carry exits the leftmost available bit, overflow has occurred (see above). In some contexts — particularly when dealing with unsigned integers — the carry flag in the CPU is set to 1 to signal that the result was too large. The program can then check this flag and handle the error rather than silently using the wrong number.

How many different values can an 8-bit binary number represent?

An 8-bit number has 2⁸ = 256 different patterns, representing the values 0 to 255 inclusive. This is why adding any two values whose sum is 256 or greater causes overflow in an 8-bit system.

Is binary addition the same as bitwise OR?

No. Binary addition and bitwise OR are different operations, though both work bit by bit. OR simply checks whether at least one operand bit is 1 (1 OR 0 = 1, 1 OR 1 = 1). Binary addition generates a carry; OR does not. Adding 1 + 1 = 10 in binary; 1 OR 1 = 1. They give different results wherever both bits are 1.

Work through binary addition problems with Professor Turing's step-by-step feedback at aitutors.me.