Let $A \subseteq N$ and $D (A)$ be the set of those numbers which occur infinitely often as $a_{1} - a_{2}$ with $a_{1}, a_{2} \in A$ . What conditions on $A$ are sufficient to ensure $D (A)$ has bounded gaps?

Worked, still open.

number theory · open · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Write $ D(A)={d\in\mathbb N:\ |\\{a\in A:\ a+d\in A\\}|=\infty}, $ so (d\in D(A)) iff the translate $A$ and $A-d$ intersect infinitely often.

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

AMS 11 · open (literature)

theorem erdos_332 (A : Set ℕ) : (answer(sorry) : Set ℕ → Prop) A → HasBoundedGaps (D_A A)

open