ContextQMD
Back to Freecodecamp

Problem 10: Summation of primes

curriculum/challenges/english/blocks/project-euler-problems-1-to-100/5900f3761000cf542c50fe89.md

latest1.8 KB
Original Source

--description--

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below n.

--hints--

primeSummation(17) should return a number.

js
assert.isNumber(primeSummation(17));

primeSummation(17) should return 41.

js
assert.strictEqual(primeSummation(17), 41);

primeSummation(2001) should return 277050.

js
assert.strictEqual(primeSummation(2001), 277050);

primeSummation(140759) should return 873608362.

js
assert.strictEqual(primeSummation(140759), 873608362);

primeSummation(2000000) should return 142913828922.

js
assert.strictEqual(primeSummation(2000000), 142913828922);

--seed--

--seed-contents--

js
function primeSummation(n) {

  return true;
}

primeSummation(2000000);

--solutions--

js
class PrimeSeive {
  constructor(num) {
    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
    const upper = Math.floor((num - 1) / 2);
    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);

    for (let i = 0; i <= sqrtUpper; i++) {
      if (seive[i]) {
        // Mark value in seive array
        const prime = 2 * i + 3;
        // Mark all multiples of this number as false (not prime)
        const primeSquaredIndex = 2 * i ** 2 + 6 * i + 3;
        for (let j = primeSquaredIndex; j < upper; j += prime) {
          seive[j] = false;
        }
      }
    }

    this._seive = seive;
  }

  isPrime(num) {
    return num === 2
      ? true
      : num % 2 === 0
        ? false
        : this.isOddPrime(num);
  }

  isOddPrime(num) {
    return this._seive[(num - 3) / 2];
  }
};

function primeSummation(num) {
  const primeSeive = new PrimeSeive(num);

  let sum = 2;
  for (let i = 3; i < num; i += 2) {
    if (primeSeive.isOddPrime(i)) sum += i;
  }
  return sum;
}