The combinatorial method to compute the sum of the powers of primes

Abstract

We will generalize the combinatorial algorithms for computing $\pi (x)$ to compute sums $F(x)={\sum }_{p\le x}{p}^k$ for $k\in {\mathbb{Z}}_{\ge 0}$. The detailed exposition of algorithms is included along with implementation details.