Menu Close

Prove-that-sum-of-all-prime-numbers-p-such-that-n-p-2-k-n-is-2-k-n-n-p-2-k-n-p-2-k-n-p-prime-




Question Number 3630 by prakash jain last updated on 16/Dec/15
Prove that sum of all prime numbers p  such that n≤p≤2^k n is ≥2^k n.  Σ_(n≤p≤2^k n) p  ≥ 2^k n     (p−prime)
Provethatsumofallprimenumberspsuchthatnp2knis2kn.np2knp2kn(pprime)

Leave a Reply

Your email address will not be published. Required fields are marked *