Sums of many primes
classification
🧮 math.NT
keywords
formulaprimesanalogousassumingerrorexplicitfactorsfriedlander-goldston
read the original 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\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors an analogous result by Friedlander-Goldston.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.