Number Theory · Place-Value Proof
Digit-sum tests are consequences of base-ten place value. Every power of ten leaves remainder 1 when divided by either 3 or 9, so each digit contributes its own value to the remainder.
An integer is divisible by 3 or 9 exactly when its decimal digit sum is divisible by that same number. For example, 4,572 has digit sum 4 + 5 + 7 + 2 = 18, so 4,572 is divisible by both 3 and 9. The reason is 10 = 9 + 1: every power of ten has remainder 1 modulo 9, and therefore modulo 3 as well. OpenStax lists both tests.
What Does Place Value Have To Do With Divisibility?
A decimal number is a sum of digits multiplied by powers of ten. For 4,572, the decomposition is 4×1,000 + 5×100 + 7×10 + 2. Each place value can be written as one more than a multiple of nine: 10 = 9 + 1, 100 = 99 + 1, and 1,000 = 999 + 1.
Thus 4,572 = 4×999 + 5×99 + 7×9 + (4 + 5 + 7 + 2). The first three terms are multiples of nine; the leftover is the digit sum 18.
Why Is The Digit Sum Enough To Check?
For any nonnegative integer written as digits dₖ…d₁d₀, the value is d₀ + 10d₁ + 10²d₂ + ⋯ + 10ᵏdₖ. Because 10 leaves remainder 1 on division by 9, so does every power 10ᵏ. Therefore the number and d₀ + d₁ + ⋯ + dₖ leave the same remainder modulo 9.
The same reasoning works modulo 3 because 10 also leaves remainder 1 on division by 3. A remainder of zero is precisely divisibility. This proves both directions of each test, not merely one example.
How Do The Rules Separate Divisibility By 3 From 9?
For 123, the digit sum is 1 + 2 + 3 = 6. Since 6 is divisible by 3 but not by 9, 123 is divisible by 3 but not by 9; 123 ÷ 3 = 41. For 4,572, the sum is 18, so both rules pass; 4,572 ÷ 9 = 508 and 4,572 ÷ 3 = 1,524.
Every multiple of 9 is a multiple of 3, but not every multiple of 3 is a multiple of 9. Testing the wrong divisor against the digit sum is a common slip.
Why Can’T You Use The Same Digit-Sum Rule For Every Divisor?
The proof depends on 10 having remainder 1 for the chosen divisor. That is true for 3 and 9, but not for 4. For instance, 13 has digit sum 4, yet 13 is not divisible by 4.
To test 4, use the last two digits: every higher place contributes a multiple of 100, and 100 itself is divisible by 4. Rules for different divisors come from different place-value remainders; a memorized test is more reliable when you know which remainder pattern supports it.
Can You Repeat The Digit-Sum Test?
You can add the digits again when the first sum is large. Each repetition preserves divisibility by 3 and by 9. Stop as soon as the new sum is easy to recognize.
For 987,654, the first sum is 9 + 8 + 7 + 6 + 5 + 4 = 39. Adding again gives 3 + 9 = 12, then 1 + 2 = 3. The original number is divisible by 3 but not by 9.
The same chain tells you the remainder for a nonnegative integer. Each value leaves remainder 3 on division by 9. Direct division confirms 987,654 = 9 × 109,739 + 3.
A final digit of 9 means remainder zero modulo 9, not remainder nine. The number 99 reduces to 18 and then 9, yet 99 ÷ 9 = 11 with no remainder. Remainders for division by 9 range from 0 through 8.
How Do You Find A Missing Digit Using Divisibility?
A missing-digit problem turns the test into a small equation. Suppose 4□2 is divisible by 9, where □ represents one decimal digit. The known digits add to 6, so 6 + □ must be a multiple of 9.
The sums range from 6 to 15 because the missing digit ranges from 0 to 9. Only 9 is a multiple of 9 in that interval. Therefore the missing digit is 3, giving 432 = 9 × 48.
Divisibility by 3 allows more answers. For the same pattern, the sum can be 6, 9, 12, or 15. The missing digit can be 0, 3, 6, or 9.
Check all allowed digits instead of choosing the first one that works. A question may add another condition, such as evenness or no repeated digits. Apply that condition after the digit-sum test.
For 2□5 to be divisible by 9, the known sum is 7. The missing digit must be 2, producing 225. The test uses every digit, not only the first or last one.
Does Rearranging The Digits Change Divisibility?
Rearranging decimal digits leaves their sum unchanged. It therefore preserves divisibility by 3 and by 9. It does not preserve the number’s size or divisibility by every other divisor.
The integers 123, 132, and 321 have digit sum 6. Each is divisible by 3, and none is divisible by 9. Only 132 is even, so only that number is also divisible by 6.
A zero moved to the front may shorten how we write a number. The strings 120 and 012 have digit sum 3, although their values are 120 and 12. Both pass the test for 3 because the rule concerns the sum, not digit positions.
Adding a trailing zero preserves these two divisibility results too. Multiplying an integer by 10 does not introduce a factor of 3 or 9. Do not extend that statement to a divisor such as 2, where a trailing zero changes the test.
How Do You Combine Different Divisibility Rules?
Check divisibility by 6 using both the test for 3 and the test for 2. The factors 2 and 3 share no prime factor. Passing both guarantees divisibility by their product.
For 1,254, the digit sum is 12 and the final digit is even. It passes both tests, and 1,254 ÷ 6 = 209. The integer 1,253 fails both, while 123 passes only the test for 3.
For 18, combine divisibility by 9 with evenness. The integer 4,572 passes both and equals 18 × 254. The integer 999 passes the 9 test but is odd, so it is not divisible by 18.
Be careful with factors that overlap. Passing the tests for 3 and 9 does not prove divisibility by 27. The integer 18 passes both, yet 27 does not divide it; those tests reuse the same prime factor.
Why Does The Number Base Matter?
The shortcut depends on decimal place values. In another base, the written digits carry different weights. Adding those digits without considering the base can give a wrong conclusion.
For example, 11 in base two means decimal 3. Its written digit sum is 2, which is not divisible by 3. The decimal test would fail if you applied it directly to that binary numeral.
In base b, each power of b leaves remainder 1 when divided by a positive divisor of b − 1. That is the broader pattern behind digit sums. Decimal uses b = 10, so divisors of 9 include 3 and 9.
This general rule explains the shortcut’s scope without requiring another number system. Use the familiar tests for decimal integers. For a labeled base-two or base-sixteen numeral, convert its value or use a rule proven for that base.
Which Mistakes Make A Digit-Sum Test Unreliable?
A wrong sum produces a wrong decision even when the rule is correct. Write the digits once and count them before adding. Zeros contribute nothing but can help you track a long number.
For 90,018, the sum is 9 + 0 + 0 + 1 + 8 = 18. Skipping the final 8 leaves 10 and incorrectly rejects both divisors. Check the arithmetic before changing the rule.
Do not replace a digit sum with the number of digits. A five-digit number can pass or fail either test. Divisibility depends on the digit values, not the length of its notation.
Do not confuse the sum with the quotient. A sum of 18 shows divisibility by 9, but the original quotient is not necessarily 2. For 90,018, that quotient is 10,002.
FAQs About Divisibility Rules For 3 And 9
Can These Tests Prove That A Number Is Prime?
No. Failing both tests only rules out factors 3 and 9. The integer 35 fails them but is composite because it equals 5 × 7.
A prime test checks additional possible factors.
Can I Ignore A Decimal Point?
Not for integer divisibility. Removing the decimal point changes the value: 1.23 becomes 123. Passing the scaled integer’s test does not make the original value an integer multiple of 3.
Does A Calculator Need To Divide The Original Number?
A program can test the digit sum, compute a remainder, or use exact integer division. These are methods for the same yes-or-no question. The quotient answers a different question: how many groups the number contains.
Practice The Tests And Explain Each Decision
Test 7,281, 8,002, and 5,430 for both divisors. Then find the missing digit in 6□3 so the number is divisible by 9. Work from the sums before checking division.
The sums are 18, 10, and 12. Thus 7,281 passes both tests, 8,002 passes neither, and 5,430 passes only the 3 test. For 6□3, the known sum is 9, so the missing digit can be 0 or 9.
The missing-digit problem has two answers, 603 and 693. Their quotients by 9 are 67 and 77. List both because the missing digit can be any of the ten decimal digits.
What Are The Boundaries Of The 3 And 9 Tests?
The rule applies to base-ten integer notation. For negative integers, use the absolute value of the digits: −123 is divisible by 3 because 123 is. Zero is divisible by both nonzero divisors, and its digit sum is zero.
Leading zeros do not change the value or its digit sum. A successful digit-sum test proves divisibility by 3 or 9, not by arbitrary numbers such as 6; for 6, you must also check that the integer is even. The Divisibility Calculator can confirm the result, while the Prime Factorization Calculator addresses the next question of which factors the number has.
Test Your Own Integer
Predict the result using its digit sum, then check whether your chosen divisor leaves a remainder.
Open the Divisibility CalculatorBrowse Number Tools