JAVASCRIPT

prime numbers javascript

function isPrime(num) {
    for (let i = 2; i * i <= num; i++)
        if (num % i === 0)
          return false; 
    return num > 1;
}

prime number js

function findPrime(to) {
	let factor;
 	for (let n = 0; n < to; n++) {
    	factor = 0
    	for (let p = 0; p < to; p++)
        	if (n % p == 0) factor++;
      	if (factor == 2) console.log(n);
  	}
}

console.log(30) //2 3 5 7 11 13 17 19 23 29

JavaScript Prime Number

// To understand this let's understand that Prime number has only two factors 
// 1) first factor = number it self
// 2) second factor = 1
// for instance 3 has only factors 3*1 = 3 and 1;
// I have taken two for loop to get two different numbers once we get two factors then it will console i
function getPrime(until) {
  let factor;
  for (let i = 0; i < n; i++) {
    factor = 0;
    for (let j = 1; j <= n; j++) {
      if (i % j == 0) {
        factor++;
      }
    }
    if (factor == 2) console.log(i);
  }
}
getPrime(30);

prime number in javascript

// program to check if a number is prime or not

// take input from the user
const number = parseInt(prompt("Enter a positive number: "));
let isPrime = true;

// check if number is equal to 1
if (number === 1) {
    console.log("1 is neither prime nor composite number.");
}

// check if number is greater than 1
else if (number > 1) {

    // looping through 2 to number-1
    for (let i = 2; i < number; i++) {
        if (number % i == 0) {
            isPrime = false;
            break;
        }
    }

    if (isPrime) {
        console.log(`${number} is a prime number`);
    } else {
        console.log(`${number} is a not prime number`);
    }
}

// check if number is less than 1
else {
    console.log("The number is not a prime number.");
}