Primes (creating and summing)

Small loops are powerful on long solutions.

by Vanessa RC

JavaScript

function sumPrimes(num) {
  // find prime number 
 var primes = 0;
  
  for (var i=1; i<=num; i++){
    var isprime = true;
    
    for (var j = 2; j <= num; j++){
      if (i%j === 0){
        isprime = false;
      } 
      else if (isprime = true){
        primes += i;
      }
    }
  }
  return primes;
}

sumPrimes(10);// should return 17.