Greatest Common Divisor (GCD) and Least Common Multiple (LCM) implemented in Lua

gcd_lcm.lua

-- Greatest Common Divisor (Euclidean algorithm).
 function math.gcd(a, b)
    local t
    while b ~= 0 do
        t = b
        b = math.fmod(a, b)
        a = t
    end
    return a
end

-- Least Common Multiple.
-- Assumes that both `a` and `b` are not equal to 0 at the same time.
function math.lcm(a, b)
    return (a * b) / math.gcd(a, b)
end