• Corpus ID: 239024326

# On improving a Schur-type theorem in shifted primes

@inproceedings{Wang2021OnIA,
title={On improving a Schur-type theorem in shifted primes},
author={Ruoyi Wang},
year={2021}
}
• R. Wang
• Published 19 October 2021
• Mathematics
We show that if N ≥ exp(exp(exp(k))), then any k-colouring of the primes that are less than N contains a monochromatic solution to p1 − p2 = p3 − 1.

## References

SHOWING 1-10 OF 15 REFERENCES
Difference sets and the primes
• Mathematics
• 2008
Suppose that A is a subset of {1,...,N} such that the difference between any two elements of A is never one less than a prime. We show that |A| = O(N exp(-c(log N)^{1/4})) for some absolute c>0.
Roth's theorem in the primes
We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood
Some of My Favorite Problems in Ramsey Theory
In this brief note, a variety of problems from Ramsey theory on which I would like to see progress made are described and I am offering modest rewards for most of these problems.
On sets of natural numbers whose difference set contains no squares
• Mathematics
• 1988
We show that if a sequence s/ of natural numbers has no pair of elements whose difference is a positive square, then the density of J/ n{l,...,«} is O(l/log«) c »), cn->-oo. This improves previous
Linear equations in primes
• Mathematics
• 2006
Consider a system ψ of nonconstant affine-linear forms ψ 1 , ... , ψ t : ℤ d → ℤ, no two of which are linearly dependent. Let N be a large integer, and let K ⊆ [-N, N] d be convex. A generalisation
Schur Number Five
A proof of the solution of a century-old problem, known as Schur Number Five, is constructed and validated using a formally verified proof checker, demonstrating that any result by satisfiability solvers can now be validated using highly trustworthy systems.
Analytic Number Theory
• Mathematics
• 2004
Introduction Arithmetic functions Elementary theory of prime numbers Characters Summation formulas Classical analytic theory of $L$-functions Elementary sieve methods Bilinear forms and the large
On monochromatic solutions to $$x-y=z^2$$
For $$k \in \mathbb {N}$$ , write S(k) for the largest natural number such that there is a k-colouring of $$\{1, \ldots ,S(k)\}$$ with no monochromatic solution to $$x-y=z^2$$ . That S(k)
Über die Kongruenz x + y ≡ z (mod p)
• Jahresber. Dtsch. Math. 25
• 1916