###### Waste less time on Facebook — follow Brilliant.
×
Back to all chapters

# Greatest Common Divisor / Lowest Common Multiple

What is the largest number that can divide two numbers without a remainder? What is the smallest number that is divisible by two numbers without a remainder?

# Euclidean Algorithm

Use the Euclidean Algorithm to calculate $$\gcd( 26187, 1533).$$

Use the Euclidean Algorithm to calculate $$\gcd( 51414, 2123).$$

Use the Euclidean Algorithm to calculate $$\gcd( 574662, 51843).$$

Use the Euclidean Algorithm to calculate $$\gcd( 223460, 151360).$$

Use the Euclidean Algorithm to calculate $$\gcd( 41425, 2425).$$

×

Problem Loading...

Note Loading...

Set Loading...