Lua哥德巴赫：偶数的双素数拆分

local function isPrime(n)
    if n < 2 then return false end
    local i = 2
    while i * i <= n do
        if n % i == 0 then return false end
        i = i + 1
    end
    return true
end

local function goldbach(n)
    local m = math.floor(n / 2)
    for p = 2, m do
        if isPrime(p) and isPrime(n - p) then
            return p, n - p
        end
    end
end
local p = getplayerbyname("gold01")
local x, y = goldbach(98)
sendmsg(p, 1, "98 = " .. x .. " + " .. y)