Using Euclid's dicision lemma , find the HCF of 3632 and 7068
Answers
Answered by
1
Answer:
Since 7068>3632,we apply the division lemma to 7068 and 3632 to obtain
7068 = 3632×1+3436
Since remainder 3436 is not equal to 0, we apply the division lemma to 3632 and 3436 to obtain
3632 = 3436×1+196
We consider the new divisor 3436 and new remainder 196, and apply the division lemma to obtain
3436=196×1+104
As the remainder is not 0 the process remains.
196=104×1+92
104=92×1+12
92=12×7+8
12=8×1+4
8=4×2+0
Hence the remainder is 0 then the HCF of 3632 and 7068 is 4.
Similar questions