Instagram

youtube

Facebook

Twitter

Find GCD or HCF of Two Numbers

❮ Previous Next ❯

A Python program to compute the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) of two numbers using the Euclidean algorithm.

Here’s a step-by-step explanation of your GCD/HCF program:

Define find_gcd(a, b) function
- Uses the Euclidean algorithm to find the GCD.
- Keeps replacing a with b and b with a % b until b becomes 0.
- The final value of a is the GCD/HCF.
Take Input from the User
- Accepts two numbers as input using int(input()).
Call find_gcd(num1, num2) Function
- Computes GCD using the given numbers.
Print the Result
- Displays GCD/HCF using print().

Program:

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"GCD/HCF of {num1} and {num2} is: {gcd}")

❮ Previous Next ❯