Erdős problem 332 · problems.science

Let $A\subseteq \mathbb{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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:3207a84e323558347c006e1d6406d5cfa200004baeb1c11ee8c3b7402136bf7b
Metadata: sha256:1191a50bd598d45c399bae0c599d1023cc5913a9df93002ecf2c16c879bc4565
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:2c6f3d660751c9409e71f5fe079f4ae118738c65b77b1e9315f15dd6d90e6a55

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science