Master Divisibility Rules & Digital Invariants
Master the mechanics behind divisibility rules, learn to construct rules for composite numbers, and leverage digital roots to rapidly verify arithmetic operations.
1. The Story & Mental Model
Think of divisibility rules not as arbitrary magic tricks, but as 'security checkpoints' at the border of Modulo Arithmetic. When a massive number like approaches the border of "Divisible by 9", the checkpoint doesn't inspect the whole number. It just asks the digits to weigh in: . Since 28 doesn't pass the border control for 9, the whole number is rejected.
Why does this work? Because our number system is base-10. Since , any power of 10 behaves just like a 1 when dividing by 9. Therefore, leaves the same remainder as , which is why we can just add the digits!
By understanding why the rules work, you can derive the rule for any number on the fly.
2. The CAT Question Blueprint
The examiner will rarely ask "Is 345 divisible by 3?" Instead, they will:
-
Leave one or two digits unknown (e.g., ) and ask for the sum or maximum value of the unknowns for the number to be divisible by 72 (meaning it must pass both the 8 and 9 checkpoints).
-
Test rules for primes like 7, 11, and 13 simultaneously.
-
Ask for the remainder when a massive repetitive number (like 555... fifty times) is divided by 13 or 37.
3. Core Concepts, Formulae & Derivations
A. Power of 2 Checkpoints ()
Because is divisible by , is divisible by , and by :
-
2: Check the last 1 digit.
-
4: Check the last 2 digits.
-
8: Check the last 3 digits.
-
16: Check the last 4 digits.
B. Power of 5 Checkpoints ()
Similar to powers of 2.
-
5: Last digit must be 0 or 5.
-
25: Last 2 digits must be 00, 25, 50, or 75.
-
125: Last 3 digits must be divisible by 125.
C. The Summation Checkpoints ()
Because and :
-
3: Sum of digits must be divisible by 3.
-
9: Sum of digits must be divisible by 9.
(The single-digit result of continuously summing digits is called the Digital Root. The digital root of a number is its remainder when divided by 9, with 9 replacing a remainder of 0).
D. The Alternating Checkpoint ()
Because :
- 11: The difference between the sum of digits at odd places and the sum of digits at even places must be or a multiple of .
E. The Block Checkpoints ()
Because :
- To test divisibility by 7, 11, or 13 for large numbers, break the number into blocks of 3 from right to left, and find the alternating sum/difference of the blocks. The result will have the same divisibility as the original number.
F. Composite Divisors (, etc.)
To test divisibility for a composite number , break into two or more co-prime factors.
-
72: Must be divisible by 8 AND 9. (Notice we don't use 12 and 6, because they share a common factor of 6).
-
88: Must be divisible by 8 AND 11.
4. Common Pitfalls & Speed Shortcuts
-
Pitfall: Breaking a composite divisor into non-coprime parts. E.g., testing for 24 by checking 4 and 6. A number like 12 passes for both 4 and 6, but is NOT divisible by 24! Always use co-primes: .
-
Shortcut: The "Seed" method (Osculators) for primes like 7, 13, 17, 19. For 7: take the last digit, double it, and subtract from the rest of the number. Repeat until small. (For 13: multiply last digit by 4 and ADD).
Formulas
| Divisibility by 8 | |
|---|---|
| Divisibility by 11 | |
| Composite Divisor N = a \times b |
Traps and tips
- Always choose co-prime factors for composite divisibility rules. 36 is 4 and 9, not 6 and 6.
- For divisibility by 8, if the hundreds digit is even, just check the last two digits!
- Digital roots are invariant under multiplication: DigitalRoot(A x B) = DigitalRoot(DigitalRoot(A) x DigitalRoot(B)).
Solved examples
The Missing Digits of 72
A 7-digit number is divisible by 72. Find the maximum possible value of .
Show solution
For a number to be divisible by 72, it must be divisible by its co-prime factors, 8 and 9.
Step 1: Divisibility by 8
The last three digits are . For this to be divisible by 8, must be a multiple of 8.
Since is in the hundreds place, let's use the shortcut: if is even, must be divisible by 8. The only multiple of 8 in the 50s is 56. So if is even.
If is odd, must be divisible by 8. . Multiples of 8 in the 50s/60s are 56, 64. So . (Also , impossible).
So we have two cases:
Case 1: ,
Case 2: ,
Step 2: Divisibility by 9
The sum of the digits must be a multiple of 9.
Sum .
Let's test Case 1 (): Sum . For this to be a multiple of 9, must be 1. But in Case 1, must be even. So this case fails.
Let's test Case 2 (): Sum . For this to be a multiple of 9, must be 5 (since ). Is 5 odd? Yes. This case works!
Therefore, and .
The maximum (and only) value of .
Takeaway: Always apply the localized rule (like 8, checking the end) before the global rule (like 9, checking the sum) to narrow down unknowns quickly.
The Alternating 11
If the 6-digit number is divisible by 11, what is the value of the digit ?
Show solution
The divisibility rule for 11 states that the difference between the sum of digits in odd positions and the sum of digits in even positions must be a multiple of 11.
Let's label the positions from right to left:
Position 1: 4
Position 2: 2
Position 3: 6
Position 4: 5
Position 5: 3
Position 6:
Sum of odd positions .
Sum of even positions .
Difference .
For the number to be divisible by 11, this difference must be , etc.
Since is a single digit from 0 to 9, the only way can be a multiple of 11 is if it equals 0.
.
Takeaway: For the divisibility rule of 11, it doesn't matter if you go left-to-right or right-to-left, just ensure you alternate strictly.
The 1001 Block Check
Is the number 425,739 divisible by 7, 11, or 13?
Show solution
We use the block subtraction method because .
Split the number into blocks of 3 from right to left:
Block 1: 739
Block 2: 425
Take the alternating difference:
.
Now, test 314 for divisibility by 7, 11, and 13.
-
For 7: remainder 6. (Not divisible)
-
For 11: . (Not divisible)
-
For 13: remainder 2. (Not divisible)
The original number is not divisible by 7, 11, or 13.
Let's do a quick variant: what if the number was 425,432?
Difference = .
7 is divisible by 7, but not 11 or 13. So 425,432 is a multiple of 7!
Takeaway: The 3-digit block difference method instantly checks divisibility for 7, 11, and 13 simultaneously.
The 99 Framework
A palindrome is a number that reads the same forwards and backwards. Prove that every 4-digit palindrome is divisible by 11.
Show solution
A 4-digit palindrome can be written in the form , where and are digits.
Let's expand this using place value:
Notice that:
So, .
Since and are integers, the term is an integer.
Therefore, is always a multiple of 11.
Alternatively, using the rule of 11:
Odd positions sum:
Even positions sum:
Difference: .
Since 0 is a multiple of 11, the number is divisible by 11.
Takeaway: Algebraic expansion of digits ( 1000A + 100B... ) often provides elegant proofs for divisibility rules and digit constraints.
Digital Root Verification
The product of and is claimed to be . Use digital roots to quickly check if this multiplication could be correct.
Show solution
The digital root (sum of digits until a single digit) is invariant under multiplication.
Let's find the digital roots (DR) of the operands.
.
Sum of digits .
.
So, .
.
Sum of digits .
.
So, .
The digital root of the product should be the digital root of .
.
(which is equivalent to 0 in mod 9).
Now, let's check the claimed product .
Sum of digits .
.
.
So, .
Since but , the claimed product is strictly INCORRECT.
Takeaway: The digital root of a product equals the digital root of the product of the digital roots of the operands. It is a blazing fast sanity check.
The Osculator (Seed) for Primes
Determine if 4,213 is divisible by 19 using the seed method.
Show solution
The seed (or osculator) for checking divisibility by 19 is .
Rule: Take the last digit, multiply by 2, and ADD it to the remaining truncated number.
Let's process 4,213:
-
Last digit is 3. Truncated number is 421.
New number .
-
Next, process 427:
Last digit is 7. Truncated number is 42.
New number .
Is 56 divisible by 19?
, not 56.
Since 56 is not a multiple of 19, the original number 4,213 is NOT divisible by 19.
(Note: How do we get the seed? We look for a multiple of 19 ending in 9. . Add 1 to get 20. Drop the zero to get 2. Since we added 1, the operation is ADD).
Takeaway: The seed method shrinks large numbers rapidly for prime divisibility checking, avoiding long division.
Practice questions
Question 1 · CAT Level
The eight-digit number is divisible by . What is the maximum possible value of the three-digit number ?
Show answer and explanation
Answer: (C) 961
Since with factors pairwise co-prime, must satisfy all three divisibility tests.
For divisibility by , the last three digits must be a multiple of , yielding .
For divisibility by , the sum of digits .
For divisibility by , alternating sum difference .
Testing , giving .
Testing , giving .
Testing , giving .
Hence, the maximum possible value of is .
Question 2 · CAT Level
How many six-digit palindromes of the form (where ) are divisible by ?
Show answer and explanation
Answer: (C) 140
By the -block rule, any integer .
Partitioning gives blocks and , so .
Since and , we have .
Therefore, .
Since and :
Case 1: yields pairs; Case 2: yields pairs (); Case 3: yields pairs ().
This gives valid pairs . Since the middle digit is unconstrained ( choices), total count is .
Question 3 · CAT Level
For a positive integer , let denote the sum of the decimal digits of . How many positive integers satisfy the equation:
Show answer and explanation
Answer: (C) 4
Since , we have .
Because , we require , so .
Since is a 4-digit number near , and , establishing .
Testing multiples of in this interval yields solutions:
(), (),
(), and ().
No other values in the range satisfy the equation, giving exactly solutions.
Question 4 · CAT Level
A large integer is formed by writing in order the positive integers from to :
What is the remainder when is divided by ?
Show answer and explanation
Answer: (B) 27
Because , the remainder modulo equals the sum of two-digit blocks grouped from right to left.
consists of the two-digit integers from to ( digits) preceded by the single digits .
Grouping from right: the first blocks are the integers ; the remaining left digits group into , and .
The sum of the two-digit numbers is , which is .
The sum of the remaining five blocks is .
Thus .
Question 5 · CAT Level
The five-digit number is divisible by . If the two-digit number is also divisible by , what is the value of ?
Show answer and explanation
Answer: (C) 14
Express as .
Dividing by : , so .
For , we require .
Multiplying by (since ) yields .
Two-digit multiples of plus are (with leading zero disallowed if is two-digit, though is also not div by ).
Among these, testing divisibility by : only is divisible by ().
Thus , giving and , so .
Study this concept with interactive practice in PrepSoc.
Open the concept library