Perform the greatest common divisor between two integers (Euclidian algorithm).
[G] = NL_S_GCD(A,B)
Integer.
Integer.
Greatest common divisor.
NL_S_GCD performs the greatest common divisor (GCD) G of the two integers A and B in respect with the Euclidian algorithm (WIKIPEDIA).