Real numbers: Euclid's algorithm, HCF, LCM and irrationality proofs
The first chapter of Class 10 Maths, worked properly — the division algorithm, the HCF × LCM shortcut, and how to prove √2 is irrational.
Euclid's division lemma
For any two positive integers a and b, there exist unique whole numbers q and r such that
a = bq + r, where 0 ≤ r < b
In plain terms: divide a by b and you get a quotient and a remainder, and the remainder is always smaller than the divisor. The condition 0 ≤ r < b is what makes q and r unique, and questions test whether you can state it.
Finding an HCF with the division algorithm
Apply the lemma repeatedly. Divide, then divide the previous divisor by the remainder, and keep going until the remainder is zero. The last non-zero remainder is the HCF.
Write each line in the form a = bq + r. Examiners look for the steps, not just the answer, and a bare "51" will not get full marks.
The fundamental theorem of arithmetic
Every composite number can be written as a product of primes, and that factorisation is unique apart from the order of the factors.
This gives the other method for HCF and LCM:
- HCF — the product of the smallest power of each common prime factor.
- LCM — the product of the greatest power of every prime factor that appears.
The shortcut worth knowing
For any two positive integers a and b:
HCF (a, b) × LCM (a, b) = a × b
So once you have the HCF, the LCM is one division away. In the example above, 96 × 404 = 38784, and 38784 ÷ 4 = 9696. ✓
Two warnings. This identity holds for two numbers only — it fails for three. And questions sometimes give you the HCF, the LCM and one number, and ask for the other; that is this formula rearranged.
Show answer
HCF × LCM = product of the two numbers.
9 × 459 = 27 × x
4131 = 27x
x = 153
Check it: 27 = 3³ and 153 = 3² × 17, so the HCF is 3² = 9 ✓, and the LCM is 3³ × 17 = 459 ✓.
Proving a number is irrational
These proofs are by contradiction, and they follow a fixed pattern. Learn the pattern and you can prove any of them.
The same argument works for √3, √5 and for numbers like 5 − √3 or 3√2: assume rational, rearrange until an irrational equals a rational, and point at the contradiction.
Decimal expansions
A rational number p/q in lowest terms has a terminating decimal expansion exactly when q is of the form 2ⁿ5ᵐ. Otherwise the expansion is non-terminating but recurring.
So 13/3125 terminates, because 3125 = 5⁵. And 17/8 terminates, because 8 = 2³. But 64/455 does not, because 455 = 5 × 7 × 13 contains 7 and 13.
Questions ask this without demanding the actual decimal — factorise the denominator and answer in one line.
Where marks are lost
Not writing the lemma steps. For an HCF by Euclid's algorithm, each a = bq + r line carries marks.
Confusing HCF with LCM. The HCF is never larger than the smaller number; the LCM is never smaller than the larger. Check your answer against that.
In an irrationality proof, forgetting to state the assumption that a and b have no common factor. The whole contradiction rests on it, and leaving it out costs marks even when the rest is right.
Saying "a² is even so a is even" without justification when the question asks for a full proof. Add the one-line reason.
Stuck on this in your own textbook?
Ask our tutor about this chapter and get an answer drawn from the book your board actually prescribes, with the passage cited.
Try a lesson free