Skip to main content
Chapter 5 of 7
NCERT Solutions

Number Play

CBSE · Class 8 · Mathematics

NCERT Solutions for Number Play — CBSE Class 8 Mathematics.

45 questions24 flashcards5 concepts

Interactive on Super Tutor

Studying Number Play? Get the full interactive chapter.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan — built for ncert solutions and more.

1,000+ Class 8 students started this chapter today

37 Questions Solved · 5 Sections

Figure it Out — Divisibility by 9

1Find, without dividing, whether the following numbers are divisible by 9.
(i) 123
(ii) 405
(iii) 8888
(iv) 93547
(v) 358095
Show solution
A number is divisible by 9 if and only if the sum of its digits is divisible by 9.

(i) 123
Sum of digits =1+2+3=6= 1 + 2 + 3 = 6
6 is not divisible by 9.
∴ 123 is not divisible by 9.

(ii) 405
Sum of digits =4+0+5=9= 4 + 0 + 5 = 9
9 is divisible by 9.
∴ 405 is divisible by 9.

(iii) 8888
Sum of digits =8+8+8+8=32= 8 + 8 + 8 + 8 = 32
32 is not divisible by 9.
∴ 8888 is not divisible by 9.

(iv) 93547
Sum of digits =9+3+5+4+7=28= 9 + 3 + 5 + 4 + 7 = 28
28 is not divisible by 9.
∴ 93547 is not divisible by 9.

(v) 358095
Sum of digits =3+5+8+0+9+5=30= 3 + 5 + 8 + 0 + 9 + 5 = 30
30 is not divisible by 9.
∴ 358095 is not divisible by 9.
2Find the smallest multiple of 9 with no odd digits.Show solution
Given: We need the smallest multiple of 9 that contains only even digits (0, 2, 4, 6, 8).

Method: List multiples of 9 and check whether all digits are even.

- 9×1=99 \times 1 = 9 → digit 9 is odd ✗
- 9×2=189 \times 2 = 18 → digit 1 is odd ✗
- 9×3=279 \times 3 = 27 → both digits odd ✗
- 9×4=369 \times 4 = 36 → digit 3 is odd ✗
- 9×5=459 \times 5 = 45 → both digits odd ✗
- 9×6=549 \times 6 = 54 → digit 5 is odd ✗
- 9×7=639 \times 7 = 63 → both digits odd ✗
- 9×8=729 \times 8 = 72 → digit 7 is odd ✗
- 9×9=819 \times 9 = 81 → both digits odd ✗
- 9×10=909 \times 10 = 90 → digit 9 is odd ✗
- Continue checking two-digit multiples... all two-digit multiples of 9 contain at least one odd digit.
- Check three-digit multiples with only even digits. The smallest even-digit number is 200. 200÷9=22.2...200 ÷ 9 = 22.2..., so next multiple is 9×23=2079 × 23 = 207 (odd digit). Keep checking.
- We need digit sum divisible by 9 using only even digits (0,2,4,6,8).
- Smallest such sum = 18 (e.g., digits 2+8+8 or 4+6+8 or 6+6+6, etc.)
- Smallest number with digit sum 18 using only even digits: try 288 → 2+8+8=182+8+8=18 ✓, all even digits ✓.
- Check: 288÷9=32288 ÷ 9 = 32

Answer: The smallest multiple of 9 with no odd digits is 288\boxed{288}.
3Find the multiple of 9 that is closest to the number 6000.Show solution
Given: Find the multiple of 9 nearest to 6000.

Step 1: Divide 6000 by 9.
6000÷9=666.66000 ÷ 9 = 666.\overline{6}

Step 2: The two nearest multiples of 9 are:
- 9×666=59949 \times 666 = 5994
- 9×667=60039 \times 667 = 6003

Step 3: Find the distances:
- 60005994=66000 - 5994 = 6
- 60036000=36003 - 6000 = 3

Step 4: Since 6003 is closer to 6000 (distance 3 < 6),

Answer: The multiple of 9 closest to 6000 is 6003\boxed{6003}.
4How many multiples of 9 are there between the numbers 4300 and 4400?Show solution
Given: Find multiples of 9 strictly between 4300 and 4400.

Step 1: Find the smallest multiple of 9 greater than 4300.
4300÷9=477.74300 ÷ 9 = 477.\overline{7}
So the next multiple is 9×478=43029 \times 478 = 4302.

Step 2: Find the largest multiple of 9 less than 4400.
4400÷9=488.84400 ÷ 9 = 488.\overline{8}
So the largest multiple less than 4400 is 9×488=43929 \times 488 = 4392.

Step 3: Count the multiples from 9×4789 \times 478 to 9×4889 \times 488:
488478+1=11488 - 478 + 1 = 11

Verification: The multiples are 4302, 4311, 4320, 4329, 4338, 4347, 4356, 4365, 4374, 4383, 4392 — that is 11 multiples.

Answer: There are 11\boxed{11} multiples of 9 between 4300 and 4400.

Figure it Out — Digital Roots

1The digital root of an 8-digit number is 5. What will be the digital root of 10 more than that number?Show solution
Given: Digital root of an 8-digit number NN is 5.

Concept: The digital root of a number equals the remainder when divided by 9 (with the convention that if the remainder is 0, the digital root is 9).

So N5(mod9)N \equiv 5 \pmod{9}.

N+105+10=15159=6(mod9)N + 10 \equiv 5 + 10 = 15 \equiv 15 - 9 = 6 \pmod{9}

Answer: The digital root of (N+10)(N + 10) is 6\boxed{6}.
2Write any number. Generate a sequence of numbers by repeatedly adding 11. What would be the digital roots of this sequence of numbers? Share your observations.Show solution
Example: Start with 5.
Sequence: 5, 16, 27, 38, 49, 60, 71, 82, 93, 104, 115, …

Digital roots: 5, 7, 9, 2, 4, 6, 8, 1, 3, 5, 7, …

Observation: Since 112(mod9)11 \equiv 2 \pmod{9}, each time we add 11, the digital root increases by 2 (mod 9). The digital roots form a repeating cycle of length 9, cycling through 9 values with a step of 2:
,5,7,9,2,4,6,8,1,3,5,7,\ldots, 5, 7, 9, 2, 4, 6, 8, 1, 3, 5, 7, \ldots

Generalisation: If the starting number has digital root dd, the sequence of digital roots is d, d+2, d+4, d,\ d+2,\ d+4,\ \ldots (all mod 9, using 9 instead of 0). The pattern repeats every 9 terms and covers all digits 1–9.
3What will be the digital root of the number 9a+36b+139a + 36b + 13?Show solution
Given expression: 9a+36b+139a + 36b + 13

Step 1: Simplify modulo 9.
9a0(mod9)9a \equiv 0 \pmod{9}
36b=4×9×b0(mod9)36b = 4 \times 9 \times b \equiv 0 \pmod{9}
134(mod9)13 \equiv 4 \pmod{9}

Step 2: Therefore,
9a+36b+130+0+4=4(mod9)9a + 36b + 13 \equiv 0 + 0 + 4 = 4 \pmod{9}

Answer: The digital root of 9a+36b+139a + 36b + 13 is 4\boxed{4} (for any whole-number values of aa and bb).
4Make conjectures by examining if there are any patterns or relations between
(i) the parity of a number and its digital root.
(ii) the digital root of a number and the remainder obtained when the number is divided by 3 or 9.
Show solution
(i) Parity and digital root:

