Finding the Greatest Common Divisor

Follow us:

To find the greatest common divisor, you can follow two methods:

1. Using this formula: GCD(a,b)=|a⋅b|/(LCM(a,b))

2. Using prime factorization.

Note: Pairs of numbers that have 1 as their greatest common divisor are called relatively prime. For example, the greatest common divisor of 5 and 26 is 1. Thus, 5 and 26 are relatively prime.

Q. Find the greatest common divisor of 216 and 234.

[uperCyber]

I wasted 20 minutes trying to figure this out when I could have just watched his 5 minute video. Thank you!

[josiahmccart]

is the gcd the smallest positive integer that multiplies the numbers without a remainder or the largest positive number that divides the numbers with out a remainder

[wvk]

Euclidean's algorithm is another way to find the GCD.