Question

# ILLUSTRATION : 2 Let us find the H.C.F. of 60 and 108 using the Euclid's Division Algorithm.

Solution

D010A
.
SOLUTION :
Step (i): Since, 108> 60 applying Euclid's Lemma to 60 and 108, we have
108 = 60x 1 +48 where 0 < 48<60
Step (ii): Since, remainder 48 70
So, again applying the division lemma to 60 and 48, we have
60=48 x 1 + 12 where 0 < 12<48.
Step (ii) : Again remainder 12 + 0 so applying division lemma to 48 and 12, we get
48= 12 * 4+0. Here remainder is zero.
Therefore, 12 is the required H.C.F.