Skip to content

Erdős problem 331

Let A,B⊆NA,B\subseteq \mathbb{N} such that for all large NN∣A∩{1,…,N}∣≫N1/2\lvert A\cap \{1,\ldots,N\}\rvert \gg N^{1/2}and∣B∩{1,…,N}∣≫N1/2.\lvert B\cap \{1,\ldots,N\}\rvert \gg N^{1/2}. Is it true that there are infinitely many solutions to a1−a2=b1−b2≠0a_1-a_2=b_1-b_2\neq 0 with a1,a2∈Aa_1,a_2\in A and b1,b2∈Bb_1,b_2\in B?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:651b4a0165e42ba9fe25ead9c6f3dfb37bd35fd06bb4cee89dd4df554335296b
Metadata
sha256:a1815657ac15a257d9024b2d8dd42a0cd9d525a56e5ad33b891ef8f1cb072da8
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0208edad6afb8b21aaadadf7723520604801416c731786e7a148a21c58621bb2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb