GCD | Consecutive divisions | Pigsty method | Euclid's algorithm
11Have you ever heard of the Consecutive Divisions, Pigsty and Euclid's Algorithm methods for calculating the GCD (Greatest Common Divisor)? In fact, these three names refer to the same method! In this video, I explain how it works and why it is so efficient for finding the GCD of two numbers. In particular, I show you the following exercise:
When determining the GCD of two numbers A and B, using the method of successive divisions, we found 40, and the quotients of the successive divisions were 2, 3, 1 and 4. Find the numbers A and B.
If you want to understand this concept once and for all, watch until the end and learn with Professor Fernando, from Cafemática!
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
☕ Discover Cafeverso:https://www.cafematica.com.br/cafeversoo
☕ Professional contact:
contato@cafematica.com.br