sumallprimes.js

// Bonfire: Sum All Primes
// Author: @codebubb
// Challenge: http://www.freecodecamp.com/challenges/bonfire-sum-all-primes#
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function sumPrimes(num) {
  var primes = [];
  for(var i=2; i<=num; i++){
 	if(isPrime(i)) primes.push(i);
  }	
  return primes.reduce(function(a,b){
    return a+b;
  });
}
function isPrime(n){
	for(var i=2; i<n; i++){
		if(n % i === 0) return false;
	}
	return true;