How to find the largest integer that can divide evenly into two integers (GCD) in Python

1 Answer

0 votes
import math 
  
print(math.gcd(12, 8))      
print(math.gcd(30, 0))      
print(math.gcd(100, 525))      
print(math.gcd(13, 9)) 
print(math.gcd(18, 4))        
print(math.gcd(0, 0))



'''
run:

4
30
25
1
2
0

'''

 



answered Jul 13, 2019 by avibootz
...