JavaScript implementation find prime number code sharing

This article mainly introduces the JavaScript implementation to find prime number code sharing, this article directly gives the implementation code, the need for friends can refer to the following

Well, there's no background note, no advanced skills, sheer boredom, trying to find all the primes in 10000. So here we go:

?

1 2 3 4 5 6 7 8 9 10 11 12 13-14

function Zhishu (num) {if (num = 1) {return false;} if (num = 2) {return true;} for (var i = 2; I <= math.sqrt (nu m); i++) {if (num% i = = 0) {return false;}} ' return true; }

Use instance:

?

1 2 3 4 5 6 7

var zhishuarray = []; for (var j = 1; j < 100000; J +) {if (Zhishu (j)) {Zhishuarray.push (j);}}