Finding the Greatest Common Divisor

[@StudyForceOnline]

Euclidean method: ua-cam.com/video/DMT8vhbj2pw/v-deo.html

[@2uperCyber]

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

[@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

[@rithvikjegan5365]

Really useful

[@wvk86]

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

[@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

[@pr47hmesh]

Smooth

[@StudyForceOnline]

🍻