Question

find the HCF of the following using long division method 92 and 132 ​

Answer 1

bigger integer-132

smaller integer-92

so now we know that Euclid's division algorithm (a=bxq+r)

dividend=division x quotient +remainder

so now we apply this algorithm to find HCF

Step-by-step explanation:

132=90×1+42

90=42×2+6

42=6×7+0

↓

so this is the HCF

THANK U FOR SELECTING MY ANSWER AS BRAINLIEST....