Let N t (k) be the maximum number of k-term arithmetic progressions of real numbers, any two of which have t points in common. We determine N 2(k) for prime k and all large k, and give upper and lower bounds for N t (k) when t ≥ 3.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
* Research supported in part by NSF grant DMS-0070618.