Problem
The primes in order are 2, 3, 5, 7, 11, 13, … Given a position n, return the prime at that position. Testing numbers one by one works for small n; for the larger inputs a sieve over a range that is big enough is much faster.
Implement nth_prime(n).
Input
n: The position in the list of primes, starting at 1.
Output
Return the nth prime. nth_prime(1) is 2.
Constraints
1 ≤ n ≤ 100,000
Examples
Input:
n = 6
Expected output:
expected = 13
Input:
long long n = 6;
Expected output:
long long expected = 13;
Input:
long n = 6;
Expected output:
long expected = 13;
Explanation
The primes start 2, 3, 5, 7, 11, 13, so the sixth one is 13.
Input:
n = 1
Expected output:
expected = 2
Input:
long long n = 1;
Expected output:
long long expected = 2;
Input:
long n = 1;
Expected output:
long expected = 2;
Explanation
The first prime is 2.
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
Counting primes as you find them works, but testing every number by trial division gets slow for large n.
Hint 2
The 100,000th prime is below 1,300,000, so a sieve of that size is enough.
Hint 3
If your sieve turns out too small, double it and try again.
Expected complexity
O(m log log m) time, O(m) extra space, where m is the sieve size
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.