prime.html

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
    <script type="text/javascript">
        let allPrimes = (n) => {
   //Create new n+1 array and mark them as true
   let isPrime = new Array(n+1).fill(true);
   isPrime[0] = false;
   isPrime[1] = false;
  
   let primes = [];

   for(let i = 2; i <= n; i++){
     //if the number is  
     if(isPrime[i] === true){
        primes.push(i); 
     }
     
      //mark all the numbers divisible i as false
      let next = i * i;
      while (next <= n) {
        isPrime[next] = false;
        next += i;
      }  
   }

   return primes;
}


    </script>
    </head>

</body>
</html>


