Divisibility by 9 via Digit Sum

The classic divisibility test for 9 is one of the most elegant results in elementary number theory — and it makes a perfect playground for practising biconditional proofs in the HSC Extension 2 course. By working through this proof, you’ll see how a simple algebraic rearrangement can uncover a deep modular relationship between a number and its digit sum, and how that one relationship makes both directions of the “if and only if” argument almost trivial.

Problem Statement

Prove that a three-digit number is divisible by $9$ if and only if the sum of its digits is divisible by $9$.

---

Hints

• Let $N = 100a + 10b + c$ where $a, b, c$ are the digits.
• Rewrite this as $N = 9(11a + b) + (a + b + c)$ to establish the relationship between $N$ and the digit sum.
• Then prove both directions of the biconditional using this relationship.

---

Solutions

We begin by giving the three-digit number a name and expressing it in terms of its digits. Let’s write

• Let $N = 100a + 10b + c$ be a three-digit number with digits $a, b, c$.
• Let $S = a + b + c$ be the sum of digits.

The heart of the proof is to connect $N$ and $S$ in a way that reveals a multiple of $9$. By splitting the $100a$ and $10b$ terms into $99a + a$ and $9b + b$, we can factor out $9$ from most of the expression, leaving the digit sum behind:

• Key Relationship: Rewrite $N$:

  $$\begin{aligned} N &= 100a + 10b + c \\ &= (99a + a) + (9b + b) + c \\ &= 9(11a + b) + (a + b + c) \\ &= 9(11a + b) + S \end{aligned}$$

This rearrangement tells us that $N$ and $S$ differ by a multiple of $9$ — specifically, $9(11a+b)$. In the language of modular arithmetic, that means

• Therefore: $N - S = 9(11a + b)$, which means $N \equiv S \pmod{9}$.

Now we have a single, clean congruence that instantly handles both directions of the biconditional.

For the forward direction ($\Rightarrow$), assume $9$ divides $N$ — that is, $N \equiv 0 \pmod{9}$. Because $N$ and $S$ are congruent modulo $9$, $S$ must also be congruent to $0$, so $9$ divides $S$:

• Direction 1 ($\Rightarrow$): If $9|N$, then $9|S$. If $N \equiv 0 \pmod{9}$, then from $N \equiv S \pmod{9}$, we get $S \equiv 0 \pmod{9}$. Thus $9|S$.

The reverse direction ($\Leftarrow$) is just the mirror image. If we start with $9$ dividing $S$ ($S \equiv 0 \pmod{9}$), then the congruence $N \equiv S \pmod{9}$ forces $N \equiv 0 \pmod{9}$, so $9$ must also divide $N$:

• Direction 2 ($\Leftarrow$): If $9|S$, then $9|N$. If $S \equiv 0 \pmod{9}$, then from $N \equiv S \pmod{9}$, we get $N \equiv 0 \pmod{9}$. Thus $9|N$.

With both implications established, the biconditional is proved.

• Both directions proven, so the biconditional holds.
• Note: This proof generalizes to all positive integers and divisibility by 9. The key is the modular relationship $N \equiv S \pmod{9}$.

---

Takeaways

• The algebraic manipulation $100a+10b+c = 9(11a+b) + (a+b+c)$ is the core trick — it shows that any number differs from its digit sum by a multiple of $9$, so divisibility by $9$ depends purely on the digit sum.
• Once you have the congruence $N \equiv S \pmod{9}$, both directions of the “if and only if” become one-step deductions from the definition of modular equivalence.
• The same technique works for any number of digits, because every power of $10$ is congruent to $1$ modulo $9$ — a fact that underpins the general divisibility rule for $9$.

---

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:

• HSC Proofs
• HSC Collections
• HSC Last Resorts