Find the LCM and HCF of 4032 and 262 using Euclid's division algorithm.
Answers
Answered by
2
Answer:
Step1: First, Apply Euclid's Division lemma on 4032 and 262.
=4032=262x15+102
As the remainder is non- zero, we apply again on 262 and 102.
=262=102×2+58
Again on 102 and 58.
=102= 58×1+44
Again on 58 and 44
=58= 44×1+ 14
► Again, on 44 and 14
=44= 14×3+2
► Again 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 HCF of 4032 and 262.
Similar questions