Lua辗转相除：最大公约数的迭代求法

local function gcd(a, b)
    local g = 1
    for i = 2, math.min(a, b) do   -- 逐个试除到最小值
        if a % i == 0 and b % i == 0 then g = i end
    end
    return g
end

local function gcd(a, b)
    while b ~= 0 do
        a, b = b, a % b            -- 辗转相除，快速收敛
    end
    return a
end
sendmsg(actor, 1, "48金36箱最大公约份 " .. gcd(48, 36))