Day 59: Python Program to Find GCD of Two Number

def find_gcd(a, b):

    while b:

        a, b = b, a % b

    return a

num1 = int(input("Enter the first number: "))

num2 = int(input("Enter the second number: "))

gcd = find_gcd(num1, num2)

print(f"The GCD of {num1} and {num2} is {gcd}.")

 #source code --> clcoding.com 

Code Explanation:

1. def find_gcd(a, b):

This defines a function named find_gcd that takes two parameters, a and b, representing the two numbers whose GCD you want to find.

2. while b:

This while loop runs as long as b is not zero. The loop keeps iterating until b becomes zero.

The condition while b is equivalent to while b != 0.

3. a, b = b, a % b

Inside the loop, this line uses Python's tuple unpacking to simultaneously update the values of a and b.

a becomes the current value of b, and b becomes the remainder of the division a % b.

This step implements the Euclidean Algorithm, which states that the GCD of two numbers does not change if the larger number is replaced by its remainder when divided by the smaller number.

The process continues until b becomes zero, at which point a holds the GCD.

4. return a

When the loop ends, the function returns the value of a, which is the GCD of the two numbers.

5. num1 = int(input("Enter the first number: "))

This line takes input from the user, converts it to an integer, and stores it in the variable num1.

6. num2 = int(input("Enter the second number: "))

Similarly, this line takes the second input from the user, converts it to an integer, and stores it in the variable num2.

7. gcd = find_gcd(num1, num2)

The find_gcd function is called with num1 and num2 as arguments, and the result is stored in the variable gcd.

8. print(f"The GCD of {num1} and {num2} is {gcd}.")

This line prints the GCD using an f-string to format the output.