http://www.freecodecamp.com/patrickcurl 's solution for Bonfire: Sum All Primes

bonfire-sum-all-primes.js

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

function sumPrimes(num) {
  if(num === 1){
    return 0;
  }
  
  if(isPrime(num) === false){
    return sumPrimes(num-1);
  }
  if(isPrime(num) === true){
    return num + sumPrimes(num-1);
  }
}

function isPrime(num){
  for(i=2; i<= num;i++){
    if(num % i === 0 && num != i){
      return false;
    }
  }
  return true;
}

sumPrimes(10);