universoulsun / baby_git_steps Goto Github PK

function sumPrimes(num) {
  var res=0;

function Prime(num) {
  for(var i = 2; i < num; i++){
    //if the number is divisible by anything else the itself (i<num) it isnt Prime
    if (num % i === 0) return false;
  }
  return true;
}
for(var i = 2; i <= num; i++){
    if(Prime(i)){
        res+=i;
    }
  }
    return res;
}