Question

find the hcf of 2825 and 80625 by Euclid division algorithm​

Answer 1

Answer:

GCF(2825, 80625) = 25

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.

80625 ÷ 2825 = 28 R 1525    (80625 = 28 × 2825 + 1525)

2825 ÷ 1525 = 1 R 1300    (2825 = 1 × 1525 + 1300)

1525 ÷ 1300 = 1 R 225    (1525 = 1 × 1300 + 225)

1300 ÷ 225 = 5 R 175    (1300 = 5 × 225 + 175)

225 ÷ 175 = 1 R 50    (225 = 1 × 175 + 50)

175 ÷ 50 = 3 R 25    (175 = 3 × 50 + 25)

50 ÷ 25 = 2 R 0    (50 = 2 × 25 + 0)

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