Skip to content

Erdős problem 537

Let ϵ>0\epsilon>0 and NN be sufficiently large. If A⊆{1,…,N}A\subseteq \{1,\ldots,N\} has ∣A∣≥ϵN\lvert A\rvert \geq \epsilon N then must there exist a1,a2,a3∈Aa_1,a_2,a_3\in A and distinct primes p1,p2,p3p_1,p_2,p_3 such that a1p1=a2p2=a3p3?a_1p_1=a_2p_2=a_3p_3?

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:559c4138127ea15fde156d789da0e1457adfb5b27c2aa13378fd29761d780ad4
Metadata
sha256:9c3cdc6bcdf2229c3672aec54a02d95554426980040ab100c2889b4fb836359e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e46056a312fb473e38ab8e9ebf7a1a9558e900bfdfee5c5d996b7927705d6b65
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb