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

2021/11/30 by Alexey A. Orlov, Orlov, Alexey
Mathematics · #History and Theory of Mathematics #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.2111.15545

Abstract

We will generalize the combinatorial algorithms for computing π(x) to compute sums F(x) = ∑_{p ≤ x} p^k for k ∈ ℤ_{≥ 0}. The detailed exposition of algorithms is included along with implementation details.

Related

• The combinatorial algorithm for computing pi(x)
• Sums of Powers of Primes II
• On the prime counting function and the partial sum of reciprocals of odd primes
• On a Result of Hardy and Ramanujan
• On a sum involving the prime counting function π(x)