Here I will show you different ways to in using program .

GCD also known as (Highest Common Factor). So let’s see how we’ll do it.

Method 1: Using Loop


hcf = 12

So in this program, first we assign values to n1 and n2, then we’ll find smaller number from both of the numbers.  After that we’ll start loop from 1 to smaller number to find a number which can be fully divisible with both of the numbers n1 and n2 and store into a new variable named as hcf. At the end of the loop we’ll get the highest number stored in hcf variable which can fully divide both of the numbers n1 and n2. That highest number will be our hcf.

Method 2: Using Recursion


highest  common factor = 12

So here we have a recursive function which receive two arguments and return the Highest common factor between them.

Method 3: Using math.gcd()


Highest Common Factor = 12

Python has an inbuilt method to find out the GCD. We even doesn’t need to think how to code to find GCD. All we have to do is just use math.gcd() method and it will return the GCD.

Method 4: Using Euclidean Algorithm

Euclid’s algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers. Here is the pseudocode to show how we can find GCD using Euclidean Algorithm.


function gcd(a, b)

    while b ≠ 0

       t := b;

       b := a mod b;

       a := t;

    return a;



Highest Common Factor = 12

In this program, get_gcd(int, int) function is used to implement the Euclidean algorithm. For more details on Euclidean algo please visit

If you’ve any problem or suggestion related to python gcd programs then comment down below.

Source link


Please enter your comment!
Please enter your name here