fork(2) download
  1. function isPrime(num) {
  2. if (num < 2) return false; // 0 and 1 are not prime
  3. if (num === 2) return true; // 2 is the only even prime
  4. if (num % 2 === 0) return false; // eliminate even numbers
  5.  
  6. const limit = Math.sqrt(num); // only check up to sqrt(num)
  7.  
  8. for (let i = 3; i <= limit; i += 2) { // test only odd divisors
  9. if (num % i === 0) return false;
  10. }
  11.  
  12. return true;
  13. }
  14.  
  15. // Example usage
  16. console.log(isPrime(2)); // true
  17. console.log(isPrime(17)); // true
  18. console.log(isPrime(100)); // false
  19. console.log(isPrime(1)); // false
  20. console.log(isPrime(997)); // true
  21.  
Success #stdin #stdout 0.04s 18900KB
stdin
Standard input is empty
stdout
true
true
false
false
true