Exercise Solutions Available
Step-by-step answers for all textbook questions in this chapter
Overview
This chapter blends number theory (Euclid's lemma, HCF, LCM) with sequences (arithmetic and geometric progressions). The formulae are fixed, so accuracy in substitution is what earns marks.
1. Euclid's Division Lemma and HCF
For positive integers a, b: a = bq + r, with 0 ≤ r < b.
To find HCF: divide, then replace the divisor with the remainder and repeat until the remainder is 0. The last non-zero remainder is the HCF.
HCF–LCM relation: HCF × LCM = a × b.
2. Arithmetic Progression (AP)
A sequence with a constant common difference d (d = a₂ − a₁).
3. Geometric Progression (GP)
A sequence with a constant common ratio r (r = a₂ / a₁).
Worked Examples
Example 1 — HCF by Euclid's algorithm
Find the HCF of 867 and 255.
Example 2 — LCM using the relation
HCF of two numbers is 51 and their product is 221085. Find the LCM.
Example 3 — nth term of an AP
Find the 18th term of 7, 13, 19, …
Example 4 — Sum of an AP
Find the sum of the first 25 terms of 5, 9, 13, …
Example 5 — Sum of a GP
Find the sum of 3 + 6 + 12 + … to 6 terms.
Example 6 — AP word problem
How many terms of the AP 24, 21, 18, … give a sum of 78?
Common Mistakes
- Stopping Euclid's algorithm before the remainder reaches 0.
- Using n instead of (n − 1) in the nth-term formula.
- Forgetting the sign of a negative common difference.
- Using the AP sum formula for a GP (and vice-versa).
Exam Tips & Revision Checklist
- Memorise the four formulae (AP nth term & sum, GP nth term & sum).
- Identify AP vs GP first (constant difference → AP; constant ratio → GP).
- For "how many terms" problems, expect a quadratic in n — both roots may be valid.
- Practised: Euclid HCF, HCF×LCM, AP nth/sum, GP nth/sum, word problems.
