Erdős problem 1097

The main conjecture: for any finite set of integers $A$ with $|A| = n$ , the number of distinct common differences in three-term arithmetic progressions is $O(n^{3/2})$ .

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1097.lean

Retained formal statement3 of 3

A weaker bound has been proven: there are always at most $n^2$ such values of $d$ .

FormalConjectures/ErdosProblems/1097.leanErdos1097.erdos_1097.variants.weaker1 lineExact file

1∀ (A : Finset ℤ), (Erdos1097.CommonDifferencesThreeTermAP A).ncard ≤ A.card ^ 2

TextbookStatement only, no proof