xxxxxxxxxx
function isPrime(num) {
// Check if num is less than 2, as 0 and 1 are not prime numbers
if (num < 2) {
return false;
}
// Iterate from 2 to the square root of num
for (let i = 2; i <= Math.sqrt(num); i++) {
// If num is divisible by i, it is not prime
if (num % i === 0) {
return false;
}
}
return true; // num is prime
}
// Example usage
console.log(isPrime(7)); // Output: true
console.log(isPrime(12)); // Output: false
console.log(isPrime(29)); // Output: true
xxxxxxxxxx
function isPrime(num) {
// Check if num is less than 2 (since 0 and 1 are not prime)
if (num < 2) {
return false;
}
// Loop from 2 to the square root of num
for (let i = 2; i <= Math.sqrt(num); i++) {
// If num is divisible by i, then it's not a prime number
if (num % i === 0) {
return false;
}
}
// If we haven't returned false yet, then num is a prime number
return true;
}