console.log("Sum All Primes");
//Sum all the prime numbers up to and including the provided number. A prime number is defined as a number greater than one and having only two divisors, one and itself. For example, 2 is a prime number because it's only divisible by one and two. The provided number may not be a prime.
function sumPrimes(num) {
  function myPrime(number){
      for (let i = 2; i <= number; i++){
          if(number % i === 0 && number!= i){
             return false;
          }
       }
    return true;
  };
  if (num === 1){
    return 0;
  };
  if(myPrime(num) === false){
    return sumPrimes(num - 1);
  };
  // Check if your number is prime
  if(myPrime(num) === true){
    return num + sumPrimes(num - 1);
  }
};
// test here
console.log(sumPrimes(10));
console.log("<----------------------next exercise------------------------->");