Find HCF of 4032 and 262 using Euclid Division Algorithm.
Dear Student,
Here is the solution of your asked query:
Here is the solution of your asked query:
Step 1:
First, apply Euclid’s division lemma on 4032 and 262.
4032 = 262 × 15 + 102
Step 2:
As the remainder is non-zero, we apply Euclid’s division lemma on 262 and 102.
262 = 102 × 2 + 58
Step 3:
Apply Euclid’s division lemma on 102 and 58.
102 = 58 × 1 + 44
Step 4:
Apply Euclid’s division lemma on 58 and 44.
58 = 44 × 1 + 14
Step 5:
Apply Euclid’s division lemma on 44 and 14.
44 = 14 × 3 + 2
Step 6:
Apply Euclid’s division lemma on 14 and 2.
14 = 2 × 7 + 0
In the problem given above, to obtain 0 as the remainder, the divisor has to be taken as 2. Hence,
2 is the H.C.F. of 4032 and 262