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?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.