NCERT Solutions for Class 7th Maths Chapter 3 Try This — The Greatest of All

Book page 48 Updated on2026-09-19

Q1.
Do you remember the ‘Jump Jackpot’ game from Grade 6 (see the chapter ‘Prime Time’)? Grumpy places a treasure on a number and Jumpy chooses a jump size and tries to collect the treasure. In each case below, the two numbers upon which treasures are kept are given. Find the longest jump size (starting from 0) using which Jumpy can land on both the numbers having the treasure. (a) 14 and 30 (b) 7 and 11 (c) 30 and 50 (d) 28 and 42
Answer

Jumping from 0 in steps of size j, Jumpy lands on 0, j, 2j, 3j, … — the multiples of j. To land on a treasure number, j must be a factor of it.

NumbersCommon factorsLongest jump
(a)14 and 301, 22
(b)7 and 1111
(c)30 and 501, 2, 5, 1010
(d)28 and 421, 2, 7, 1414
(a) 14 = 2 × 7, 30 = 2 × 3 × 5 → only 2 is shared → jump 2
(b) 7 and 11 are both prime and different → only 1 is shared → jump 1
(c) 30 = 2 × 3 × 5, 50 = 2 × 5 × 5 → 2 and 5 shared → jump 2 × 5 = 10
(d) 28 = 2 × 2 × 7, 42 = 2 × 3 × 7 → 2 and 7 shared → jump 2 × 7 = 14
Check it yourself: for (c), jumps of 10 land on 0, 10, 20, 30, 40, 50 — both treasures collected. A jump of 15 lands on 30 but skips over 50.
Q2.
Is the longest jump size for the numbers the same as their HCF? Explain why it is so.
Answer

Yes. The longest jump size is exactly the HCF of the two numbers.

(a) HCF(14, 30) = 2 = longest jump ✓
(b) HCF(7, 11) = 1 = longest jump ✓
(c) HCF(30, 50) = 10 = longest jump ✓
(d) HCF(28, 42) = 14 = longest jump ✓
Why it happens: starting at 0 with jump size j, Jumpy visits exactly the multiples of j. He lands on a number only when that number is a multiple of j — that is, only when j is a factor of it. To land on both treasures, j must be a factor of both numbers, so j is a common factor. The question asks for the longest such jump, which is the greatest common factor — the HCF. The two questions are word-for-word the same question.
Was this helpful?