Question

e Euclid's division algorithm to find the HCF of 150 and 32​

Answer 1

Answer:

it's your exam question I think.

Answer 2

Answer:

Euclid's Division Algorithm

a = Bq +r

150 = 32×4 + 12

32 = 12×2 + 8

12 = 8×1 + 4

8 = 4×2 +0

Hence, the HCF of 150 and 32 is 4

I HOPE IT'S HELPFUL