eljose
- 484
- 0
Hello i need help to prove the formula:
p_n =\sum_{k=2}^{2^{n}}[ |n/(1+ \pi (k))|^{1/n}]
where []=floor function and |x| the modulus of x...this appear in number theory to evaluate the n-th prime however i am not able to prove it...

p_n =\sum_{k=2}^{2^{n}}[ |n/(1+ \pi (k))|^{1/n}]
where []=floor function and |x| the modulus of x...this appear in number theory to evaluate the n-th prime however i am not able to prove it...



Last edited: