sauravshakya
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)=?



This Question is Closed

klimenkov
Best Response
You've already chosen the best response.
1
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
Best Response
You've already chosen the best response.
0
2 is prime?

sauravshakya
Best Response
You've already chosen the best response.
0
oh.......

klimenkov
Best Response
You've already chosen the best response.
1
@lgbasallote sure. It has no dividers except 1 and itself 2.

tcarroll010
Best Response
You've already chosen the best response.
0
Yes, 2 is prime. Interestingly, there is a relationship between terms in the Fibonacci sequence and primes.

lgbasallote
Best Response
You've already chosen the best response.
0
then why isn't 1 prime?

klimenkov
Best Response
You've already chosen the best response.
1
It is not prime by definition.

Coolsector
Best Response
You've already chosen the best response.
0
because it has only 1 dividers ;)

lgbasallote
Best Response
You've already chosen the best response.
0
you can actually make a code that can find the nth prime number...

sauravshakya
Best Response
You've already chosen the best response.
0
So, this question has no answer.
Thanx guys.

Coolsector
Best Response
You've already chosen the best response.
0
i know that there are formulas that holds up to a given n
but not a general one

klimenkov
Best Response
You've already chosen the best response.
1
\(2^{43112609}−1\) Is the biggest prime number that was found.

sara12345
Best Response
You've already chosen the best response.
0
that code depends on stack values, a single formula for tn is not there

Coolsector
Best Response
You've already chosen the best response.
0
given n  i mean up to a specific n