Python numpy.gcd()用法及代码示例

numpy.gcd(arr1, arr2, out = None, where = True, casting = ‘same_kind’, order = ‘K’, dtype = None)：该数学函数可帮助用户计算| arr1 |的GCD值。和| arr2 |元素。

不等于零的两个或多个数字的最大公约数(GCD)是将每个数字相除的最大正数。

例：找到120和2250的GCD

120 = 2^3 * 3 * 5
2250 = 2 * 3^2 * 5^3

Now, GCD of 120 and 2250 = 2 * 3 * 5 = 30

参数：
arr1 / arr2: [array_like]Input array.

返回： Greatest Common Divisor (GCD) of two or more numbers.

代码:

# Python program illustrating  
# gcd() method  
import numpy as np  
  
arr1 = [120, 24, 42, 10] 
arr2 = [2250, 12, 20, 50] 
  
print ("arr1:", arr1) 
print ("arr2:", arr2) 
  
print ("\nGCD of arr1 and arr2:", np.gcd(arr1, arr2)) 
print ("\nGCD of arr1 and 10  :", np.gcd(arr1, 10)) 
           

输出：

arr1:[120, 24, 42, 10]
arr2:[2250, 12, 20, 50]

GCD of arr1 and arr2:[30, 12,  2, 10]

GCD of arr1 and 10  :[10,  2,  2, 10]