Upper bound for prime

For discussing Olympiad Level Number Theory problems
User avatar
Masum
Posts:592
Joined:Tue Dec 07, 2010 1:12 pm
Location:Dhaka,Bangladesh
Upper bound for prime

Unread post by Masum » Wed Feb 18, 2015 9:34 pm

This is actually a very bad upper bound. Can be further optimized more and more. However, prove that,
\[p_{2n}<(n+1)(2n+1)\binom n{\left\lfloor \frac n2\right\rfloor}^2\]
Hint: viewtopic.php?f=27&t=3296
Right hand same, right?
One one thing is neutral in the universe, that is $0$.

Post Reply