primesLessThanN.js

const primesLessThanN = (n) => { //* This can be processor intensive
	let primes = []
	
	for(i = 0; i < n; i++) { 
   	        if ( i <= 1) { //* no number <= 1 can be prime
    	        continue
 	        }

	let isPrime = true 
	while( isPrime ) { 
		for(p = 0; p < primes.length; p++) {
			if (i % primes[p] == 0) {
				isPrime = false
			}
		}
		if (isPrime == 1) {
			primes.push(i)
		}
	}
        }
	return primes
}
let n = 100
primes = primesLessThanN(n)
console.log('primes length: ', primes.length);
console.log(primes)