How to find nth prime number using formula?
Answers
Answered by
0
This is an algorithm to test whether or not a given integer is prime. It's called the AKS primality test
And can be done in polynomial time, which is usually considered a decent amount of time.
Now if you're trying to compute the nth prime, it has been proven that the nth prime must be greater than
nln(n)+n(ln(ln(n))−1)nln(n)+n(ln(ln(n))−1)
and less than
nln(n)+nln(ln(n))nln(n)+nln(ln(n))
When n≥6n≥6.
And can be done in polynomial time, which is usually considered a decent amount of time.
Now if you're trying to compute the nth prime, it has been proven that the nth prime must be greater than
nln(n)+n(ln(ln(n))−1)nln(n)+n(ln(ln(n))−1)
and less than
nln(n)+nln(ln(n))nln(n)+nln(ln(n))
When n≥6n≥6.
Similar questions