Back to Discrete Math for Shockers
GCDs and The Euclidean Algorithm
Common divisors of a pair of integers, relative primality, and back-substitution that writes the greatest common divisor as a combination of the two.
Discrete Math for Shockers, GCDs and The Euclidean Algorithm
StatusFlagsLoading your progress…
4 exercises
Exercise 1
Find the gcd via the Euclidean Algorithm and then use back-substitution to write the gcd as a linear combination of those numbers:
2.5
Exercise 2
Use any method to find the greatest common divisor of 412 and 32.
2.5
Exercise 3
Use any method to find the greatest common divisor of 780 and 150.
2.5
Exercise 4
Find the greatest common divisor of 70, 98, 108.
2.5
Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.