//
function sumPrimes(num) {
var primes=[];
for (var i=2; i<=num; i++) {
var isPrime = true;
for (var j=Math.ceil(i/2); j > 1; j--) {
if (Math.floor(i/j) == i/j) {
isPrime = false;
}
}
if (isPrime) {
primes.push(i);
}
}
return primes.reduce(function(a, b) {
return a + b;
});
}
sumPrimes(100000);
:cookie: 331 | @smileytechguy |http://www.freecodecamp.com/smileytechguy