Nth Prime Number Problem Statement

Find the Nth prime number given a number N.

Explanation:

A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exactly two distinct positive divisors: 1 and itself.

Example:

Input:

Q = 1
N = 7

Output:

17

Explanation:

The first 7 prime numbers are 2, 3, 5, 7, 11, 13, 17. Thus, the 7th prime number is 17.

Constraints:

1

Question

Nth Prime Number Problem Statement

Find the Nth prime number given a number N.

Explanation:

A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exactly two distinct positive divisors: 1 and itself.

Example:

Input:

Q = 1
N = 7

Output:

Explanation:

The first 7 prime numbers are 2, 3, 5, 7, 11, 13, 17. Thus, the 7th prime number is 17.

Constraints:

1 <= Q <= 100
1 <= N <= 10^4
Time Limit: 1 sec

Note:

You do not need to print anything; just implement the given function.

Accepted Answer

The task is to find the Nth prime number given a number N.

A prime number is a number greater than 1 that is not a product of two smaller natural numbers.
Prime numbers have only two factors - 1 and the number itself.
Start with a counter at 0 and a number at 2.
Increment the number by 1 and check if it is prime.
If it is prime, increment the counter.
Repeat until the counter reaches N.
Return the last prime number found.

Accepted Answer

function  findPrimeNumber(num){
        let arr = []
        let i =2
        while(arr.length < num){

if(isPrime(i)){
                arr.push(i)
             }
             i++  
        }
        return arr;

}
    console.log(findPrimeNumber(10))

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

}
        return true
    }

Accepted Answer

void nthPrimeNum(int input) {
	int count = 0;
	if (input >= 1) count++;
	
	for (int i = 3 ; i < 10000; i+=2) 
	{
		bool prime = true;
		for (int j = 2; j < i/2 ; j++) {
			if (i == 2 || i % j == 0) {	
			   prime = false;
			   break;
		    }
	   }
	   if (prime) {
	   	   count++;
		}
		if (count == input) {
			printf("%d
", i);
			break;
		}
	}
}