An Asymptotic Formula Involving Primes (Open)

Summary: Let $\pi(x)$ denote the counting function for primes. The problem calls for a proof of the asymptotic formula $\pi(N^{n+1}) \sim \sum_{n \le N} p^n$ ($N \rightarrow \infty$), with $n \ge 0$ fixed.

Classification: Primary, classical analysis; Secondary, asymptotic expansions

Renew SIAM · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+