function isPrime(n) {
if (n == 0 || n == 1) {
return false;
}
for (let i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
function findConsecutivePrimeSumEqualTo(n) {
let sum = 0;
for (let i = 2; i < n; i++) {
if (isPrime(i)) {
console.log(i);
sum += i;
if (sum == n) {
break;
}
if (sum > n) {
console.log("Not Found");
break;
}
}
}
}
findConsecutivePrimeSumEqualTo(58);
/*
run:
2
3
5
7
11
13
17
*/