Answers for "sum of prime numbers javascript"

0

sum prime numbers javascript

function sumPrimes(num) {
  let i = 1;
  let sum = 0;
  while (i <= num) {
    if (isPrime(i)) {
      sum += i;
    }
    i++;
  }
  return sum;
}
//function to check if a number is prime or not
function isPrime(x) {
  for (let i = 2; i < x; i++) {
    if (x % i === 0) return false;
  }
  return x !== 1 && x !== 0;
}
//test here
sumPrimes(10);
Posted by: Guest on August-18-2020
0

sum of prime numbers javascript

function sumPrimes(num) {
  //create an array with values from 1 to 10
  var val =Array.from({length: num}, (_, i) => i + 1)
  
  val = val.filter((number)=> {
    for(var i = 2; i < number; i++){
      if(number % i === 0){
        
        return false
      }
    }
    return number > 1    // [2, 3, 5, 7]
  }).reduce(function(a, b){
    return a + b   //sum = 17
  })
return val
  }
  

console.log(sumPrimes(10));
Posted by: Guest on June-24-2021

Code answers related to "sum of prime numbers javascript"

Code answers related to "Javascript"

Browse Popular Code Answers by Language