Math, asked by BHAINOLADLO, 8 months ago

Find HCF(132, 320) by Euclid’s Division Algorithm.​

Answers

Answered by adhishi
2

Answer:

HCF of 132 & 320 using Euclid's lemma is 4

Step-by-step explanation:

320 = 132 * 2 + 56

132 = 56 * 2 + 20

56 = 20 * 2 + 16

20 = 16 * 1 + 4

16 = 4 * 4 + 0

therefore required HCF is 4!

Hope this helps!!

Similar questions