检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Claus BAUER
机构地区:[1]Dolby Laboratories, Beijing 100020, China
出 处:《Frontiers of Mathematics in China》2017年第2期261-280,共20页中国高等学校学术文摘·数学(英文)
摘 要:We use the large sieve inequality with sparse sets of moduli to prove a new estimate for exponential sums over primes. Subsequently, we apply this estimate to establish new results on the binary Goldbach problem where the primes are restricted to given arithmetic Drogressions.We use the large sieve inequality with sparse sets of moduli to prove a new estimate for exponential sums over primes. Subsequently, we apply this estimate to establish new results on the binary Goldbach problem where the primes are restricted to given arithmetic Drogressions.
关 键 词:Three primes theorem exponential sums over primes sparse set ofmodules
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.190