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

To find the Nth prime number given a number N, implement a function that returns the Nth prime number.

Create a function that takes N as input and returns the Nth prime number.
Use a loop to iterate through numbers and check if they are prime.
Keep track of the count of prime numbers found until reaching N.
Optimize the algorithm by checking only up to the square root of the number for primality.
Example: For N = 7, the 7th prime number is 17.

Nth Prime Number Problem Statement

Explanation:

Example:

Input:

Output:

Explanation:

Constraints:

Note:

Siemens Senior Systems Engineer interview questions & answers

Popular interview questions of Senior Systems Engineer