Is there a formula to get nth term of the prime number.
t(1)=2
t(2)=3
t(3)=5
t(4)=7
.
.
.
t(n)=?

Question

Is there a formula to get nth term of the prime number.
t(1)=2
t(2)=3
t(3)=5
t(4)=7
.
.
.
t(n)=?

klimenkov · Answer

You will be given a lot of money if you'll find it! This is one of the most populap math problem in the world!

lgbasallote · Answer

2 is prime?

anonymous · Answer

oh.......

klimenkov · Answer

@lgbasallote sure. It has no dividers except 1 and itself 2.

anonymous · Answer

Yes, 2 is prime.  Interestingly, there is a relationship between terms in the Fibonacci sequence and primes.

lgbasallote · Answer

then why isn't 1 prime?

klimenkov · Answer

It is not prime by definition.

anonymous · Answer

because it has only 1 dividers ;)

lgbasallote · Answer

you can actually make a code that can find the nth prime number...

anonymous · Answer

So, this question has no answer.
Thanx guys.

anonymous · Answer

i know that there are formulas that holds up to a given n 
but not a general one

klimenkov · Answer

$2^{43112609}−1$ Is the biggest prime number that was found.

anonymous · Answer

that code depends on stack values, a single formula for tn is not there

anonymous · Answer

given n - i mean up to a specific n