erdős #1097
Let be a set of integers. How many distinct can occur as the common difference of a three-term arithmetic progression in ?In particular, are there always many such ?
Worked, still open.
number theory · open · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let [ D(A):={,d\in \mathbb Z\setminus{0}:\ \exists a\in\mathbb Z\ \text{with}\ a,\ a+d,\ a+2d\in A,} ] [[nomath]](the set of *distinct* nonzero common differences of 3-term arithmetic progressions in $A$)[[/nomath]]. Counting (d>0) or (d\neq 0) only changes things by a factor of $2$.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 11 · solved (literature)
theorem erdos_1097 : answer(False) ↔ ∃ C > (0 : ℝ), ∀ (A : Finset ℤ),
(CommonDifferencesThreeTermAP A).ncard ≤ C * (A.card : ℝ) ^ (3 / 2 : ℝ)formal-conjectures/1097.lean ↗links
1989 problem session · paper
status
open