Skip to content

Erdős problem 332

Start work

Let A⊆NA\subseteq \mathbb{N} and D(A)D(A) be the set of those numbers which occur infinitely often as a1−a2a_1 - a_2 with a1,a2∈Aa_1, a_2\in A. What conditions on AA are sufficient to ensure D(A)D(A) has bounded gaps?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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

Exact provenance

Problem row
sha256:3207a84e323558347c006e1d6406d5cfa200004baeb1c11ee8c3b7402136bf7b
Metadata
sha256:1191a50bd598d45c399bae0c599d1023cc5913a9df93002ecf2c16c879bc4565
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:2c6f3d660751c9409e71f5fe079f4ae118738c65b77b1e9315f15dd6d90e6a55
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON