Greatest Common Factors 8

The Euclidean Algorithm is better for big numbers AND you can program a computer to do it.

This method takes some getting used to!

Let's do another one:

Use the Euclidean Algorithm to find

1 ) 600 = __ * 136 + __
What's the most times you can put 136 into 600? Grab a calculator.

600 = 4 * 136 + 56 ... put 4 in the first blank ... what's left over? 600 - 4 x 136

Shift the numbers down...

600 = 4 * 136 + 56 ... 136 = __ * 56 + __ ... Do it again!

The most times 56 goes into 136 ? Calculator:

136 = 2 * 56 + 24 ... Put 2 in the first blank ... The remainder? 136 - 2 x 56 = ?

of 11

Greatest Common Factor (GCF) - Also known as Greatest Common Divisor (GCD)