素数JavaScript [英] Prime Numbers JavaScript
本文介绍了素数JavaScript的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
有人可以给我指导,以获取此处的质数吗?这是家庭作业,所以我不希望得到答案,但是一些提示将不胜感激.我真的很烦:(
Can someone please give me guidance on getting the primenumbers here? This is homework so I don't want the answer but some pointers would be greatly appreciated. It's really annoying me :(
我想我接近了.但是我遇到的问题是数字25和35.这些不是素数,但是此函数正在返回它们
I think I'm close. But this problems I have are number 25 and 35. These are not prime but this function is returning them
var getPrimeNumber = function(n) {
if(n === 1) return "";
else if(n == 2) return 2;
else if(n == 3) return 3;
else {
for(i=Math.floor(Math.sqrt(n)); i>=2; i--){
//console.log(i);//maybe another var in here?
if(n%i !==0 && n%2 !==0 && n%3 !== 0)
return n; // 25/Math.sqrt(25) will be equal to zero this is what gives me 25 !!!
}
}
};
推荐答案
基于此页面,这将是一种确定数字是否为质数的方法:
Based on this page, this would be a method for determining if a number is a prime number:
function isPrime(number) {
let start = 2;
const limit = Math.sqrt(number);
while (start <= limit) {
if (number % start++ < 1) return false;
}
return number > 1;
}
在 node.js
中,大约需要250Ms才能确定2到100.000之间的素数.
In node.js
it takes about 250Ms for determining the prime numbers between 2 and 100.000.
这篇关于素数JavaScript的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文