Skip to content

Erdős problem 1097

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

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1097.lean

Retained formal statement2 of 3

A trivial lower bound: for sufficiently large n there exist sets AA with ∣A∣=n|A| = n that contain at least Ω(n)\Omega(n) distinct common differences of three-term arithmetic progressions.

FormalConjectures/ErdosProblems/1097.leanErdos1097.erdos_1097.variants.lower_bound1 lineExact file
∃ c > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ∃ A, A.card = n ∧ c * ↑n ≤ ↑(Erdos1097.CommonDifferencesThreeTermAP A).ncard
TextbookStatement only, no proof