ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gk(N)G_k(N) be such that any set of NN integers contains a subset of size at least Gk(N)G_k(N) which does not contain a kk-term arithmetic progression. Determine the size of Gk(N)G_k(N). How does it relate to Rk(N)R_k(N), the size of the largest subset of {1,…,N}\{1,\ldots,N\} without a kk-term arithmetic progression? Is it true that lim⁡N→∞R3(N)G3(N)=1?\lim_{N\to \infty}\frac{R_3(N)}{G_3(N)}=1?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.