count primes - erastotenes sieve

10000_primes.js

const sieve = [];
const MAX = 10008;

for (let i = 2; i < MAX; ++i) {
	for (let j = i * 2; j < MAX; j += i) {
    sieve[j] = 1;
  }
}

const primes = [];
for (let [p, i] = [0, 2]; i < sieve.length; ++i) {
  if (!sieve[i]) {
    primes[p++] = i;
  }
}

console.log(
  primes
  .slice(-30)
  // .slice(0, 10)
  .join`\n`
);