function sumPrimes(num) {
  var arr = [];
  var ifTrue = 1;
  for (var i = 2; i < num; i ++) {
    ifTrue = 1;
    for (var j = 2; j < i; j ++) {
      if (i % j === 0) {
        ifTrue = 0;
      }
    }
    if (ifTrue == 1) {
      arr.push(i);
    }
  }
  num = arr.reduce(function(a,b) {
    return a + b ;
  });
  return num;
}

function sumPrimes(num) {
  var arr = [];
  
  for (var i = 2; i <= num; i ++) {
    var divisible = false;
    for (var j = 2; j < i; j ++) {
      if (i !== j && i % j === 0) {
        divisible = true;
      }
    }
    if (divisible === false) {
      arr.push(i);
    }
  }
  num = arr.reduce(function(a,b) {
    return a + b ;
  });
  return num;
}

sumPrimes(1000);
//=> 76127

if (i !== j && i % j === 0) {    divisible = true;}