Divisibility by 3 and 9: add up the digits
A number is divisible by 3 (or 9) if the sum of its digits is. Mind-blowing test, works for all integers.
The two rules
- Divisible by 3: the sum of digits is divisible by 3.
- Divisible by 9: the sum of digits is divisible by 9.
In one picture
Take :
- Sum of digits: .
- is divisible by 3 → 471 is divisible by 3 ✓ (check: ).
- isn’t divisible by 9 → 471 isn’t divisible by 9.
Take :
- → divisible by 3 and 9 ✓ (check: ).
The shortcut of the shortcut
If the sum is still big, sum again. Example :
- → divisible by 3, not by 9.
Why it works
Every power of 10 equals modulo 9 (because ). So a number is congruent to the sum of its digits modulo 9. Divisible by 9 = digit sum divisible by 9. Same for 3 since .
Is 2718 divisible by 9?
Among these 4 numbers, which one is NOT divisible by 3?
