If $a$ Divides $b+c$, Must It Divide $b$ or $c$?

The statement is false. Divisibility of a sum does not generally imply divisibility of either summand. A single counterexample disproves the claim, and congruences explain why the implication fails.

A counterexample

Let $a=5$, $b=1$, and $c=4$. Then

$$b+c=1+4=5,$$

so $5\mid(b+c)$. But $5\nmid1$ and $5\nmid4$. Thus the premise holds while both alternatives in the conclusion fail.

The same pattern works for any integer $a>1$: choose $b=1$ and $c=a-1$. Their sum is $a$, but neither term is divisible by $a$. For another concrete instance, $a=7$, $b=3$, and $c=4$ also works: $7\mid 3+4$, even though $7$ divides neither summand.

What the premise actually says

For a nonzero integer $a$, the statement $a\mid(b+c)$ means that $b+c=ka$ for some integer $k$. Equivalently, using congruence notation,

$$b+c\equiv0\pmod a,$$

or

$$b\equiv -c\pmod a.$$

So the remainders of $b$ and $c$ cancel when added modulo $a$. They do not have to be zero individually. In the example with $a=5$, the residues are $1$ and $4$, which add to $0$ modulo $5$.

This is the key distinction: a sum can be divisible by $a$ because its terms cancel modulo $a$, not because each term is separately divisible by $a$.

A general way to build counterexamples

Suppose $a>1$. Choose any $b$ that is not divisible by $a$, and set

$$c=ka-b$$

for an integer $k$. Then $b+c=ka$, so $a\mid(b+c)$. Also, $c\equiv-b\pmod a$. If $b$ is not divisible by $a$, then neither is $c$, because $a\mid c$ together with $a\mid(b+c)$ would imply $a\mid b$ by subtraction.

For example, take $a=8$, $b=3$, and $k=1$. Then $c=8-3=5$, giving $8\mid(3+5)$ while $8$ divides neither $3$ nor $5$. This construction shows the failure is not an isolated numerical accident.

What divisibility rules are valid?

Divisibility is preserved under addition and subtraction when the terms being combined are already known to be divisible. For example, if $a\mid b$ and $a\mid(b+c)$, then subtracting $b$ gives

$$a\mid\big((b+c)-b\big)=c.$$

Likewise, if $a\mid c$ and $a\mid(b+c)$, then subtracting $c$ gives $a\mid b$. These are valid implications, but they require the extra assumption that one summand is divisible by $a$.

There is also a familiar prime-divisor rule that can cause confusion: if a prime $p$ divides a product $xy$, then $p\mid x$ or $p\mid y$. That theorem concerns multiplication, not addition. It cannot be applied to a statement about $b+c$.

Common mistakes

• Confusing sums with products. The prime-divisor property for $xy$ does not have an equivalent “one summand” rule for $x+y$.
• Treating a zero sum of residues as two zero residues. If $b+c\equiv0\pmod a$, the residues may be nonzero opposites, such as $1$ and $a-1$.
• Trying to prove a universal claim with examples. Examples can disprove a claim when one counterexample is found, but proving it true would require an argument covering every allowed $a,b,c$.
• Forgetting the divisor convention. This discussion uses the standard convention that $a$ is a nonzero integer, usually a positive integer. If $a=1$ (or $a=-1$), it divides every integer, so the conclusion is automatically true; this does not rescue the general claim for divisors with $|a|>1$.

Therefore, the proposed implication is false in general: divisibility of a sum only requires the two terms to cancel modulo the divisor.