JavaScript: Check whether the provided integer is a prime number or not
JavaScript fundamental (ES6 Syntax): Exercise-191 with Solution
Write a JavaScript program to check if the provided integer is a prime number or is not.
- Check numbers from 2 to the square root of the given number.
- Return false if any of them divides the given number, else return true, unless the number is less than 2.
Sample Solution:
JavaScript Code:
//#Source https://bit.ly/2neWfJ2
const isPrime = num => {
const boundary = Math.floor(Math.sqrt(num));
for (var i = 2; i <= boundary; i++) if (num % i === 0) return false;
return num >= 2;
};
console.log(isPrime(11));
console.log(isPrime(17));
console.log(isPrime(8));
Sample Output:
true true false
Pictorial Presentation:
Flowchart:

Live Demo:
See the Pen javascript-basic-exercise-191-1 by w3resource (@w3resource) on CodePen.
Improve this sample solution and post your code through Disqus
Previous: Write a JavaScript program to get a boolean determining if the passed value is primitive or not.
Next: Write a JavaScript program to check whether the provided value is an object created by the Object constructor.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join