Question

Use Euclid’s division algorithm to find the HCF of 105 and 120 ​

Answer 1

Step-by-step explanation:

hope this helps you better

Answer 2

Answer:

GCF(105, 120) = 15

Solution

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.

120 ÷ 105 = 1 R 15 (120 = 1 × 105 + 15)

105 ÷ 15 = 7 R 0 (105 = 7 × 15 + 0)

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