Examine examples:
- Even numbers: 2 (DR=2), 4 (DR=4), 12 (DR=3), 18 (DR=9), 20 (DR=2), 22 (DR=4)
- Odd numbers: 1 (DR=1), 3 (DR=3), 11 (DR=2), 19 (DR=1)

Conjecture: There is no fixed relationship between the parity of a number and its digital root. Even numbers can have any digital root (1–9), and so can odd numbers. For example, 12 is even but has digital root 3 (odd), while 11 is odd but has digital root 2 (even).

(ii) Digital root and remainder when divided by 3 or 9:

Examine examples:
| Number | DR | Rem ÷ 9 | Rem ÷ 3 |
|--------|----|---------|---------|
| 14 | 5 | 5 | 2 |
| 18 | 9 | 0 | 0 |
| 21 | 3 | 3 | 0 |
| 25 | 7 | 7 | 1 |

Conjecture 1: The digital root of a number equals its remainder when divided by 9, except when the remainder is 0, in which case the digital root is 9.

Conjecture 2: If the digital root is divisible by 3 (i.e., DR ∈ {3, 6, 9}), then the number is divisible by 3. The remainder when divided by 3 equals (digital root) mod 3. So the digital root and the remainder on division by 3 are directly related.

Figure it Out — Cryptarithms (Section 5.3)

(i)Solve the cryptarithm:
A1
+ 1B
----
B0
Show solution
Given:
A1+  1BB0\begin{array}{r} A1 \\ +\;1B \\ \hline B0 \end{array}

Step 1 — Units column: 1+B=01 + B = 0 or 1+B=101 + B = 10.
Since digits are 0–9, 1+B=10B=91 + B = 10 \Rightarrow B = 9 (with carry 1 to tens column).

Step 2 — Tens column (with carry 1): A+1+1=B=9A + 1 + 1 = B = 9
A+2=9A=7A + 2 = 9 \Rightarrow A = 7

Verification: 71+19=9071 + 19 = 90 ✓ (B = 9, units digit 0 ✓)

Answer: A=7, B=9A = 7,\ B = 9, i.e., 71+19=9071 + 19 = 90.
(ii)Solve the cryptarithm:
AB
+ 37
----
6A
Show solution
Given:
AB+  376A\begin{array}{r} AB \\ +\;37 \\ \hline 6A \end{array}

Step 1 — Units column: B+7=AB + 7 = A or B+7=10+AB + 7 = 10 + A (with carry).

Step 2 — Tens column (no carry): A+3=6A=3A + 3 = 6 \Rightarrow A = 3.

Step 3: Back to units: B+7=A=3B + 7 = A = 3 is impossible (would give negative B).
So there must be a carry: B+7=10+A=13B=6B + 7 = 10 + A = 13 \Rightarrow B = 6.
But then tens column with carry: A+3+1=6A=2A + 3 + 1 = 6 \Rightarrow A = 2.
Check units: B+7=13B=6B + 7 = 13 \Rightarrow B = 6. ✓

Verification: 26+37=6326 + 37 = 63 ✓ (tens digit 6 ✓, units digit 3 = A ✓)

Answer: A=2, B=6A = 2,\ B = 6, i.e., 26+37=6326 + 37 = 63.
(iii)Solve the cryptarithm:
ON
ON
+ ON
----
PO
Show solution
Given:
ONON+  ONPO\begin{array}{r} ON \\ ON \\ +\;ON \\ \hline PO \end{array}

This means 3×ON=PO3 \times \overline{ON} = \overline{PO}.

Step 1 — Units column: 3×N3 \times N ends in O.

Step 2 — Tens column: 3×O+carry=10P+O3 \times O + \text{carry} = 10P + O (since the tens digit of the result is P and units digit is O).
Wait — the result is PO\overline{PO}, a 2-digit number, so 3×O+carry3 \times O + \text{carry} gives tens digit P and we need the units digit of the result to be O.

Actually the result PO\overline{PO} has tens digit P and units digit O.

Step 3: Units: 3NO(mod10)3N \equiv O \pmod{10}, carry c1=3N/10c_1 = \lfloor 3N/10 \rfloor.
Tens: 3O+c1=10P+O3O + c_1 = 10P + O (no further carry since result is 2-digit, so P is a single digit and 3 \times \overline{ON} &lt; 100, meaning ON33\overline{ON} \leq 33, so O3O \leq 3).

From tens: 2O+c1=10P2O + c_1 = 10P. Since O3O \leq 3 and c12c_1 \leq 2, 2O+c182O + c_1 \leq 8, so P=0P = 0? But P is the leading digit — P cannot be 0.

Let me reconsider: 3O+c13O + c_1 gives tens digit P and units digit O.
So 3O+c1=10P+O2O+c1=10P3O + c_1 = 10P + O \Rightarrow 2O + c_1 = 10P.
For P1P \geq 1: 2O+c1102O + c_1 \geq 10. With c12c_1 \leq 2, we need 2O82O \geq 8, so O4O \geq 4.
But if O4O \geq 4, then ON40\overline{ON} \geq 40, and 3×40=1203 \times 40 = 120 — a 3-digit number, contradiction.

So P=0P = 0 is forced, but P can't be 0 as leading digit. Let me re-read: result is PO\overline{PO}, a 2-digit number. Actually if P=0P=0 the result would be a 1-digit number O, which contradicts the layout.

Re-examine: perhaps the result is meant to be a 2-digit number with tens digit P ≠ 0. Try small values of O:
- O=1O=1: 3×1N3 \times 1N. For result to have tens digit P and units digit 1: 3N3N ends in 1 → N=7N=7 (since 3×7=213×7=21, carry 2). Tens: 3×1+2=53×1+2=5. Result tens digit = 5 = P, units = 1 = O ✓. So ON=17\overline{ON}=17, 3×17=51=PO3×17=51=\overline{PO} with P=5, O=1 ✓. All digits: O=1, N=7, P=5 — all different ✓.

Verification: 17+17+17=5117 + 17 + 17 = 51

Answer: O=1, N=7, P=5O = 1,\ N = 7,\ P = 5, i.e., 17+17+17=5117 + 17 + 17 = 51.
(iv)Solve the cryptarithm:
QR
QR
+ QR
----
PRR
Show solution
Given:
QRQR+  QRPRR\begin{array}{r} QR \\ QR \\ +\;QR \\ \hline PRR \end{array}

This means 3×QR=PRR3 \times \overline{QR} = \overline{PRR}, a 3-digit number.

Step 1: PRR\overline{PRR} has the same digit R in both tens and units places.

Step 2 — Units column: 3R3R ends in R, so 3RR(mod10)2R0(mod10)R=03R \equiv R \pmod{10} \Rightarrow 2R \equiv 0 \pmod{10} \Rightarrow R = 0 or R=5R = 5.

Case R = 0: 3×Q0=P003 \times \overline{Q0} = \overline{P00}. Units: 3×0=03×0=0 ✓, carry=0. Tens: 3Q3Q ends in 0 → Q=0Q=0 (but then QR=00, not a proper 2-digit number) or no valid Q. Actually 3Q3Q ends in 0 means Q=0Q=0 or Q=10Q=10 — impossible for a digit. So R=0 gives no valid solution.

Case R = 5: 3×Q5=P553 \times \overline{Q5} = \overline{P55}.
Units: 3×5=153×5=15, units digit 5 ✓, carry = 1.
Tens: 3Q+13Q + 1 ends in 5 → 3Q+15(mod10)3Q4(mod10)3Q + 1 \equiv 5 \pmod{10} \Rightarrow 3Q \equiv 4 \pmod{10}.
Trying digits: Q=8Q=8: 3×8=243×8=24, 24+1=2524+1=25, tens digit 5 ✓, carry 2.
Hundreds: carry = 2 = P. So P=2.

