Jump to ContentJump to Main Navigation

Online

99,00 € / $149.00*

* Prices subject to change. Shipping costs will be added if applicable.
Publication Date:
February 2010
ISSN:
1435-5337
DOI:
10.1515/forum.2010.039

See all formats and pricing

Online
Individual Subscription Online only
Euro [D] 99.00
RRP for USA, Canada, Mexico
US$ 149.00 *
Print
Individual Subscription Online only
Euro [D] 779.00
RRP for USA, Canada, Mexico
US$ 1168.00 *
Print + Online
Individual Subscription Online only
Euro [D] 935.00
RRP for USA, Canada, Mexico
US$ 1402.00 *
*Prices subject to change. Shipping costs will be added if applicable.

Managing Editor: Brüdern, Jörg

Editorial Board Member: Bruinier, Jan Hendrik / Cohen, Frederick R. / Droste, Manfred / Duzaar, Frank / Gallavotti, Giovanni / Garnier, Josselin / Neeb, Karl-Hermann / Noguchi, Junjiro / Ranicki, Andrew / Segal, Dan / Freydoon, Shahidi / Shigekawa, Ichiro / Sogge, Christopher D. / Strambach, Karl

6 Issues per year

IMPACT FACTOR 2011: 0.607
Rank 129 out of 288 in category Mathematics in the 2011 Thomson Reuters Journal Citation Report/Science Edition
Mathematical Citation Quotient 2011: 0.50

VolumeIssuePage

Issues

A density version of Vinogradov's three primes theorem

Hongze Li1 / Hao Pan2

1Department of Mathematics, Shanghai Jiaotong University, Shanghai 200240, People's Republic of China. lihz@sjtu.edu.cn

2Department of Mathematics, Nanjing University, Nanjing 210093, People's Republic of China. haopan79@yahoo.com.cn

Citation Information: Forum Mathematicum. Volume 22, Issue 4, Pages 699–714, ISSN (Online) 1435-5337, ISSN (Print) 0933-7741, DOI: 10.1515/forum.2010.039, February 2010

Publication History:
Received:
2007-11-13
Published Online:
2010-02-08

Abstract

Let 𝒫 denote the set of all primes. Suppose that P 1, P 2, P 3 are three subsets of 𝒫 with d 𝒫(P 1) + d 𝒫(P 2) + d 𝒫(P 3) > 2, where d 𝒫(Pi) is the lower density of Pi relative to 𝒫. We prove that for every sufficiently large odd integer n, there exist piPi such that n = p 1 + p 2 + p 3.

Comments (0)

Please log in or register to comment.