Finding the Greatest Common Divisor

✔ Writeup: biology-forums.com/index.php?...
✔ Ask questions here: Biology-Forums.com/index.php?...
Follow us:
▶ Facebook: / studyforceps
▶ Instagram: / studyforceonline
▶ Twitter: / studyforceps
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.

[@StudyForceOnline]

Euclidean method: kzbin.info/www/bejne/en63aamel89lptk

[@2uperCyber]

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

[@rithvikjegan5365]

Really useful

[@josiahmccart8576]

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

[@StudyForceOnline]

The 2nd one

[@wvk86]

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

[@pr47hmesh]

Smooth

[@StudyForceOnline]

🍻

[@martinahmwangombe-3493]

How to division 27and 36

[@StudyForceOnline]

The greatest common divisor between 27 and 36 is 9. 27 / 9 = 3, and 36 / 9 = 4.

[@Kean530]

@@StudyForceOnlineSo its just the same as gcf….

[@StudyForceOnline]

@@Kean530 Yes, they are the exact same