Name
CL_colGcd — Greatest common divisor (gcd or pgcd) for 2 vectors of integers (elementwise)
Calling Sequence
[Ngcd]=CL_colGcd(N1,N2)
Parameters
- N1:
Vector of integers (1 x N)
- N2:
Vector of integers (1 x N)
- Ngcd:
gcds of N1 and N2 elementwise (1 x N)
Description
-
This functions computes the greatest common divisors between N1 and N2 elementwise, using Euclide's algorithm.
Examples
N1 = [12,15,19];
N2 = [4,5,7];
[Ngcd]=CL_colGcd(N1,N2)