z = 0 or z = 9, giving 3105 and 3195.
z is a digit, so 9 + z runs from 9 to 18
Multiples of 9 in that range: 9 and 18
9 + z = 9 → z = 0 9 + z = 18 → z = 9
Check: 3105 = 9 × 345 ✓ and 3195 = 9 × 355 ✓
Book page 1325 Updated on2026-09-05
z = 0 or z = 9, giving 3105 and 3195.
Check: 3105 = 9 × 345 ✓ and 3195 = 9 × 355 ✓
Snehal's claim is false. The sum is sometimes a multiple of 8 and sometimes not.
So the sum is always a multiple of 4, but for it to be a multiple of 8 the bracket 3(n + m) + 1 must be even — that is, n + m must be odd.
| a | b | Sum | Multiple of 8? |
|---|---|---|---|
| 8 (n = 0) | 8 (m = 1) | 16 | Yes |
| 20 (n = 1) | 8 (m = 1) | 28 | No |
| 8 (n = 0) | 20 (m = 2) | 28 | No |
| 20 (n = 1) | 20 (m = 2) | 40 | Yes |
The sum of two multiples of 3 is a multiple of 6 exactly when the two numbers have the same parity — both even or both odd.
| Case | Example | Sum | Multiple of 6? |
|---|---|---|---|
| both even multiples of 3 (i.e. multiples of 6) | 6 + 12 | 18 | Yes |
| both odd multiples of 3 | 9 + 15 | 24 | Yes |
| one even, one odd | 6 + 9 | 15 | No |
| one even, one odd | 12 + 21 | 33 | No |
(i) Her conjecture is true for every multiple of 9.
(ii) Yes — any shuffle of the digits works, not just the reversal.
Take 189 and write down every arrangement:
All six are multiples of 9, for the same reason: rearranging digits never changes their sum.
The pairs are (a, b) = (1, 0), (8, 2), (6, 4), (4, 6) and (2, 8).
Divisible by 2: the units digit b must be even → b = 0, 2, 4, 6 or 8.
Divisible by 9: the digit sum must be a multiple of 9.
Both possibilities have to be tried: 17 + a + b = 18 gives a + b = 1, and 17 + a + b = 27 gives a + b = 10.
| b | a from a + b = 1 | a from a + b = 10 | Valid pair |
|---|---|---|---|
| 0 | a = 1 ✓ | a = 10 ✗ | (1, 0) → 481230 |
| 2 | a = – 1 ✗ | a = 8 ✓ | (8, 2) → 488232 |
| 4 | ✗ | a = 6 ✓ | (6, 4) → 486234 |
| 6 | ✗ | a = 4 ✓ | (4, 6) → 484236 |
| 8 | ✗ | a = 2 ✓ | (2, 8) → 482238 |
Check one: 481230 → digit sum 18 ✓, ends in 0 ✓, and 481230 = 18 × 26735 ✓
The pairs are (p, q) = (7, 0), (5, 2), (3, 4) and (1, 6).
Divisible by 4: the last two digits q8 must form a multiple of 4 → 08, 28, 48, 68, 88, so q = 0, 2, 4, 6 or 8.
Divisible by 11: take the alternating sum from the units digit.
| q | p = 7 – q | Number | ÷ 44 |
|---|---|---|---|
| 0 | 7 | 37708 | 857 ✓ |
| 2 | 5 | 35728 | 812 ✓ |
| 4 | 3 | 33748 | 767 ✓ |
| 6 | 1 | 31768 | 722 ✓ |
| 8 | – 1 ✗ | — | — |
One such set is 2, 3, 4. There are infinitely many, and they occur once in every 12 numbers.
| n | The three numbers | Check |
|---|---|---|
| 2 | 2, 3, 4 | 2 = 2 × 1, 3 = 3 × 1, 4 = 4 × 1 ✓ |
| 14 | 14, 15, 16 | 14 = 2 × 7, 15 = 3 × 5, 16 = 4 × 4 ✓ |
| 26 | 26, 27, 28 | 26 = 2 × 13, 27 = 3 × 9, 28 = 4 × 7 ✓ |
| 38 | 38, 39, 40 | 38 = 2 × 19, 39 = 3 × 13, 40 = 4 × 10 ✓ |
Five of them: 45036, 45072, 45108, 45144, 45180.
The approach. Find one multiple of 36 in the range, then keep adding 36 — every step lands on the next one.
Checking without dividing. 36 = 4 × 9 and 4 and 9 are coprime, so a multiple of 36 must pass both tests:
| Number | Last two digits ÷ 4 | Digit sum ÷ 9 | ÷ 36 |
|---|---|---|---|
| 45036 | 36 = 4 × 9 ✓ | 18 ✓ | 1251 |
| 45072 | 72 = 4 × 18 ✓ | 18 ✓ | 1252 |
| 45108 | 08 = 4 × 2 ✓ | 18 ✓ | 1253 |
| 45144 | 44 = 4 × 11 ✓ | 18 ✓ | 1254 |
| 45180 | 80 = 4 × 20 ✓ | 18 ✓ | 1255 |
The other four are 5p – 4, 5p – 2, 5p + 2 and 5p + 4.
Consecutive even numbers differ by 2, not 1 — that is the only thing to be careful about here.
One answer is 210045. Here is how to build such a number rather than hunt for one.
Step 1 — divisible by 15. 15 = 3 × 5, so the number must end in 0 or 5 and have a digit sum that is a multiple of 3.
Step 2 — the last digit must be 5, not 0. If it ended in 0, the reversed number would begin with 0 and would not be a 6-digit number at all.
Step 3 — the reverse must be divisible by 6. 6 = 2 × 3. Divisibility by 3 is automatic, since reversing does not change the digit sum. Divisibility by 2 needs the reverse to end in an even digit — that is, the first digit of the original number must be even.
Deepak's conjecture is false. Every multiple of 11 stays a multiple of 11 when doubled — there are no exceptions.
11 is still a factor, so 2N is a multiple of 11 no matter what k is.
| Multiple of 11 | Doubled | ÷ 11 |
|---|---|---|
| 11 | 22 | 2 ✓ |
| 55 | 110 | 10 ✓ |
| 143 | 286 | 26 ✓ |
| 902 | 1804 | 164 ✓ |
(i) Always True.
9 is a factor of the product for every choice of m and n. Examples: 6 × 3 = 18 = 9 × 2 ✓; 12 × 9 = 108 = 9 × 12 ✓; 30 × 21 = 630 = 9 × 70 ✓.
(ii) Always True.
Examples: 4 + 6 + 8 = 18 = 6 × 3 ✓; 10 + 12 + 14 = 36 = 6 × 6 ✓; – 2 + 0 + 2 = 0 = 6 × 0 ✓.
(iii) Always True.
Going from abcdef to badcef swaps a with b and c with d, leaving e and f where they are. Test the two halves of divisibility by 6 separately:
Both tests survive, so the new number is a multiple of 6.
(iv) Never True.
Whatever b is, the expression is 4 short of a multiple of 12, so it can never be a multiple of 12.
Divide each number by 3 and keep only its remainder — 0, 1 or 2. The sum is divisible by 3 exactly when the three remainders add to 0, 3 or 6.
Since each remainder is 0, 1 or 2, their total lies between 0 and 6. Only 0, 3 and 6 work, and that leaves exactly two shapes of answer:
| Case | Remainders | Total | Example |
|---|---|---|---|
| all three remainders equal | 0, 0, 0 | 0 ✓ | 3 + 9 + 12 = 24 |
| 1, 1, 1 | 3 ✓ | 4 + 7 + 10 = 21 | |
| 2, 2, 2 | 6 ✓ | 2 + 5 + 8 = 15 | |
| all three remainders different | 0, 1, 2 | 3 ✓ | 3 + 7 + 11 = 21 |
| exactly two the same | 1, 2, 2 | 5 ✗ | 4 + 5 + 8 = 17 |
| 0, 0, 1 | 1 ✗ | 3 + 6 + 7 = 16 |
Generalisation: the sum of three numbers is divisible by 3 when their remainders on division by 3 are all equal or all different — and in no other case.
Two consecutive integers — always a multiple of 2.
Examples: 3 × 4 = 12, 8 × 9 = 72, 15 × 16 = 240 — all even.
Three consecutive integers — always a multiple of 6. (The book's phrase “these consecutive integers” here means three, as the mention of 6 shows.)
Examples: 1 × 2 × 3 = 6, 4 × 5 × 6 = 120 = 6 × 20, 9 × 10 × 11 = 990 = 6 × 165.
Four consecutive integers — always a multiple of 24.
Examples: 1 × 2 × 3 × 4 = 24, 2 × 3 × 4 × 5 = 120 = 24 × 5, 5 × 6 × 7 × 8 = 1680 = 24 × 70.
Five consecutive integers — always a multiple of 120.
Examples: 1 × 2 × 3 × 4 × 5 = 120, 2 × 3 × 4 × 5 × 6 = 720 = 120 × 6, 6 × 7 × 8 × 9 × 10 = 30240 = 120 × 252.
(i) E = 3, F = 7, G = 1 → 37 × 3 = 111
The two-digit number EF has tens digit E, and E is also the multiplier. Check the factorisations:
| GGG | As (2-digit) × (1-digit) | Tens digit = multiplier? |
|---|---|---|
| 111 | 37 × 3 | 3 = 3 ✓ |
| 222 | 37 × 6 | 3 ≠ 6 ✗ |
| 333 | 37 × 9 | 3 ≠ 9 ✗ |
| 444 | 74 × 6 | 7 ≠ 6 ✗ |
| 666 | 74 × 9 | 7 ≠ 9 ✗ |
Only 111 = 37 × 3 fits, so E = 3, F = 7, G = 1 — three different digits ✓
(ii) W = 5, O = 7, M = 2, E = 8 → 575 × 5 = 2875
The right side is a multiple of 100, so 2520 + 40O must end in 00 → O = 2 or 7.
| O | 2520 + 40O | M, E | Valid? |
|---|---|---|---|
| 2 | 2600 | M = 2, E = 6 | No — M = 2 clashes with O = 2 |
| 7 | 2800 | M = 2, E = 8 | Yes |
Diagram (iv) — the one that nests multiples of 32 inside multiples of 8 inside multiples of 4.
Each ring must be non-empty, and it is:
| Number | ÷ 4 | ÷ 8 | ÷ 32 | Where it sits |
|---|---|---|---|---|
| 4 | Yes | No | No | outer ring only |
| 8 | Yes | Yes | No | middle ring |
| 32 | Yes | Yes | Yes | innermost circle |