Python Program for Extended Euclidean algorithms

Python Program for Basic Euclidean algorithms

Last Updated : 22 Jun, 2022

Python3

# Python program to demonstrate Basic Euclidean Algorithm 
 
 
# Function to return gcd of a and b 
def gcd(a, b): 
    if a == 0 : 
        return b 
     
    return gcd(b%a, a) 
 
a = 10
b = 15
print("gcd(", a , "," , b, ") = ", gcd(a, b)) 
 
a = 35
b = 10
print("gcd(", a , "," , b, ") = ", gcd(a, b)) 
 
a = 31
b = 2
print("gcd(", a , "," , b, ") = ", gcd(a, b)) 
 
# Code Contributed By Mohit Gupta_OMG <(0_o)> 

Output:

GCD(10, 15) = 5
GCD(35, 10) = 5
GCD(31, 2) = 1

Time Complexity: O(Log min(a, b))

Auxiliary Space: O(Log min(a, b)), due to recursion stack.

Please refer complete article on Basic and Extended Euclidean algorithms for more details!

Python Program for Extended Euclidean algorithms

GeeksforGeeks

News

Improve

Article Tags :

Python Programs

Similar Reads

Python Program for Basic Euclidean algorithms

C/C++ Code # Python program to demonstrate Basic Euclidean Algorithm # Function to return gcd of a and b def gcd(a, b): if a == 0 : return b return gcd(b%a, a) a = 10 b = 15 print("gcd(", a , "," , b, ") = ", gcd(a, b)) a = 35 b = 10 print("gcd(", a , ",

Python Program for Extended Euclidean algorithms

C/C++ Code # Python program to demonstrate working of extended # Euclidean Algorithm # function for extended Euclidean Algorithm def gcdExtended(a, b): # Base Case if a == 0 : return b,0,1 gcd,x1,y1 = gcdExtended(b%a, a) # Update x and y using results of recursive # call x = y1 - (b//a) * x1 y = x1

Python Program to Find Area of a Circle

The task of calculating the Area of a Circle in Python involves taking the radius as input, applying the mathematical formula for the area of a circle and displaying the result. Area of a circle formula: Area = pi * r2where Ï€ (pi) is a mathematical constant approximately equal to 3.14159. r is the r

Python Program for Sieve of Eratosthenes

Sieve of Eratosthenes is a method for finding all primes up to (and possibly including) a given natural. This method works well when is relatively small, allowing us to determine whether any natural number less than or equal to is prime or composite. Implementation: Given a number n, print all prime

Python program to print positive numbers in a list

In this article, we will explore various methods to o print positive numbers in a list. The simplest way to do is by using for loop function. Using LoopThe most basic method for printing positive numbers is to use a for loop to iterate through the list and check each element. [GFGTABS] Python a = [-

Python Program for Check if all digits of a number divide it

Given a number n, find whether all digits of n divide it or not. Examples: Input : 128Output : Yes128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0. Input : 130Output : No We want to test whether each digit is non-zero and divides the number. For example, with 128, we want to test d != 0 && 128 %

Python Program to Find Sum of Array

Given an array of integers, find the sum of its elements. Examples: Input : arr[] = {1, 2, 3}Output : 6Explanation: 1 + 2 + 3 = 6This Python program calculates the sum of an array by iterating through each element and adding it to a running total. The sum is then returned. An example usage is provid

Python Program to Find Numbers Divisible by Another Number

We are given a list of numbers and a number. We have to find all the numbers in the list that are divisible by the given single number. Examples: Input: list=[8, 14, 21, 36, 43], num=3Output: 21, 36, 57Input: list=[2, 17, 25, 31, 48, 55], num=5Output: 25, 55In this article, we will discuss the diffe

Python Program to Find Area and Circumference of Circle

Python provides a simple yet powerful way to calculate the area and circumference of a circle using various mathematical formulas. In this article, we will explore the main logic behind these calculations and demonstrate two commonly used methods to find the area and circumference of a circle in Pyt

Python Program for GCD of more than two (or array) numbers

The GCD of three or more numbers equals the product of the prime factors common to all the numbers, but it can also be calculated by repeatedly taking the GCDs of pairs of numbers. gcd(a, b, c) = gcd(a, gcd(b, c)) = gcd(gcd(a, b), c) = gcd(gcd(a, c), b) Python Code # GCD of more than two (or array)