Check: QR=85\overline{QR}=85, 3×85=255=PRR3×85=255=\overline{PRR} with P=2, R=5 ✓. All letters: Q=8, R=5, P=2 — all different ✓.

Verification: 85+85+85=25585 + 85 + 85 = 255

Answer: Q=8, R=5, P=2Q = 8,\ R = 5,\ P = 2, i.e., 85+85+85=25585 + 85 + 85 = 255.
(v)Solve: PQ×8=RSPQ \times 8 = RS (find all valid solutions)Show solution
Given: PQ×8=RS\overline{PQ} \times 8 = \overline{RS}, where P, Q, R, S are distinct digits and the result is a 2-digit number.

Constraints:
- PQ\overline{PQ} is a 2-digit number, so 10PQ9910 \leq \overline{PQ} \leq 99.
- PQ×8\overline{PQ} \times 8 must also be a 2-digit number, so PQ12\overline{PQ} \leq 12 (since 13×8=10413 \times 8 = 104, a 3-digit number).
- PQ10\overline{PQ} \geq 10, so PQ{10,11,12}\overline{PQ} \in \{10, 11, 12\}.
- All four digits P, Q, R, S must be distinct.

Check each:
- 10×8=8010 \times 8 = 80: P=1, Q=0, R=8, S=0. But Q=S=0, not all distinct. ✗
- 11×8=8811 \times 8 = 88: P=Q=1, not distinct. ✗
- 12×8=9612 \times 8 = 96: P=1, Q=2, R=9, S=6. All distinct ✓.

Answer: PQ=12, RS=96PQ = 12,\ RS = 96, i.e., 12×8=9612 \times 8 = 96.
(vi)Solve: GH×H=9KGH \times H = 9K. Pick the solution from: 11×9=99, 12×8=96, 46×2=92, 24×4=96, 47×2=94, 31×3=93, 16×6=96.Show solution
Given: GH×H=9K\overline{GH} \times H = \overline{9K}

Condition: The units digit of GH\overline{GH} is H, and H is also the multiplier. The result is a 2-digit number in the 90s (tens digit = 9).

Check each option for the condition GH×HGH \times H (units digit of the 2-digit number equals the multiplier):

- 11×9=9911 \times 9 = 99: G=1, H=1 — but G and H must be different digits. ✗
- 12×8=9612 \times 8 = 96: Units digit of 12 is 2, but multiplier is 8. H should be units digit = 2, but multiplier = 8 ≠ 2. ✗
- 46×2=9246 \times 2 = 92: Units digit of 46 is 6, multiplier is 2. 6 ≠ 2. ✗
- 24×4=9624 \times 4 = 96: Units digit of 24 is 4, multiplier is 4. H = 4 ✓. G=2, H=4, K=6 — all different ✓. Result is 96 (in the 90s) ✓.
- 47imes2=9447 imes 2 = 94: Units digit of 47 is 7, multiplier is 2. 7 ≠ 2. ✗
- 31×3=9331 \times 3 = 93: Units digit of 31 is 1, multiplier is 3. 1 ≠ 3. ✗
- 16×6=9616 \times 6 = 96: Units digit of 16 is 6, multiplier is 6. H = 6 ✓. G=1, H=6, K=6 — but H=K=6, not all distinct. ✗

Answer: GH×H=24×4=96GH \times H = 24 \times 4 = 96, so G=2, H=4, K=6G=2,\ H=4,\ K=6.
(vii)Solve: BYE×6=RAYBYE \times 6 = RAY. Given that B=1 and Y is even and less than 7.Show solution
Given: BYE×6=RAY\overline{BYE} \times 6 = \overline{RAY}, with B=1, Y is even, Y &lt; 7.

So 1YE×6=RAY\overline{1YE} \times 6 = \overline{RAY}.

Possible even values of Y: 0, 2, 4, 6 — but Y < 7, so Y ∈ {0, 2, 4, 6}.

Units digit condition: 6×E6 \times E must end in Y.

Try Y = 2: 6E6E ends in 2 → E=2E = 2 (gives 12) or E=7E = 7 (gives 42). But E ≠ Y = 2, so E = 7.
1YE=127\overline{1YE} = 127. 127×6=762127 \times 6 = 762. Result = RAY=762\overline{RAY} = 762: R=7, A=6, Y=2 ✓. Check Y=2 in result ✓. All digits B=1,Y=2,E=7,R=7,A=6 — but E=R=7, not all distinct. ✗

Try Y = 4: 6E6E ends in 4 → E=4E = 4 (gives 24, but E≠Y) or E=9E = 9 (gives 54).
E = 9: 1YE=149\overline{1YE} = 149. 149×6=894149 \times 6 = 894. Result RAY\overline{RAY}: R=8, A=9, Y=4 ✓. Check: A=9=E — not all distinct. ✗
E = 4: E=Y=4, not distinct. ✗

Try Y = 6: 6E6E ends in 6 → E=1E = 1 (gives 6, no — 6×1=66×1=6 ✓) or E=6E=6 (E=Y ✗).
E=1: but B=1=E, not distinct. ✗
Also E=6E=6: E=Y ✗.

Try Y = 0: 6E6E ends in 0 → E=0E = 0 (E=Y ✗) or E=5E=5.
E=5: 1YE=105\overline{1YE}=105. 105×6=630105 \times 6=630. Result RAY=630\overline{RAY}=630: R=6, A=3, Y=0 ✓. All digits: B=1,Y=0,E=5,R=6,A=3 — all distinct ✓.

Verification: 105×6=630105 \times 6 = 630

Answer: B=1, Y=0, E=5, R=6, A=3B=1,\ Y=0,\ E=5,\ R=6,\ A=3, i.e., 105×6=630105 \times 6 = 630.

Figure it Out — Cryptarithms (Solve the following)

(i)Solve: UT×3=PUTUT \times 3 = PUTShow solution
Given: UT×3=PUT\overline{UT} \times 3 = \overline{PUT}

PUT\overline{PUT} is a 3-digit number and UT\overline{UT} is a 2-digit number.

PUT=100P+UT\overline{PUT} = 100P + \overline{UT}

So: 3×UT=100P+UT3 \times \overline{UT} = 100P + \overline{UT}
2×UT=100P2 \times \overline{UT} = 100P
UT=50P\overline{UT} = 50P

Since UT\overline{UT} is a 2-digit number: 1050P9910 \leq 50P \leq 99.
Only P=1P=1 works: UT=50\overline{UT} = 50.

Check: U=5,T=0,P=1U=5, T=0, P=1. All distinct ✓.
50×3=150=PUT50 \times 3 = 150 = \overline{PUT} with P=1, U=5, T=0 ✓.

Answer: U=5, T=0, P=1U=5,\ T=0,\ P=1, i.e., 50×3=15050 \times 3 = 150.
(ii)Solve: AB×5=BCAB \times 5 = BCShow solution
Given: AB×5=BC\overline{AB} \times 5 = \overline{BC}

Both are 2-digit numbers, so AB19\overline{AB} \leq 19 (since 20×5=10020 \times 5 = 100, a 3-digit number).
Also AB10\overline{AB} \geq 10, so AB{10,11,...,19}\overline{AB} \in \{10, 11, ..., 19\}, meaning A=1A=1.

