In Python, math module contains a number of mathematical operations, which can be performed with ease using the module. math.gcd() function compute the greatest common divisor of 2 numbers mentioned in its arguments.
Syntax: math.gcd(x, y) Parameter: x : Non-negative integer whose gcd has to be computed. y : Non-negative integer whose gcd has to be computed. Returns: An absolute/positive integer value after calculating the GCD of given parameters x and y. Exceptions : When Both x and y are 0, function returns 0, If any number is a character, Type error is raised.
Time Complexity: O(1)
Auxiliary Space: O(1)
Code #1:Â
Python3
# Python code to demonstrate the working of gcd()     # importing "math" for mathematical operationsimport math     # prints 12print ("The gcd of 60 and 48 is : ", end ="")print (math.gcd(60, 48)) |
Output:
The gcd of 60 and 48 is : 12
 Code #2:Â
Python3
# Python code to demonstrate the working of gcd()Â
# importing "math" for mathematical operationsimport mathÂ
# prints gcd of x, yprint ("math.gcd(44, 12) : ", math.gcd(44, 12))print ("math.gcd(69, 23) : ", math.gcd(65, 45)) |
Output:
math.gcd(44, 12) : 4 math.gcd(69, 23) : 5
Code #3: Explaining Exception.Â
Python3
# Python code to demonstrate gcd()# method exceptionsimport math     # prints 0print ("The gcd of 0 and 0 is : ", end ="")print (math.gcd(0, 0))     # Produces errorprint ("\nThe gcd of a and 13 is : ", end ="")print (math.gcd('a', 13)) |
Output:Â
The gcd of 0 and 0 is : 0 The gcd of a and 13 is : TypeError: 'str' object cannot be interpreted as an integer
… [Trackback]
[…] Here you will find 69696 additional Info to that Topic: geeksforgeeks.org/python-math-gcd-function/ […]