Compute the greatest common divisor of two arrays.
JAX implementation of numpy.gcd()
.
x1 (ArrayLike) – First input array. The elements must have integer dtype.
x2 (ArrayLike) – Second input array. The elements must have integer dtype.
An array containing the greatest common divisors of the corresponding elements from the absolute values of x1 and x2.
Examples
Scalar inputs:
>>> jnp.gcd(12, 18) Array(6, dtype=int32, weak_type=True)
Array inputs:
>>> x1 = jnp.array([12, 18, 24]) >>> x2 = jnp.array([5, 10, 15]) >>> jnp.gcd(x1, x2) Array([1, 2, 3], dtype=int32)
Broadcasting:
>>> x1 = jnp.array([12]) >>> x2 = jnp.array([6, 9, 12]) >>> jnp.gcd(x1, x2) Array([ 6, 3, 12], dtype=int32)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4