Skip to content

Erdős problem 139

Start work

Erdős Problem 139: Let rk(N)r_k(N) be the size of the largest subset of 1,...,N{1,...,N} which does not contain a non-trivial kk-term arithmetic progression. Prove that rk(N)=o(N)r_k(N) = o(N).

Erdős Problems records this as proved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it109 share a topic
Additive Combinatorics102Arithmetic Progressions27
None carries a Standing. Browse the topic.
Start workOpen sources