SOLUTION: Assuming that p(n) is the nth prime number, estabilish that p(n)>2n-1, for n>=5.
Algebra.Com
Question 700280: Assuming that p(n) is the nth prime number, estabilish that p(n)>2n-1, for n>=5.
Answer by solver91311(24713) (Show Source): You can put this solution on YOUR website!
Since 
is the 
th odd number, all you have to show is that the 5th odd number is not prime.
John
Egw to Beta kai to Sigma
My calculator said it, I believe it, that settles it
RELATED QUESTIONS
Let n be a positive integer, k the number of prime numbers less than or equal to n, and... (answered by richard1234)
For n ∈N, P(n) is a proposition such that for any n ∈ N, P(n + 1) ⇒... (answered by tommyt3rd)
Find the number of bases n \ge 2$ such that 100_n + 1_n is... (answered by math_tutor2020,ikleyn)
Let p be prime. Prove that...
(1 + p)^(p^(n - 1)) = 1(mod p^n) for all n = 1, 2, (answered by khwang)
) Show that if n is a natural number such that 2n-1 is prime, thenn n is a prime. Is the... (answered by richard1234)
*Proof by induction:
Prove that for n >= 1
2^(n+2)>= 2n + 5
I've solved the p(1)... (answered by Edwin McCravy)
prove that P(n,n) = 2P(n,n – 2)
and prove that C(2n,2) = 2C(n,2) + n^2 .
(answered by robertb)
If P+1 = N^2 , then find out the value of P !
Here , P= prime number & N = Normal... (answered by oscargut)
An integer n is called square-free if there does not exist a prime number p such that... (answered by richard1234)
