Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- function isPrime(num) {
- if(num === 2 || num === 3){
- return true;
- }
- for(let i =2; i<=Math.floor(Math.sqrt(num)); i++){
- if(num % i === 0){
- return false;
- }
- }
- return true;
- }
- function nthPrime(n) {
- let i = 1; //2 is a prime number
- let j = 3; // 2, 3 are prime numbers, we satrt from 3. 2 was counted.
- while(true){
- let bool = isPrime(j);
- if(bool){
- i++;
- }
- if(i === n){
- return j;;
- }
- j += 2; //even number is not prime number, only odd number are possible to be prime
- }
- }
- nthPrime(10001);
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement