Question
Euclid's algorithm, find the HCF of 240 and 228.

Answer

We know, by Euclid's Division Lemma
$a=b q+r, 0 \leq r < b$
Applying Euclid's Lemma,
Step 1 : Since $240>228$, we apply the division lemma to 240 and 228 , to get $240=228 \times 1+12$Step 2 : Since the remainder $12 \neq 0$, we apply the division lemma to 228 and 12 , to get $228=12 \times 19+0$
The remainder has now become zero.
Since the divisor at this stage is 12 , the HCF is 12.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free