sieve_of_erathosthenes.js

function generatePrimeNumbers(tillNumber = 2) {
	
  const primeNumbers = Array(tillNumber).fill(true);
	for (let p = 2; p * p <= tillNumber; p++) {
		if (primeNumbers[p]) {
			for (let i = p * p; i <= tillNumber; i += p) {
				primeNumbers[i] = false;
			}
		}
	}
  
  const _primeNumbers = [];
	for (let i = 2, j = primeNumbers.length; i <= j; i++) {
    if (primeNumbers[i]) {
      _primeNumbers.push(i);
		}
  }
	return _primeNumbers;
}