Prev Next

ufunc Finding GCD

The Greatest Common Divisor (GCD) is the largest positive integer that divides two or more integers without leaving a remainder. NumPy provides the gcd ufunc to compute the GCD of array elements efficiently.

Key Topics

Computing GCD

The gcd function computes the GCD of two or more integers, applied element-wise when used with arrays.

Example

# Finding GCD
import numpy as np

arr1 = np.array([12, 18, 24])
arr2 = np.array([15, 30, 36])

gcd = np.gcd(arr1, arr2)

print("GCD of arrays:", gcd)

Output

GCD of arrays: [3 6 12]

Explanation: The gcd ufunc computes the GCD for each pair of corresponding elements in the arrays.

Key Takeaways

  • Element-Wise GCD: Use gcd to compute the greatest common divisor for arrays.
  • Applications: Solve problems in number theory, simplifying fractions, or modular arithmetic.
  • Efficiency: Handles array computations element by element for optimal performance.
Prev Next