Examples
n1 = [12,15,19]; n2 = [4,5,7]; [ngcd]=CL_gcd(n1,n2) |  |  |
Greatest common divisor (gcd or pgcd)
ngcd = CL_gcd(n1,n2)
Computes the greatest common divisor of 2 integers using Euclide's algorithm.
Integer (1 x N)
Integer(1 x N)
Greatest common divisor of n1 and n2 (1 x N)
CNES - DCT/SB
n1 = [12,15,19]; n2 = [4,5,7]; [ngcd]=CL_gcd(n1,n2) | | |