Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
SOLVED - $500
Let $r_3(N)$ be the size of the largest subset of $\{1,\ldots,N\}$ which does not contain a non-trivial $3$-term arithmetic progression. Prove that $r_3(N)\ll N/(\log N)^C$ for every $C>0$.
#140
:
[ErGr80]
[Er97c]
additive combinatorics
,
arithmetic progressions
Proved by Kelley and Meka
[KeMe23]
. In
[ErGr80]
they suggest this holds for every $k$-term arithmetic progression.
Previous
Next