js计算哥德巴赫猜想数据

function isInteger(num) {
    return typeof num === 'number' && num % 1 === 0;
}

function isPrime(num) {
    if (!isInteger(num) || num < 2) {
        return false;
    }
    for (let i = 2; i < num; i++) {
        if (num % i === 0) {
            return false;
        }
    }
    return true;
}

function Goldbach(even) {
    if (!isInteger(even) || even < 4 || even % 2 !== 0) {
        return 'Data is invalid.'
    } else {
        var n1 = undefined;
        var n2 = undefined;
        var primeArr = [];
        var ret = [];
        for (let i = 2; i < even; i++) {
            if (isPrime(i)) {
                primeArr.push(i);
            }
        }
        for (let i = 0; i < primeArr.length; i++) {
            n1 = primeArr[i];
            n2 = undefined;
            for (let j = 0; j < primeArr.length; j++) {
                if (primeArr[j] === even - n1) {
                    n2 = primeArr[j];
                    break;
                }
            }
            if (n2) {
                ret.push({n1: n1, n2: n2});
            }
        }
        if (ret.length !== 0) {
            // 去重
            ret = ret.slice(0, Math.ceil(ret.length / 2));
            return ret;
        } else {
            return 'They are not exist';
        }
    }
}