Function comlib_math::gcd

pub fn gcd<I: Integer>(a: I, b: I) -> I

Computes the greatest common divisor of the given numbers.

The greatest common divisor of a and b is the largest integer which divides both a and b. The function implements Euclidean algorithm.