Funcion isPrime()

prime.js

const limite = 20000;

function isPrime(num) {
    let prime = true;

    for (let i = 2; i < (num/2 + 1); i++)
        if (num % i === 0) {
            prime = false;
            break;
        }
    return num > 1 && prime
}

for (let i = 2; i <= limite; i++)
    if (isPrime(i)) console.log(i);

// Definición: Solo es divisible entre 1 y si mism