Abstract: Suppose that all primes are colored with k colors. Then there exist monochromatic primes p1, p2, p3 such that p1+p2=p3+1.
Cites work
- A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
- Fourier transform restriction phenomena for certain lattice subsets and applications to nonlinear evolution equations. I: Schrödinger equations
- On \(\Lambda\) (p)-subsets of squares
- On sets of integers containing k elements in arithmetic progression
- Roth's theorem in the primes
- The number of monochromatic Schur triples
- The primes contain arbitrarily long arithmetic progressions
Cited in
(5)
This page was built for publication: A Schur-type addition theorem for primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643537)