Consecutive Prime Sum

by Mubasshir Pawle

JavaScript

var limit = 10000;
var primeNumbers = [];
var consecutivePrimeSums = [];
var notConsecutivePrimeSums = [];
var sumSoFar = 0;
var looped = 0;
for (var i = 2; i < limit; i++) {
  if (notConsecutivePrimeSums.indexOf(i) > -1) {
    continue;
  }
  if (primeNumbers.indexOf(i) > -1 || isPrime(i)) {
    if (primeNumbers.indexOf(sumSoFar) === -1) {
      primeNumbers.push(i);
    }
    sumSoFar += i;
    if (sumSoFar > limit) {
      break;
    }
    if (primeNumbers.indexOf(sumSoFar) > -1 || isPrime(sumSoFar)) {
      consecutivePrimeSums.push(sumSoFar);
      if (primeNumbers.indexOf(sumSoFar) === -1) {
        primeNumbers.push(sumSoFar);
      }
    } else {
      notConsecutivePrimeSums.push(sumSoFar);
    }
  } else {
    notConsecutivePrimeSums.push(i);
  }
  looped++;
}
alert(looped)
alert(primeNumbers)
alert(consecutivePrimeSums)

function isPrime(number) {
  for (var i = 2; i <= number / 2; i++) {
    if (number % i === 0) {
      return false;
    }
  }
  return true;
}