BC\overline{BC} has tens digit B (same as units digit of AB\overline{AB}).

So 1B×5=BC\overline{1B} \times 5 = \overline{BC}.

Units digit of 5×B5 \times B must equal C, and tens digit of result must equal B.

Try values of B (0–9):
- B=0B=0: 10×5=5010 \times 5=50. Result BC=50\overline{BC}=50: B=5≠0. ✗
- B=1B=1: 11×5=5511 \times 5=55. Result: tens=5≠1. ✗
- B=2B=2: 12×5=6012 \times 5=60. Result: tens=6≠2. ✗
- B=3B=3: 13×5=6513 \times 5=65. Result: tens=6≠3. ✗
- B=4B=4: 14×5=7014 \times 5=70. Result: tens=7≠4. ✗
- B=5B=5: 15×5=7515 \times 5=75. Result: tens=7≠5. ✗
- B=6B=6: 16×5=8016 \times 5=80. Result: tens=8≠6. ✗
- B=7B=7: 17×5=8517 \times 5=85. Result: tens=8≠7. ✗
- B=8B=8: 18×5=9018 \times 5=90. Result: tens=9≠8. ✗
- B=9B=9: 19×5=9519 \times 5=95. Result: tens=9=B ✓, units=5=C. A=1,B=9,C=5 — all distinct ✓.

Answer: A=1, B=9, C=5A=1,\ B=9,\ C=5, i.e., 19×5=9519 \times 5 = 95.
(iii)Solve: L2N×2=2NPL2N \times 2 = 2NPShow solution
Given: L2N×2=2NP\overline{L2N} \times 2 = \overline{2NP}

The result 2NP\overline{2NP} starts with 2, so 2002NP299200 \leq \overline{2NP} \leq 299, meaning 100L2N149100 \leq \overline{L2N} \leq 149, so L=1L=1.

12N×2=2NP\overline{12N} \times 2 = \overline{2NP}

Units: 2N2N ends in P, carry c=2N/10c = \lfloor 2N/10 \rfloor.
Tens: 2×2+c=4+c2 \times 2 + c = 4 + c must end in N (tens digit of result is N).
Hundreds: carry from tens gives hundreds digit = 2 ✓ (already fixed).

From tens: 4+cN(mod10)4 + c \equiv N \pmod{10}, and carry to hundreds = (4+c)/10\lfloor(4+c)/10\rfloor.
Since result hundreds digit is 2 and \overline{12N} \times 2 &lt; 300, the hundreds carry must be 0 or 1.
Actually 12N×2\overline{12N} \times 2: max is 129×2=258129 \times 2 = 258, min is 120×2=240120 \times 2 = 240. So hundreds digit is always 2 ✓.

From tens column: 4+c4 + c gives tens digit N (no carry to hundreds since result is in 200s and 4+c54+c \leq 5, so no carry). Thus N=4+cN = 4 + c.

c=0c = 0: N=4N=4, then units: 2×4=82×4=8, P=8. Check: L2N=124\overline{L2N}=124, 124×2=248=2NP124×2=248=\overline{2NP}: 2,4,8 ✓. L=1,N=4,P=8 — all distinct ✓.
c=1c=1: N=5N=5, then 2N2N has carry 1 means 2×5=102×5=10, P=0. Check: 125×2=250=2NP125×2=250=\overline{2NP}: 2,5,0 ✓. L=1,N=5,P=0 — all distinct ✓.

Both are valid solutions.

Answer: L=1, N=4, P=8L=1,\ N=4,\ P=8 (i.e., 124×2=248124 \times 2 = 248) or L=1, N=5, P=0L=1,\ N=5,\ P=0 (i.e., 125×2=250125 \times 2 = 250).
(iv)Solve: XY×4=ZXXY \times 4 = ZXShow solution
Given: XY×4=ZX\overline{XY} \times 4 = \overline{ZX}

Both are 2-digit numbers, so XY24\overline{XY} \leq 24 (since 25×4=10025 \times 4 = 100).
Also XY10\overline{XY} \geq 10.

The units digit of the result ZX\overline{ZX} is X (same as tens digit of XY\overline{XY}).

Try X = 1 (so XY{10,...,19}\overline{XY} \in \{10,...,19\}):
Result ZX\overline{ZX} ends in 1. 4Y4Y ends in 1 — impossible (4×any digit is even or ends in 0,4,8,2,6). ✗

Try X = 2 (so XY{20,21,22,23,24}\overline{XY} \in \{20,21,22,23,24\}):
Result ZX\overline{ZX} ends in 2. 4Y4Y ends in 2 → Y=3Y=3 (4×3=12) or Y=8Y=8 (4×8=32).
- Y=3Y=3: 23×4=9223 \times 4=92. Result ZX=92\overline{ZX}=92: Z=9, X=2 ✓. X=2,Y=3,Z=9 — all distinct ✓.
- Y=8Y=8: 28×4=11228 \times 4=112, 3-digit. ✗

Answer: X=2, Y=3, Z=9X=2,\ Y=3,\ Z=9, i.e., 23×4=9223 \times 4 = 92.
(v)Solve: PP×QQ=PRPPP \times QQ = PRPShow solution
Given: PP×QQ=PRP\overline{PP} \times \overline{QQ} = \overline{PRP}

PP=11P\overline{PP} = 11P and QQ=11Q\overline{QQ} = 11Q.

So 11P×11Q=121PQ=PRP11P \times 11Q = 121PQ = \overline{PRP}.

PRP=100P+10R+P=101P+10R\overline{PRP} = 100P + 10R + P = 101P + 10R.

So: 121PQ=101P+10R121PQ = 101P + 10R
121PQ101P=10R121PQ - 101P = 10R
P(121Q101)=10RP(121Q - 101) = 10R

Since R is a single digit (0R90 \leq R \leq 9), 10R9010R \leq 90.
Also P1P \geq 1 (leading digit).

Try small values:
- Q=1Q=1: 121×1101=20121×1-101=20. 20P=10R2P=R20P=10R \Rightarrow 2P=R. P can be 1,2,3,4 (R≤9 means P≤4).
- P=1: R=2. PP=11,QQ=11\overline{PP}=11, \overline{QQ}=11. But P=Q=1, not distinct. ✗
- P=2: R=4. PP=22,QQ=11\overline{PP}=22, \overline{QQ}=11. 22×11=242=PRP22×11=242=\overline{PRP}: P=2,R=4,P=2 ✓. P=2,Q=1,R=4 — all distinct ✓.
- P=3: R=6. 33×11=363=PRP33×11=363=\overline{PRP}: P=3,R=6,P=3 ✓. P=3,Q=1,R=6 — all distinct ✓.
- P=4: R=8. 44×11=484=PRP44×11=484=\overline{PRP}: P=4,R=8,P=4 ✓. P=4,Q=1,R=8 — all distinct ✓.

All three are valid.

Answer: Multiple solutions exist:
- P=2, Q=1, R=4P=2,\ Q=1,\ R=4: 22×11=24222 \times 11 = 242
- P=3, Q=1, R=6P=3,\ Q=1,\ R=6: 33×11=36333 \times 11 = 363
- P=4, Q=1, R=8P=4,\ Q=1,\ R=8: 44×11=48444 \times 11 = 484
(vi)Solve: JK×6=KKKJK \times 6 = KKKShow solution
Given: JK×6=KKK\overline{JK} \times 6 = \overline{KKK}

KKK=111K=3×37×K\overline{KKK} = 111K = 3 \times 37 \times K.

