Function num::integer::gcd

pub fn gcd<T>(x: T, y: T) -> T where T: Integer

Calculates the Greatest Common Divisor (GCD) of the number and other. The result is always positive.