Skip to main content

gcd

rustymath_kernels::exact

Function gcd 

Source 
pub fn gcd<T>(x: &Ratio<T>, y: &Ratio<T>) -> Ratio<T>
where
    T: Clone + Integer,
Expand description

The greatest common divisor of x and y: the largest rational that divides each a whole number of times. It is the gcd of their numerators over the lcm of their denominators. It is never negative, and the gcd of 0 and 0 is 0.