Question

Find the HCF of 85 and 153 by Euclid’s Division Algorithm​

Answer 1

Answer:

HCF(85, 153) = 17

Step-by-step explanation:

Set up a division problem where a is larger than b.

a ÷ b = c with remainder R. Do the division. Then replace a with b, replace b with R and repeat the division. Continue the process until R = 0.

153 ÷ 85 = 1 R 68 (153 = 1 × 85 + 68)

85 ÷ 68 = 1 R 17 (85 = 1 × 68 + 17)

68 ÷ 17 = 4 R 0 (68 = 4 × 17 + 0)

When remainder R = 0, the HCF is the divisor, b, in the last equation.

HCF = 17