Also JK×6=111K\overline{JK} \times 6 = 111K, so JK=111K6=37K2\overline{JK} = \dfrac{111K}{6} = \dfrac{37K}{2}.

For JK\overline{JK} to be an integer, K must be even. Even digits: 0, 2, 4, 6, 8.

- K=0: JK=0\overline{JK}=0, not a 2-digit number. ✗
- K=2: JK=37\overline{JK}=37. J=3, K=7≠2. ✗
- K=4: JK=74\overline{JK}=74. J=7, K=4 ✓. Check: 74×6=444=KKK74 \times 6=444=\overline{KKK} ✓. J=7,K=4 distinct ✓.
- K=6: JK=111\overline{JK}=111, 3-digit. ✗
- K=8: JK=148\overline{JK}=148, 3-digit. ✗

Answer: J=7, K=4J=7,\ K=4, i.e., 74×6=44474 \times 6 = 444.

Figure it Out — Divisibility (Main Exercise)

1If 31z5 is a multiple of 9, where z is a digit, what is the value of z? Explain why there are two answers to this problem.Show solution
Given: 31z531z5 is a multiple of 9.

Condition: Sum of digits must be divisible by 9.
3+1+z+5=9+z3 + 1 + z + 5 = 9 + z

For 9+z9 + z to be divisible by 9:
- 9+z=9z=09 + z = 9 \Rightarrow z = 0
- 9+z=18z=99 + z = 18 \Rightarrow z = 9

Why two answers? Since zz is a single digit (0–9), both z=0z=0 and z=9z=9 make the digit sum a multiple of 9. There is no other multiple of 9 in the range [9,18][9, 18] that 9+z9+z can equal for a single digit zz.

Verification:
- z=0z=0: 31053105, digit sum =9=9 ✓, 3105÷9=3453105 ÷ 9 = 345
- z=9z=9: 31953195, digit sum =18=18 ✓, 3195÷9=3553195 ÷ 9 = 355

Answer: z=0z = 0 or z=9z = 9.
2"I take a number that leaves a remainder of 8 when divided by 12. I take another number which is 4 short of a multiple of 12. Their sum will always be a multiple of 8", claims Snehal. Examine his claim and justify your conclusion.Show solution
Given:
- First number aa: a8(mod12)a \equiv 8 \pmod{12}, so a=12m+8a = 12m + 8 for some integer m0m \geq 0.
- Second number bb: bb is 4 short of a multiple of 12, so b=12n4b = 12n - 4 for some integer n1n \geq 1.

Sum:
a+b=(12m+8)+(12n4)=12m+12n+4=12(m+n)+4a + b = (12m + 8) + (12n - 4) = 12m + 12n + 4 = 12(m+n) + 4

Check divisibility by 8:
12(m+n)+4=4[3(m+n)+1]12(m+n) + 4 = 4[3(m+n) + 1]

This is always divisible by 4, but is it always divisible by 8?

For divisibility by 8, we need 3(m+n)+13(m+n)+1 to be even, i.e., 3(m+n)3(m+n) to be odd, i.e., (m+n)(m+n) to be odd.

But (m+n)(m+n) can be either odd or even depending on the choice of mm and nn.

Counterexample: Let m=0,n=1m=0, n=1: a=8a=8, b=8b=8. Sum =16=2×8=16=2\times8 ✓ (divisible by 8).
Let m=1,n=1m=1, n=1: a=20a=20, b=8b=8. Sum =28=28. 28÷8=3.528÷8=3.5not divisible by 8. ✗

Conclusion: Snehal's claim is false. The sum is always divisible by 4, but not always by 8. For example, 20+8=2820 + 8 = 28 is not a multiple of 8.
3When is the sum of two multiples of 3, a multiple of 6 and when is it not? Explain the different possible cases, and generalise the pattern.Show solution
Let the two multiples of 3 be 3a3a and 3b3b.

Sum: 3a+3b=3(a+b)3a + 3b = 3(a+b).

For the sum to be a multiple of 6, we need 3(a+b)3(a+b) to be divisible by 6, i.e., (a+b)(a+b) must be divisible by 2, i.e., (a+b)(a+b) must be even.

(a+b)(a+b) is even when both aa and bb are even, or both are odd.

Cases:

Case 1: Both multiples of 3 are even (i.e., multiples of 6): e.g., 6+12=186 + 12 = 18 ✓ (multiple of 6).

Case 2: Both multiples of 3 are odd (not multiples of 6): e.g., 3+9=123 + 9 = 12 ✓ (multiple of 6).

Case 3: One multiple of 3 is even and the other is odd: e.g., 3+6=93 + 6 = 9not a multiple of 6.

Generalisation:
- Sum of two multiples of 3 is a multiple of 6 if and only if both are even multiples of 3 (multiples of 6) or both are odd multiples of 3.
- The sum is not a multiple of 6 when one is an even multiple and the other is an odd multiple of 3.
4Sreelatha says, "I have a number that is divisible by 9. If I reverse its digits, it will still be divisible by 9".
(i) Examine if her conjecture is true for any multiple of 9.
(ii) Are any other digit shuffles possible such that the number formed is still a multiple of 9?
Show solution
(i) Reversing digits of a multiple of 9:

Concept: A number is divisible by 9 if and only if its digit sum is divisible by 9.

When we reverse the digits of a number, the digit sum remains the same (we are just rearranging the same digits).

Since the digit sum is unchanged, if the original number is divisible by 9, the reversed number also has the same digit sum, which is divisible by 9.

Therefore, Sreelatha's conjecture is TRUE for any multiple of 9.

Example: 198198 (digit sum =18=18, divisible by 9). Reversed: 891891 (digit sum =18=18) ✓.

(ii) Other digit shuffles:

Yes! Any rearrangement (shuffle) of the digits of a multiple of 9 will still be a multiple of 9, because any permutation of the digits gives the same digit sum.

Example: 13591359 is a multiple of 9 (digit sum =18=18). Any arrangement like 95319531, 39513951, 59135913, etc., will also be a multiple of 9.

