👤
FHEIRON89IN
Answered

Use the Euclidean Algorithm to find the GCF 20 and 350​

Sagot :

ANISHAPRASADVPIN

GCF(20, 350) = 10

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.

350 ÷ 20 = 17 R 10    (350 = 17 × 20 + 10)

20 ÷ 10 = 2 R 0    (20 = 2 × 10 + 0)

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

CUTEHAWKIN

Answer:

GCF(20, 350) = 10

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.

350 ÷ 20 = 17 R 10    (350 = 17 × 20 + 10)

20 ÷ 10 = 2 R 0    (20 = 2 × 10 + 0)

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

In Studier: Other Questions