Implementation of Euclidian algorithm

gcd.lua

function gcd(a, b)
    local x = a; local y = b
    repeat
        if x > y then
            x = math.fmod(x, y)
        else
            y = math.fmod(y, x)
        end
    until x == 0 or y == 0
    return x + y
end