Prime numbers upto n - JavaScript

Let’s say, we are required to write a JavaScript function that takes in a number, say n, and returns an array containing all the prime numbers upto n.

For example − If the number n is 24, then the output should be −

const output = [2, 3, 5, 7, 11, 13, 17, 19, 23];

Example

Following is the code −

const num = 24;
const isPrime = num => {
   let count = 2;
   while(count < (num / 2)+1){
      if(num % count !== 0){
         count++;
         continue;
      };
      return false;
   };
   return true;
};
const primeUpto = num => {
   if(num < 2){
      return [];
   };
   const res = [2];
   for(let i = 3; i <= num; i++){
      if(!isPrime(i)){
         continue;
      };
      res.push(i);
   };
   return res;
};
console.log(primeUpto(num));

Output

This will produce the following output in console −

[
   2,  3,  5,  7, 11,
   13, 17, 19, 23
]

AmitDiwan

Updated on 18-Sep-2020 12:37:43

• Related Questions & Answers
• Counting prime numbers from 2 upto the number n JavaScript
• Listing all the prime numbers upto a specific number in JavaScript
• Sum of the first N Prime numbers
• Counting the number of 1s upto n in JavaScript
• Sum all perfect cube values upto n using JavaScript
• Print the nearest prime number formed by adding prime numbers to N
• Finding all possible prime pairs that sum upto input number using JavaScript
• Checking for co-prime numbers - JavaScript
• Prime numbers in a range - JavaScript
• JavaScript function to take a number n and generate an array with first n prime numbers
• How to generate Prime Numbers in JavaScript?
• Prime numbers within a range in JavaScript
• Sum of all prime numbers in JavaScript
• Print prime numbers from 1 to N in reverse order
• Find the Product of first N Prime Numbers in C++