首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Sums of Three or More Primes
Authors:J B Friedlander  D A Goldston
Institution:Department of Mathematics, University of Toronto, Toronto, Ontario M5S 3G3, Canada ; Department of Mathematics and Computer Science, San Jose State University, San Jose, California 95192
Abstract:It has long been known that, under the assumption of the Riemann Hypothesis, one can give upper and lower bounds for the error $\sum _{p \le x} \log p - x$ in the Prime Number Theorem, such bounds being within a factor of $(\log x)^{2}$ of each other and this fact being equivalent to the Riemann Hypothesis. In this paper we show that, provided ``Riemann Hypothesis' is replaced by ``Generalized Riemann Hypothesis', results of similar (often greater) precision hold in the case of the corresponding formula for the representation of an integer as the sum of $k$ primes for $k \ge 4$, and, in a mean square sense, for $k \ge 3$. We also sharpen, in most cases to best possible form, the original estimates of Hardy and Littlewood which were based on the assumption of a ``Quasi-Riemann Hypothesis'. We incidentally give a slight sharpening to a well-known exponential sum estimate of Vinogradov-Vaughan.

Keywords:
点击此处可从《Transactions of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Transactions of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号