| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/TheAlgorithms/JavaScript/master/Project-Euler/Problem010.js | [Back] [Original] |
// https://projecteuler.net/problem=10
const isPrime = (number) => {
if (number === 2) return true
if (number % 2 === 0) return false
for (let j = 3; j * j {
let sum = 0
for (let i = maxNumber - 1; i >= 2; i--) {
if (isPrime(parseInt(i)) === true) {
sum += i
}
}
return sum
}
export { calculateSumOfPrimeNumbers }
| Web Proxy Viewer | New URL | Original Page |