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);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));Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
