Finding next prime number to a given number using JavaScript

Problem

We are required to write a JavaScript function that takes in a number n. Our function should that smallest number which is just greater than n and is a prime number.

Example

Following is the code −

 Live Demo

const num = 101;
const isPrime = (num) => {
   let sqrtnum = Math.floor(Math.sqrt(num));
   let prime = num !== 1;
   for(let i = 2; i < sqrtnum + 1; i++){
      if(num % i === 0){
         prime = false;
         break;
      };
   };
   return prime;
}
const nextPrime = (num = 1) => {
   while(!isPrime(++num)){
   };
   return num;
};
console.log(nextPrime(num));

Output

103

AmitDiwan

Published on 19-Apr-2021 11:11:46

• Related Questions & Answers
• Finding nearest prime to a specified number in JavaScript
• Finding the nth prime number in JavaScript
• Finding the largest prime factor of a number in JavaScript
• Finding all possible prime pairs that sum upto input number using JavaScript
• Nearest Prime to a number - JavaScript
• Finding two prime numbers with a specific number gap in JavaScript
• JavaScript: Finding nearest prime number greater or equal to sum of digits - JavaScript
• Java Program to display a prime number less than the given number
• Is the reversed number a prime number in JavaScript
• Finding smallest number using recursion in JavaScript
• Finding closest pair sum of numbers to a given number in JavaScript
• Finding whether a number is triangular number in JavaScript
• Finding the multiples of a number in a given list using NumPy
• Finding Gapful number in JavaScript
• Write a Golang program to check whether a given number is prime number or not