js challenge print if number is prime.

printPrime.js

function printPrime (num) {
    for (let counter = 1; counter <= num; counter++) {
        let prime = true;
        for (let j = 2; j <= counter; j++) {
            // if it can modus without remainder and it's not it self, means it's not prime
            if (counter % j === 0 && counter !== j) {
                prime = false;
            }
        }
        if (prime) {
            console.log(counter)
        }
    }
}

// printPrime(10)