Math, asked by rudra5023, 8 months ago

200=115?
Euclid algorithm

Answers

Answered by koonergavan
1

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.

200 ÷ 115 = 1 R 85

115 ÷ 85 = 1 R 30

85 ÷ 30 = 2 R 25

30 ÷ 25 = 1 R 5

25 ÷ 5 = 5 R 0

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

Answered by jaspalsohi007
1

Answer:

GCF=5 ...............

Step-by-step explanation:

................

Similar questions