- #1
tade
- 702
- 24
Let's say the function is of a form F(x), where F(n) gives us the value of the n-th prime number, for all values of n.
And it computes and discovers subsequent prime numbers directly without using any form of brute-force computation.If such a function is discovered, how ground-breaking would it be considered to the field of mathematics?
Also, even though it has not been discovered, does this F(x) function have a tentative name?
And it computes and discovers subsequent prime numbers directly without using any form of brute-force computation.If such a function is discovered, how ground-breaking would it be considered to the field of mathematics?
Also, even though it has not been discovered, does this F(x) function have a tentative name?
Last edited: