Question

Use Euclid's division algorithm to find the HCF of 42,480

Answer 1

HCF(42, 480) = 6

Step-by-step explanation:

By Euclid's division algorithm–

480 = 42 × 11 + 18

42 = 18 × 2 + 6

18 = 6 × 3 + 0

So, the HCF(42, 480) is 6.

Answer 2

Answer:

6

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.

480 ÷ 42 = 11 R 18 (480 = 11 × 42 + 18)

42 ÷ 18 = 2 R 6 (42 = 2 × 18 + 6)

18 ÷ 6 = 3 R 0 (18 = 3 × 6 + 0)

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

GCF = 6