1function isPrime(num) {2 if (num <= 1) return false;3 for (let i = 2; i <= Math.sqrt(num); i++) {4 if (num % i === 0) return false;5 }6 return true;7}89function findGoldbachPair(n) {10 if (n <= 2 || n % 2 !== 0) {11 return "Input must be an even number greater than 2";12 }1314 for (let i = 2; i <= n / 2; i++) {15 if (isPrime(i) && isPrime(n - i)) {16 return [i, n - i];17 }18 }1920 return "No Goldbach pair found (this shouldn't happen for even numbers > 2)";21}222324console.log("Goldbach pair for 4:", findGoldbachPair(4));25console.log("Goldbach pair for 10:", findGoldbachPair(10));26console.log("Goldbach pair for 100:", findGoldbachPair(100));27console.log("Goldbach pair for 1000:", findGoldbachPair(1000));