Answers for "does the sieve of eratosthenes work"

sieve of eratosthenes

function solution(n) {
   const numArr = new Array(n + 1);
   numArr.fill(true);
	// from 1 to n, if number is NOT a prime, change true to false in numArr
   numArr[0] = numArr[1] = false;
   for (let i = 2; i <= Math.sqrt(n); i++) {
      for (let j = 2; i * j <= n; j++) {
          numArr[i * j] = false;
      }
   }
  	// find number of true(number of prime) by filtering true boolean
   return numArr.filter(Boolean).length;
}