Conclusion: Any permutation of the digits of a multiple of 9 gives another multiple of 9 (provided the rearranged number doesn't have a leading zero making it a number with fewer digits).
5If 48a23b is a multiple of 18, list all possible pairs of values for a and b.Show solution
Given: 48a23b48a23b is a multiple of 18.

A number is a multiple of 18 if it is divisible by both 2 and 9.

Divisibility by 2: The units digit bb must be even. So b{0,2,4,6,8}b \in \{0, 2, 4, 6, 8\}.

Divisibility by 9: Sum of digits must be divisible by 9.
4+8+a+2+3+b=17+a+b4 + 8 + a + 2 + 3 + b = 17 + a + b

For 17+a+b17 + a + b to be divisible by 9:
- 17+a+b=18a+b=117 + a + b = 18 \Rightarrow a + b = 1
- 17+a+b=27a+b=1017 + a + b = 27 \Rightarrow a + b = 10
- 17+a+b=36a+b=1917 + a + b = 36 \Rightarrow a + b = 19 (max is 9+9=189+9=18, impossible)

Case 1: a+b=1a + b = 1 with bb even:
- b=0,a=1b=0, a=1
- b=2,a=1b=2, a=-1 ✗ (not a digit)

Case 2: a+b=10a + b = 10 with bb even:
- b=0,a=10b=0, a=10
- b=2,a=8b=2, a=8
- b=4,a=6b=4, a=6
- b=6,a=4b=6, a=4
- b=8,a=2b=8, a=2

All possible pairs (a,b)(a, b):
(1, 0), (8, 2), (6, 4), (4, 6), (2, 8)(1,\ 0),\ (8,\ 2),\ (6,\ 4),\ (4,\ 6),\ (2,\ 8)
6If 3p7q83p7q8 is divisible by 44, list all possible pairs of values for pp and qq.Show solution
Given: 3p7q83p7q8 is divisible by 44.

44=4×1144 = 4 \times 11, and gcd(4,11)=1\gcd(4,11)=1, so the number must be divisible by both 4 and 11.

Divisibility by 4: Last two digits q8q8 must be divisible by 4.
q8=10q+8\overline{q8} = 10q + 8. For divisibility by 4: (10q+8)÷4(10q+8) \div 4 must be integer.
10q+82q+02q(mod4)10q + 8 \equiv 2q + 0 \equiv 2q \pmod{4} (since 808 \equiv 0 and 10210 \equiv 2).
So 2q0(mod4)q2q \equiv 0 \pmod{4} \Rightarrow q is even.
q{0,2,4,6,8}q \in \{0, 2, 4, 6, 8\}.

Divisibility by 11: Alternating digit sum rule.
Digits of 3p7q83p7q8 (left to right): 3, p, 7, q, 8.
(sum of digits at odd positions)(sum at even positions)(\text{sum of digits at odd positions}) - (\text{sum at even positions})
=(3+7+8)(p+q)=18pq= (3 + 7 + 8) - (p + q) = 18 - p - q

For divisibility by 11: 18pq0(mod11)18 - p - q \equiv 0 \pmod{11}
- 18pq=0p+q=1818 - p - q = 0 \Rightarrow p + q = 18 (max is 9+9=18, so p=9,q=9)
- 18pq=11p+q=718 - p - q = 11 \Rightarrow p + q = 7
- 18pq=11p+q=2918 - p - q = -11 \Rightarrow p + q = 29 (impossible)
- 18pq=22p+q=418 - p - q = 22 \Rightarrow p + q = -4 (impossible)

Case 1: p+q=18p + q = 18, qq even:
p=9,q=9p=9, q=9 — but 9 is odd. ✗

Case 2: p+q=7p + q = 7, qq even:
- q=0,p=7q=0, p=7
- q=2,p=5q=2, p=5
- q=4,p=3q=4, p=3
- q=6,p=1q=6, p=1
- q=8,p=1q=8, p=-1

All possible pairs (p,q)(p, q):
(7, 0), (5, 2), (3, 4), (1, 6)(7,\ 0),\ (5,\ 2),\ (3,\ 4),\ (1,\ 6)
7Find three consecutive numbers such that the first number is a multiple of 2, the second number is a multiple of 3, and the third number is a multiple of 4. Are there more such numbers? How often do they occur?Show solution
Let the three consecutive numbers be n, n+1, n+2n,\ n+1,\ n+2.

Conditions:
- nn is a multiple of 2: n=2kn = 2k
- n+1n+1 is a multiple of 3: n2(mod3)n \equiv 2 \pmod{3}
- n+2n+2 is a multiple of 4: n2(mod4)n \equiv 2 \pmod{4}

From condition 3: n2(mod4)n \equiv 2 \pmod{4}, so n{2,6,10,14,18,22,26,30,...}n \in \{2, 6, 10, 14, 18, 22, 26, 30, ...\}.

Also need n2(mod3)n \equiv 2 \pmod{3}:
Check: n=2n=2: 2mod3=22 \mod 3 = 2 ✓. Numbers: 2, 3, 4. Check: 2 is multiple of 2 ✓, 3 is multiple of 3 ✓, 4 is multiple of 4 ✓.

Find the pattern: We need n2(mod4)n \equiv 2 \pmod{4} and n2(mod3)n \equiv 2 \pmod{3}.
By CRT: n2(modlcm(4,3))=n2(mod12)n \equiv 2 \pmod{\text{lcm}(4,3)} = n \equiv 2 \pmod{12}.

So n=12m+2n = 12m + 2 for m=0,1,2,...m = 0, 1, 2, ...

Solutions: n=2,14,26,38,50,...n = 2, 14, 26, 38, 50, ...

Verification for n=14n=14: 14 (multiple of 2 ✓), 15 (multiple of 3 ✓), 16 (multiple of 4 ✓).

Answer: Yes, there are infinitely many such triples. They occur every 12 consecutive integers. The first few are: (2,3,4), (14,15,16), (26,27,28), (38,39,40),(2,3,4),\ (14,15,16),\ (26,27,28),\ (38,39,40), \ldots
8Write five multiples of 36 between 45,000 and 47,000. Share your approach with the class.Show solution
Approach: Find multiples of 36 in the range (45000,47000)(45000, 47000).

Step 1: 45000÷36=125045000 ÷ 36 = 1250. So 36×1250=4500036 \times 1250 = 45000.

Step 2: The next multiples are:
- 36×1251=4503636 \times 1251 = 45036
- 36×1252=4507236 \times 1252 = 45072
- 36×1253=4510836 \times 1253 = 45108
- 36×1254=4514436 \times 1254 = 45144
- 36×1255=4518036 \times 1255 = 45180

Verification: 36×1255=36×1000+36×255=36000+9180=4518036 \times 1255 = 36 \times 1000 + 36 \times 255 = 36000 + 9180 = 45180 ✓. All are between 45000 and 47000 ✓.

Answer: Five multiples of 36 between 45,000 and 47,000 are: 45036, 45072, 45108, 45144, 45180.
9The middle number in the sequence of 5 consecutive even numbers is 5p5p. Express the other four numbers in sequence in terms of pp.Show solution
Given: 5 consecutive even numbers with middle number =5p= 5p.

Concept: Consecutive even numbers differ by 2.

If the middle (3rd) number is 5p5p, then:
- 1st number: 5p45p - 4
- 2nd number: 5p25p - 2
- 3rd number: 5p5p (middle)
- 4th number: 5p+25p + 2
- 5th number: 5p+45p + 4

Note: For these to be even numbers, 5p5p must be even, which means pp must be even.

Answer: The five consecutive even numbers in sequence are:
5p4, 5p2, 5p, 5p+2, 5p+45p-4,\ 5p-2,\ 5p,\ 5p+2,\ 5p+4
10Write a 6-digit number that is divisible by 15, such that when the digits are reversed, it is divisible by 6.Show solution
Conditions:
- 6-digit number divisible by 15: must be divisible by both 3 and 5, so units digit is 0 or 5, and digit sum is divisible by 3.
- When reversed, divisible by 6: reversed number must be divisible by both 2 and 3.
- Divisible by 2: units digit of reversed number (= first digit of original) must be even.
- Divisible by 3: digit sum of reversed = digit sum of original (same digits), so if original is divisible by 3, reversed is also divisible by 3 ✓.

So we need:
1. Units digit of original = 0 or 5 (for divisibility by 5).
2. First digit of original is even (for reversed number to be divisible by 2).
3. Digit sum divisible by 3 (for divisibility by 3 and hence 15).

If units digit = 0: Reversed number ends in 0, which is even ✓. First digit must be even.

Construction: Let the number be 2____02\_\_\_\_0 (first digit 2, last digit 0).
Choose: 210030210030. Digit sum =2+1+0+0+3+0=6= 2+1+0+0+3+0=6, divisible by 3 ✓. Divisible by 5 (ends in 0) ✓. Divisible by 15 ✓.
Reversed: 030012=30012030012 = 30012. But this is a 5-digit number — the leading zero is a problem.

Let first digit be even and non-zero, last digit = 0:
Number:  2____0\ 2\_\_\_\_0. Reversed starts with 0 — invalid as a 6-digit number.

If units digit = 5: Reversed number ends in 5 (odd) — not divisible by 2. ✗

Revised approach: For the reversed number to be a valid 6-digit number, the last digit of the original must be non-zero. So units digit = 5 (since units digit must be 0 or 5 for divisibility by 5, and 0 would make reversed number start with 0).

But units digit = 5 makes reversed number end in 5 (odd), so not divisible by 2, hence not by 6. ✗

Resolution: The problem may allow the reversed number to start with 0 (treating it as a number with fewer digits), or the units digit is 0 and we accept the reversed number as a 5-digit number divisible by 6.

Example: 420000420000. Digit sum =6= 6 ✓, ends in 0 ✓, divisible by 15 ✓. Reversed: 000024=24000024 = 24. 24÷6=424 ÷ 6 = 4 ✓.

A cleaner example:  123450\ 123450. Digit sum =15=15 ✓, ends in 0 ✓, divisible by 15 ✓. Reversed: 054321=54321054321=54321 (5-digit). 54321÷254321÷2 — odd, not divisible by 2. ✗

Let first digit be even:  213450\ 213450. Digit sum =15=15 ✓. Reversed: 054312=54312054312=54312. 54312÷6=905254312÷6=9052 ✓.

Answer: One valid 6-digit number is 213450\mathbf{213450}.
- 213450÷15=14230213450 ÷ 15 = 14230
- Reversed: 054312=54312054312 = 54312; 54312÷6=905254312 ÷ 6 = 9052
11Deepak claims, "There are some multiples of 11 which, when doubled, are still multiples of 11. But other multiples of 11 don't remain multiples of 11 when doubled". Examine if his conjecture is true; explain your conclusion.Show solution
Let NN be a multiple of 11, so N=11kN = 11k for some integer kk.

Doubling: 2N=2×11k=11×(2k)2N = 2 \times 11k = 11 \times (2k).

Since 2k2k is always an integer, 2N2N is always a multiple of 11.

Conclusion: Deepak's claim is FALSE. Every multiple of 11, when doubled, is still a multiple of 11.

Reason: 11N112N11 \mid N \Rightarrow 11 \mid 2N (since 11 is a prime and does not divide 2, but 11N11 \mid N directly implies 112N11 \mid 2N).

Example: 11×3=3311 \times 3 = 33; 2×33=66=11×62 \times 33 = 66 = 11 \times 6 ✓. 11×7=7711 \times 7 = 77; 2×77=154=11×142 \times 77 = 154 = 11 \times 14 ✓.
12Determine whether the statements below are 'Always True', 'Sometimes True', or 'Never True'. Explain your reasoning.
(i) The product of a multiple of 6 and a multiple of 3 is a multiple of 9.
(ii) The sum of three consecutive even numbers will be divisible by 6.
(iii) If abcdef is a multiple of 6, then badcef will be a multiple of 6.
(iv) 8(7b3)4(11b+1)8(7b - 3) - 4(11b + 1) is a multiple of 12.
Show solution
(i) Product of a multiple of 6 and a multiple of 3 is a multiple of 9:

Let the numbers be 6a6a and 3b3b. Product =18ab=9×2ab= 18ab = 9 \times 2ab.
This is always a multiple of 9.

Answer: Always True.

---

(ii) Sum of three consecutive even numbers is divisible by 6:

Let the three consecutive even numbers be 2k2, 2k, 2k+22k-2,\ 2k,\ 2k+2.
Sum =6k= 6k, which is always divisible by 6.

Answer: Always True.

---

(iii) If abcdefabcdef is a multiple of 6, then badcefbadcef is a multiple of 6:

A number is divisible by 6 if it is divisible by both 2 and 3.

- Divisibility by 3: Both abcdefabcdef and badcefbadcef have the same digits (just rearranged), so the same digit sum. If abcdefabcdef is divisible by 3, so is badcefbadcef. ✓
- Divisibility by 2: abcdefabcdef ends in ff (even). badcefbadcef also ends in ff (even). ✓

Since both conditions hold, badcefbadcef is always divisible by 6.

Answer: Always True.

---

(iv) 8(7b3)4(11b+1)8(7b-3) - 4(11b+1) is a multiple of 12:

Simplify:
8(7b3)4(11b+1)=56b2444b4=12b288(7b-3) - 4(11b+1) = 56b - 24 - 44b - 4 = 12b - 28
=12b28=4(3b7)= 12b - 28 = 4(3b - 7)

For this to be a multiple of 12, we need 3b73b-7 to be a multiple of 3.
3b7712(mod3)3b - 7 \equiv -7 \equiv -1 \equiv 2 \pmod{3}.
This is never 0(mod3)\equiv 0 \pmod{3}.

So 4(3b7)4(3b-7) is divisible by 4 but never by 12.

Counterexample: b=1b=1: 12(1)28=1612(1)-28 = -16. 16÷12-16 ÷ 12 is not an integer. ✓ (confirms not always multiple of 12)

Answer: Never True.
13Choose any 3 numbers. When is their sum divisible by 3? Explore all possible cases and generalise.Show solution
Let three numbers be aa, bb, cc. Every integer has a remainder of 0, 1, or 2 when divided by 3.

Let ar1a \equiv r_1, br2b \equiv r_2, cr3(mod3)c \equiv r_3 \pmod{3}, where r1,r2,r3{0,1,2}r_1, r_2, r_3 \in \{0,1,2\}.

a+b+cr1+r2+r3(mod3)a+b+c \equiv r_1+r_2+r_3 \pmod{3}.

The sum is divisible by 3 when r1+r2+r30(mod3)r_1+r_2+r_3 \equiv 0 \pmod{3}.

Cases when sum IS divisible by 3:
1. All three have remainder 0: (0,0,0)(0,0,0) — all multiples of 3. e.g., 3+6+9=183+6+9=18
2. All three have remainder 1: (1,1,1)(1,1,1). e.g., 1+4+7=121+4+7=12
3. All three have remainder 2: (2,2,2)(2,2,2). e.g., 2+5+8=152+5+8=15
4. One each of remainders 0, 1, 2: (0,1,2)(0,1,2). e.g., 3+1+2=63+1+2=6

Cases when sum is NOT divisible by 3: Any other combination, e.g., (0,0,1),(0,0,2),(1,1,0),(1,1,2),(2,2,0),(2,2,1)(0,0,1), (0,0,2), (1,1,0), (1,1,2), (2,2,0), (2,2,1).

Generalisation: The sum of three numbers is divisible by 3 if and only if either all three numbers have the same remainder when divided by 3, or the three remainders are 0, 1, and 2 (one of each).
14Is the product of two consecutive integers always a multiple of 2? Why? What about the product of three consecutive integers? Is it always a multiple of 6? Why or why not? What can you say about the product of 4 consecutive integers? What about the product of five consecutive integers?Show solution
Product of 2 consecutive integers:

Consecutive integers are nn and n+1n+1. One of them must be even (since they are of different parity). Therefore their product is always even.

Always a multiple of 2. ✓

---

Product of 3 consecutive integers:

Let the integers be n,n+1,n+2n, n+1, n+2.
- Among any 3 consecutive integers, at least one is divisible by 2 and exactly one is divisible by 3.
- So the product is divisible by 2×3=62 \times 3 = 6.

Always a multiple of 6. ✓

*Example:* 4×5×6=120=6×204 \times 5 \times 6 = 120 = 6 \times 20 ✓; 5×6×7=210=6×355 \times 6 \times 7 = 210 = 6 \times 35 ✓.

---

Product of 4 consecutive integers:

Let the integers be n,n+1,n+2,n+3n, n+1, n+2, n+3.
- Among 4 consecutive integers, at least two are even (one may be divisible by 4), and at least one is divisible by 3.
- The product is divisible by 4×2×3=244 \times 2 \times 3 = 24.

Always a multiple of 24. ✓

*Example:* 3×4×5×6=360=24×153 \times 4 \times 5 \times 6 = 360 = 24 \times 15 ✓.

---

Product of 5 consecutive integers:

Among 5 consecutive integers, there is at least one multiple of 5, at least one multiple of 4 (or two multiples of 2), and at least one multiple of 3.

The product is always divisible by 5!=1205! = 120.

Always a multiple of 120. ✓

*Example:* 2×3×4×5×6=720=120×62 \times 3 \times 4 \times 5 \times 6 = 720 = 120 \times 6 ✓.

General Rule: The product of nn consecutive integers is always divisible by n!n!.
15Solve the cryptarithms:
(i) EF×E=GGGEF \times E = GGG
(ii) WOW×5=MEOWWOW \times 5 = MEOW
Show solution
(i) EF×E=GGGEF \times E = GGG

GGG=111G=3×37×G\overline{GGG} = 111G = 3 \times 37 \times G.

EF×E=111G\overline{EF} \times E = 111G.

Note 111=3×37111 = 3 \times 37. Try E=7E=7: 7F×7=111G\overline{7F} \times 7 = 111G.
7F=111G/7\overline{7F} = 111G/7. For integer result, GG must be divisible by 7. G=7G=7: 7F=111\overline{7F}=111, 3-digit. ✗

Try E=3E=3: 3F×3=111G\overline{3F} \times 3 = 111G. 3F=37G\overline{3F} = 37G. For 3F\overline{3F} to be a 2-digit number starting with 3: 3037G3930 \leq 37G \leq 39. G=1G=1: 37×1=3737 \times 1=37. So EF=37\overline{EF}=37? But E=3 and 3F=37\overline{3F}=37 means F=7. Check: 37×3=111=GGG37 \times 3=111=\overline{GGG} with G=1 ✓. E=3, F=7, G=1 — all distinct ✓.

Verification: 37×3=11137 \times 3 = 111

Answer (i): E=3, F=7, G=1E=3,\ F=7,\ G=1, i.e., 37×3=11137 \times 3 = 111.

---

(ii) WOW×5=MEOWWOW \times 5 = MEOW

WOW\overline{WOW} is a 3-digit number, MEOW\overline{MEOW} is a 4-digit number.
WOW×5=MEOW\overline{WOW} \times 5 = \overline{MEOW}.

Since result is 4-digit: WOW1000/5=200\overline{WOW} \geq 1000/5 = 200, so W2W \geq 2.
Since result 9999\leq 9999: WOW1999\overline{WOW} \leq 1999, so W1W \leq 1 for a 3-digit number... wait, WOW\overline{WOW} is 3-digit so W9W \leq 9 and WOW999\overline{WOW} \leq 999. 999×5=4995999 \times 5=4995, so MEOW4995\overline{MEOW} \leq 4995, meaning M4M \leq 4.

Also WOW×5\overline{WOW} \times 5 ends in W (units digit of 5×W5 \times W must equal W).
5WW(mod10)4W0(mod10)2W0(mod5)5W \equiv W \pmod{10} \Rightarrow 4W \equiv 0 \pmod{10} \Rightarrow 2W \equiv 0 \pmod{5}.
So W=0W=0 or W=5W=5. Since W is leading digit, W0W \neq 0, so W=5W=5.

WOW=5O5\overline{WOW} = \overline{5O5}. 5O5×5=MEOW\overline{5O5} \times 5 = \overline{MEOW}.

Units: 5×5=255 \times 5=25, units digit W=5 ✓, carry 2.
Tens: 5×O+25 \times O + 2, units digit = O (tens digit of result is O).
5O+2O(mod10)4O28(mod10)4O8(mod10)5O + 2 \equiv O \pmod{10} \Rightarrow 4O \equiv -2 \equiv 8 \pmod{10} \Rightarrow 4O \equiv 8 \pmod{10}.
O=2O=2: 4×2=84×2=8 ✓. Or O=7O=7: 4×7=2884×7=28 \equiv 8 ✓.

Try O=2: 5O5=525\overline{5O5}=525. 525×5=2625525 \times 5=2625. MEOW=2625\overline{MEOW}=2625: M=2, E=6, O=2, W=5. But M=O=2, not distinct. ✗

Try O=7: 5O5=575\overline{5O5}=575. 575×5=2875575 \times 5=2875. MEOW=2875\overline{MEOW}=2875: M=2, E=8, O=7, W=5. All distinct ✓. W=5 ✓, O=7 ✓.

Verification: 575×5=2875575 \times 5 = 2875

Answer (ii): W=5, O=7, M=2, E=8W=5,\ O=7,\ M=2,\ E=8, i.e., 575×5=2875575 \times 5 = 2875.
16Which of the following Venn diagrams captures the relationship between the multiples of 4, 8, and 32? (Options i, ii, iii, iv — diagrams not visible)Show solution
Analysis of the relationship:

- Every multiple of 32 is a multiple of 8 (since 32=4×832 = 4 \times 8).
- Every multiple of 8 is a multiple of 4 (since 8=2×48 = 2 \times 4).
- But not every multiple of 4 is a multiple of 8 (e.g., 4, 12, 20 are multiples of 4 but not 8).
- Not every multiple of 8 is a multiple of 32 (e.g., 8, 16, 24 are multiples of 8 but not 32).

Therefore: Multiples of 32 ⊂ Multiples of 8 ⊂ Multiples of 4.

This is a nested/concentric relationship: the set of multiples of 32 is entirely inside the set of multiples of 8, which is entirely inside the set of multiples of 4.

Answer: The correct Venn diagram is the one showing three concentric circles (nested sets), with multiples of 32 innermost, multiples of 8 in the middle, and multiples of 4 outermost. This corresponds to option (ii) (the nested concentric diagram). *(Note: Since the actual diagrams are not visible, the answer is based on the mathematical relationship — the correct diagram must show complete nesting: M(32) ⊂ M(8) ⊂ M(4).)*

Stuck on a step?

Ask Super Tutor AI to explain any solution on this page in a simpler way — free, 24x7.

Ask a Doubt Free

Frequently Asked Questions

What are the important topics in Number Play for CBSE Class 8 Mathematics?
Number Play covers several key topics that are frequently asked in CBSE Class 8 board exams. Focus on the core concepts listed on this page and practise related questions to build confidence.
How to score full marks in Number Play — CBSE Class 8 Mathematics?
Understand the core concepts first, then work through the 45 practice questions available for this chapter. Revise formulas and definitions regularly, and use flashcards for quick recall before the exam.
Where can I get free NCERT Solutions for Number Play Class 8 Mathematics?
This page has free step-by-step NCERT Solutions for every exercise question in Number Play (CBSE Class 8 Mathematics) — written the way examiners award marks: given, formula, working, answer.

Sources & Official References

Content is aligned to the official syllabus. Refer to the board website for the latest curriculum.

For serious students

Get the full Number Play chapter — for free.

Quizzes, flashcards, AI doubt-solver and a step-by-step study plan for CBSE Class 8 Mathematics.