Sums of many primes

Abstract

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\ge 5$ primes. Our error terms in such a formula improve by some logarithmic factors an analogous result by Friedlander-Goldston.

References in corpus (1)

• The number of Goldbach representations of an integer

Cited by in corpus (7)

• A Cesàro Average of Goldbach numbers
• Sum of one prime and two squares of primes in short intervals
• A Cesàro Average of Hardy-Littlewood numbers
• On a smoothed average of the number of Goldbach representations
• A remark on the conditional estimate for the sum of a prime and a square
• A mean value of the representation function for the sum of two primes in arithmetic progressions
• The average number of Goldbach representations over multiples of $q$