Sunny-117 / js-challenges

✨✨✨ Challenge your JavaScript programming limits step by step

Home Page:https://juejin.cn/column/7244788137410560055

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

素数

Sunny-117 opened this issue · comments

素数
commented
function judgeIs(num) {
  let cnt = 0;
  for (let i = 1; i <= num; i++) {
    if (num % i === 0) cnt++;
  }
  return cnt === 2;
}
function judeg(num){
    if(num === 2 || num === 3) return true;
    for(let i = 2; i <= Math.pow(num, 0.5); ++i){
        if(num % i === 0) return false;
    }
    return true;
}
function isPrime(num) {
    if (num <= 1) return false; // 素数定义为大于1的自然数中,除了1和它本身以外不再有其他因数的自然数
    if (num === 2) return true; // 2是唯一的偶素数
    if (num % 2 === 0) return false; // 排除其他偶数

    const sqrt = Math.sqrt(num);
    for(let i = 3; i <= sqrt; i += 2) { 
        if (num % i === 0)
            return false;
    }
    
    return true;
}