Golbach solution

getPrimeTerms(10000000);

function getPrimeTerms(num) {
  for (let i = num / 2; i < num / 2 + num / 20; i++) {
    let a = i;
    let b = num - i;
    if (isPrime(a) && isPrime(b)) {
      console.log(a + ' ' + b);
      break;
    }
  }
}

function isPrime(num) {
  for (let i = 2; i < num; i++) {
    if (num % i === 0) return false;
  }
  return num > 1;
}