NumPy Tutorial · NumPy ufunc

ufunc Finding GCD

Learn all about ufunc Finding GCD in this comprehensive tutorial.

5 min read advanced

•The GCD (Greatest Common Divisor), also known as HCF (Highest Common Factor) is the biggest number that is a common factor of both of the numbers.
•To find the Highest Common Factor of all values in an array, you can use the reduce() method.

Finding GCD (Greatest Common Divisor)

The GCD (Greatest Common Divisor), also known as HCF (Highest Common Factor) is the biggest number that is a common factor of both of the numbers.

python

import numpy as npnum1 = 6num2 = 9x = np.gcd(num1, num2)
print(val_1)

Note: Returns: 3 because that is the highest number both numbers can be divided by (6/3=2 and 9/3=3).

To find the Highest Common Factor of all values in an array, you can use the reduce() method.

Note: The reduce() method will use the ufunc, in this case the gcd() function, on each element, and reduce the array by one dimension.

python

import numpy as nparr = np.array([20, 8, 32, 36, 16])val_1 = 
  np.gcd.reduce(arr)
print(val_1)

Note: Returns: 4 because that is the highest number all values can be divided by.

2 questions

Which of the following is true about ufunc Finding GCD?

It is strictly typedIt is evaluated at runtimeIt requires explicit memory managementIt is deprecated

What is the most common pitfall when working with ufunc Finding GCD?

SyntaxErrorIndentationErrorNameErrorTypeError

Answer all questions to submit.