OK, here's a long one!

Use the Euclidean Algorithm to find

GCF( 124532 , 945 )
 

124532 = 131 * 945 + 737  ...  945 = 1 * 737 + 208  ...  737 = 3 * 208 + 113  ...  208 = 1 * 113 + 95  ...  113 = 1 * 95 + 18  ...  95 = 5 * 18 + 5  ...  18 = 3 * 5 + 3  ...  5 = 1 * 3 + 2  ...  3 = 1 * 2 + 1  ...  1 is the GCF!  Whew!  ...  2 = 2 * 1 + 0

 

GCF( 124532 , 945 ) = 1

 


YOUR TURN:

Use the Euclidean Algorithm to find

GCF( 100 ,  6 )


GCF( 234 , 15 )


GCF( 12348 , 122 )


GCF( 9317 , 125 )