Numbers Are Not Just Values — They Have Structure
Every number you write carries hidden patterns inside it. The digit 3 in 300 doesn’t mean the same thing as the digit 3 in 30 or in 3. That positional meaning — the structure of a number — is what this entire chapter exploits.
Class 8 uses that structure to do something clever: we express numbers in general form, then use algebra to prove divisibility rules you’ve been using since Class 4 without knowing why they work. Once you see why “if the sum of digits is divisible by 9, then the number is divisible by 9,” you’ll never forget it.
This chapter also introduces letters for digits — essentially mini-puzzles where you figure out which digit a letter stands for. These are direct predecessors of the logical reasoning questions in competitive exams. They appear in the Olympiad circuit regularly, and a simplified version showed up in CBSE board papers multiple times in the last five years.
The chapter looks light — no heavy calculations — but the conceptual clarity it demands is surprisingly high. Students who rush through it regret it in Class 9 when number theory questions need this as a base.
Key Terms and Definitions
General Form of a Number — Writing a number in terms of its place values. A two-digit number with tens digit and units digit is written as .
- 47 in general form:
- 73 in general form:
A three-digit number with hundreds digit , tens digit , units digit becomes .
Reversing a Number — Swapping the positions of digits. The reverse of is .
Divisibility — A number is divisible by if leaves remainder 0. We write this as .
Cryptarithmetic (Letters for Digits) — Puzzles where each letter represents a unique digit (0–9), and the arithmetic equation holds true. For example, solving where A and B are single digits.
Sum of Digits — For a number like 364, the sum of digits is . This shows up constantly in divisibility tests for 3 and 9.
Core Concepts with Worked Examples
General Form and Why It Matters
Take any two-digit number, say 36. In general form:
Now reverse it: 63. In general form:
We can subtract these using algebra:
The difference is 27 — which is . This tells us something: the difference of a two-digit number and its reverse is always divisible by 9. Let’s prove this formally.
Let the number be and its reverse be .
This is always divisible by 9. The quotient is , the difference of the digits.
Similarly, their sum:
Always divisible by 11. The quotient is the sum of the digits.
Why Divisibility Tests Work
Test for 9: Take 837. Sum of digits = , which is divisible by 9. So 837 is divisible by 9.
But why? Write 837 in general form:
Both and are divisible by 9, so 837 is divisible by 9. Notice: what’s left after factoring out 9 is exactly the sum .
This is the algebraic proof that NCERT expects you to understand — not just memorize.
Divisibility by 11
The test: alternately add and subtract digits from right to left. If the result is 0 or divisible by 11, the number is divisible by 11.
For 2728: Start from right — . Divisible by 11. ✓
In general form for a 4-digit number :
Splitting the 1000, 100, 10, 1 coefficients into “multiples of 11” plus “remainders” gives the alternating sum. The proof is a natural extension of the 2-digit case.
Letters for Digits — A Systematic Approach
This is where many students guess randomly. Don’t. Work with constraints.
Example: Solve the addition puzzle where , where A, B, D are distinct digits.
Step 1: Write in general form.
Step 2: Since the left side is divisible by 11, the right side must be too. . (Since .)
Step 3: Try small values. : , so . Try : , not integer. : , so . ✓
Answer: . Check: . ✓
Solved Examples: Easy to Hard
Example 1 — Easy (CBSE Class 8)
Q: If is divisible by 9, find .
Sum of digits = . For divisibility by 9, we need or .
(since ) or (not a single digit, rejected).
Answer:
Example 2 — Medium (CBSE Class 8 / Olympiad)
Q: A two-digit number is 4 times the sum of its digits. Find the number.
Let the number be . Then:
Since and are single digits (and ): gives 12; gives 24; gives 36; gives 48.
All four are valid. Verify: ✓
Example 3 — Hard (Olympiad Level)
Q: Solve: , where A, B, C are distinct non-zero digits.
means .
Since is a single non-zero digit, is between 100 and 900. So must give a 3-digit multiple of 100. Try : , so — impossible (two-digit = three-digit).
Try : . So must be a multiple of 25. Options: 50 (, rejected, non-zero) or 75 — but that’s , not .
Try : . must be a multiple of 50. gives (rejected). No solution.
Try : . Options where product is a multiple of 100: multiples of 100 divisible by 3 … (three-digit, rejected). No.
Try : . must give product as multiple of 100. … Let : . . (rejected). (rejected). No.
The puzzle has specific constraints — competition problems of this type are designed to have a unique solution, and the approach above (factoring into general form) is the method examiners reward.
CBSE Class 8 NCERT exercises test the straightforward cases — reversals, digit-sum divisibility, simple letter-for-digit. Olympiad papers take the same framework deeper with multi-step constraints. Building your general-form algebra here pays compound interest later.
Exam-Specific Tips
CBSE Class 8
Weightage: This chapter carries roughly 3–5 marks in the annual exam, typically as one 2-mark short answer and one 3-mark application question.
What NCERT actually tests:
- Proving divisibility rules using general form (guaranteed 1 question)
- Finding missing digits using divisibility conditions
- Reversing numbers and their sum/difference properties
Always write the general form explicitly in your solution. Examiners give step marks, and as the first line guarantees you at least 1 mark even if you make an arithmetic error later.
Olympiad (Math Olympiad / NSO)
Letters-for-digits problems appear regularly. The strategy is always: write everything in general form → collect unknowns on one side → use digit constraints (each digit 0–9, leading digit ≠ 0, all letters distinct) to narrow down.
In competitive exams, when you see a letters-for-digits puzzle with a carry in addition, always check the carry separately for each column from right to left. Carries are either 0 or 1 — that constraint often immediately fixes one of the unknowns.
Common Mistakes to Avoid
Mistake 1: Forgetting leading digit ≠ 0. In , cannot be 0 (that would make it a 1-digit number). Students often find as a mathematical solution and include it — wrong. Always state “since is the leading digit, .”
Mistake 2: Confusing sum of digits with the number. The divisibility test for 9 uses the sum of digits, not the number itself. is divisible by 9 because , not because 45 looks like it. Students get confused when the sum of digits is itself a two-digit number — just keep summing. : , . Yes, divisible by 9.
Mistake 3: Claiming uniqueness without checking all cases. When asked “find the digit,” check every possible value, not just the first one that works. The question “find if is divisible by 3” has (sum = 11, not divisible), (sum = 14, not divisible), (sum = 17, not divisible)… Wait — divisible by 3 means . Multiple answers possible!
Mistake 4: Wrong application of the 11 test. The alternating sum for 11 goes from right to left: units gets , tens gets , hundreds gets , and so on. Many students go left to right and sometimes get the same answer (when the number of digits is even) and sometimes a wrong answer (odd digits). Fix: always start from the rightmost digit.
Mistake 5: Not verifying the answer. Letters-for-digits problems must be verified by substituting back into the original puzzle. You might satisfy the algebraic equation but violate a constraint (like two letters getting the same digit). Always plug back in.
Practice Questions
Q1. Write 786 in general form and find which of the digits (7, 8, 6) contributes how much to the value.
Digit 7 contributes 700, digit 8 contributes 80, digit 6 contributes 6.
Q2. Check whether 5765 is divisible by 11.
Alternating sum (right to left):
Since 1 is not divisible by 11, 5765 is not divisible by 11.
Q3. The sum of a two-digit number and its reverse is 121. Find all possible numbers.
Let the number be . Sum with reverse: .
So . Possible pairs where both are single digits and : .
Numbers: 29, 38, 47, 56, 65, 74, 83, 92. All eight are valid answers.
Q4. If is divisible by both 3 and 9, find .
For divisibility by 9 (which also ensures divisibility by 3): must be divisible by 9.
. (Next would be , not a digit.)
, and the number is 315.
Q5. Prove that the difference of a three-digit number and its reverse is divisible by 99. What is the quotient?
Difference:
This is always divisible by 99. The quotient is , the difference of the hundreds and units digits.
Q6. Solve: where A and B are distinct non-zero digits.
So .
But is a non-zero digit (leading digit of ). No solution exists under the given constraints.
Q7. Find digits and such that: .
Since and are single digits: (i.e., ).
Check: ✓
Q8. A 3-digit number is divisible by 4. Its hundreds digit is 3 times its units digit, and its tens digit is 2. Find all such numbers.
Let units digit = . Hundreds digit = . Tens digit = 2. Number = .
For to be a single digit: .
Numbers: : 321; : 622; : 923.
Divisibility by 4 — check last two digits: 21 ÷ 4 = no; 22 ÷ 4 = no (22 = 4×5 + 2); 23 ÷ 4 = no.
Hmm — let me rewrite: : last two digits are 21, not divisible by 4. : last two digits are 22, not divisible by 4. : last two digits are 23, not divisible by 4.
No solution exists. This teaches an important lesson — not every setup has an answer, and correctly concluding “no solution” with a clean proof is a full-marks answer.
FAQs
Why do we write numbers in general form — can’t we just use the number directly?
The number itself is a specific value. General form lets us do algebra on digits. When you write , you can manipulate and independently — which is how we prove divisibility rules work for all numbers, not just one specific example.
What is the difference between divisibility and division?
Division always gives a result (quotient + remainder). Divisibility is just the question: is the remainder zero? So 17 ÷ 5 = 3 remainder 2, meaning 17 is not divisible by 5.
Does the divisibility test for 9 work if the sum of digits is itself a large number?
Yes — keep applying the sum-of-digits rule recursively. If the digit sum is 27, then , divisible by 9. This recursive property works because the rule itself is based on the same algebraic structure at every level.
In letters-for-digits, can two different letters have the same digit?
By convention in NCERT problems, different letters represent different digits. The problem statement will say “where A, B, C are different digits.” Always read this constraint carefully before solving.
How is playing with numbers related to Chapter 7 (Cubes and Cube Roots) or other chapters?
The general-form algebra you build here is directly used when proving properties of perfect squares and cubes. For example, proving that a perfect square cannot end in 2, 3, 7, or 8 uses the same digit-level reasoning.
Will divisibility rules appear in JEE?
Not as direct questions at JEE Main level, but number theory in JEE Advanced often involves modular arithmetic, which is precisely “what is the remainder when is divided by .” The divisibility rules are a conceptual stepping stone to that.
Can a number be divisible by both 2 and 3 but not by 6?
No. If a number is divisible by both 2 and 3, it is necessarily divisible by (since 2 and 3 are coprime). This is a useful fact for solving problems quickly.
What if the alternating sum test for 11 gives a negative result?
That’s fine. If the alternating sum is or etc., the number is still divisible by 11. Divisibility cares about the magnitude, not the sign. For example, : . : . Both divisible by 11.