Inequalities and asymptotic formulas for sums of prime powers (Q2501483)

By using Dusart's inequality \(p_n>n(\log n+\log \log n-1)\) for \(n\geq 2\), the author proves that for all integers \(k\geq 1\) one has \(\sum^n_{i=1}p_i^k>\frac {n^{k+1}}{k+1}\cdot(\log n)^k\), where \(p_i\) denotes the \(i\)th prime number. By applying the famous asymptotic formula by M. Cipolla, an asymptotic formula for \(\sum^n_{i=1}p^k_i\) is deduced, too. Reviewer's remark: The author attributes the above asymptotic formula without remainder term, to T. Salát and S. Znám. However, a more general result was obtained earlier by \textit{M. Kalecki} [``On certain sums extended over primes or prime factors'', Pr. Mat. 8, 121--129 (1964; Zbl 0148.02403)].