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,a3Aa_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?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:e46056a312fb473e38ab8e9ebf7a1a9558e900bfdfee5c5d996b7927705d6b65
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page