// returns the least common multiple of n numbers
returns the least common multiple of n numbers
returns the least common multiple of n numbers
pub fn lcm(nums: &[usize]) -> usize {
    if nums.len() == 1 {
        return nums[0];
    }
    let a = nums[0];
    let b = lcm(&nums[1..]);
    a * b / gcd_of_two_numbers(a, b)
}
pub fn lcm ( nums : & [ usize ] ) -> usize { if nums . len ( ) == 1 { return nums [ 0 ] ; } let a = nums [ 0 ] ; let b = lcm ( & nums [ 1 .. ] ) ; a * b / gcd_of_two_numbers ( a , b ) }
returns the least common multiple of n numbers
returns the least common multiple of n numbers
nums
&[usize]