Upper bound for prime
Posted: 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?
\[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?