GREATEST COMMON DIVISOR, best TRICK, GCD

We present the best trick to calculate the GCD of two integers. #divisibility #Number Theory, cryptography.
David's science and music channel: / drdaviddarling
Juan's mathematics channel (Spanish): / juanmemol
David's website: www.daviddarli...

[@leesweets4110]

Isnt that just the Euclidean algorithm? You didnt learn this in public school with the GCD subject matter? This method is like two thousand years old. EA is how I code GCD.

[@0briang0]

It's Euclid's algorithm and it's only ~2400 years young!

[@aidanhschofield]

with the specific example you can use simple tricks to simplify the calculation. 5 clearly does not divide 49896 and 4 clearly divides both but no higher power of 2 divides 24300. So you can deduce that gcd(49896, 24300) is 4 times gcd(49896,243). The remainder when you divide 49896 by 243 is 81 which divides 243, so gcd(49896, 243) = 81 and therefore gcd(49896, 24300) = 4*81 = 324

[@luxurious-cars]

GCD=GOD

[@theinternetsavedmylife]

I'm sorry I only know HCF (Highest Common Factor)... Is that the same as GCD?

[@charlessnachez4248]

Yes

[@sonukmrsah]

What are these caution signs in the thumbnail they are nothing to do with the video!!

[@asbarker31]

Neat!

[@luiscasanova3241]

Euclides rides again!!