Meet Makwanatechmeet.hashnode.dev·Jan 27, 2024Understanding the Euclidean Algorithm for Finding GCDWhat is GCD What is GCD (Greatest Common Divisor): The Greatest Common Divisor, or GCD, is a fundamental concept in number theory, representing the largest positive integer that divides two numbers without leaving a remainder. Euclidean Algorithm Wha...Discussdata structures

Yaroslav Prozorovbyka.hashnode.dev·Jun 10, 2023GCD or HCF of two NumbersDescription GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. Example: We have a = 4 and b = 6. GSD of 4 and 6 is 2. But how do we find it? We can use the super classic way. T...DiscussMathematics