Does there exist a general algebraic formula for evaluating the $k^{th}$ consecutive prime number (in terms of $k$) when the set of prime numbers is arranged in an ascending order?
Does there exist a general algebraic formula (in terms of $n$) for evaluating the largest prime number $p$ less than or equal to any given natural number, $n$?
Asked
Active
Viewed 59 times
0
Pragnya Jha
- 184
-
4No, prime numbers are complicated. – Qi Zhu Feb 10 '20 at 08:28
-
2Could you be somewhat more specific what you mean by "general formula"? Note there are various methods to determine prime numbers, but no general algebraic formula exists which does what you're asking about. For more info, please check Wikipedia's Formula for primes. – John Omielan Feb 10 '20 at 08:29
-
Thank you for that Wikipedia link. Wilson's theorem is definitely useful and illuminating. – Pragnya Jha Feb 10 '20 at 08:41