Q1. Find the HCF of 96 and 404 by Euclid's algorithm.
404 = 96 × 4 + 20
96 = 20 × 4 + 16
20 = 16 × 1 + 4
16 = 4 × 4 + 0 ⇒ HCF = 4
Every number breaks into primes in exactly one way. Use the HCF & LCM calculator and master the proofs the board loves.
Enter two or three numbers to get their HCF and LCM, with the prime factorisation.
HCF, LCM and product problems with steps.
Loading…
Q1. Find the HCF of 96 and 404 by Euclid's algorithm.
404 = 96 × 4 + 20
96 = 20 × 4 + 16
20 = 16 × 1 + 4
16 = 4 × 4 + 0 ⇒ HCF = 4
Q2. Prove √2 is irrational (idea).
Assume √2 = p/q in lowest terms.
Then 2q² = p², so p is even ⇒ p = 2k ⇒ 2q² = 4k² ⇒ q² = 2k², so q is even too.
Both even contradicts "lowest terms" ⇒ √2 is irrational.
| Quantity | Formula |
|---|---|
| Euclid's lemma | a = bq + r, 0 ≤ r < b |
| HCF × LCM | HCF(a,b) × LCM(a,b) = a × b |
| Terminating decimal | p/q terminates ⇔ q = 2ᵐ·5ⁿ |
Every composite number can be expressed as a product of primes, and this factorisation is unique except for the order of the factors.
For any two positive integers, HCF × LCM equals the product of the numbers.
A rational number p/q (in lowest terms) has a terminating decimal exactly when q is of the form 2ᵐ × 5ⁿ.
Hi! Found an error or have a suggestion? Let us know and we'll fix it.
Thanks! Your feedback has been sent. We'll look into it.