Sums of five almost equal prime squares

被引：9
|
作者：
Bauer, C [1 ]
机构：
[1] Dolby Labs, San Francisco, CA 94103 USA
来源：
ACTA MATHEMATICA SINICA-ENGLISH SERIES | 2005年 / 21卷 / 04期
关键词：
prime numbers; exponential sums; L-functions;
D O I：
10.1007/s10114-004-0506-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let P-i, 1 <= i <= 5, be prime numbers. It is proved that every integer N that satisfies N (mod 24) can be written as N = P-1(2) + P-1(2) + P-1(2) + p(4)(2) + P-5(2), where vertical bar root N5 - p(i)vertical bar <= N1/2 - 19/850 + epsilon.
引用
收藏
页码：833 / 840
页数：8
相关论文
共 43 条
12345