Skip to content

Erdős problem 1201

Is it true that for every ϵ,η>0\epsilon,\eta>0 there exists a kk such that the density of nn for which P(n(n+1)(n+k))>n1ϵP(n(n+1)\cdots(n+k))>n^{1-\epsilon} is at least 1η1-\eta, where P(m)P(m) is the greatest prime divisor of mm? A short argument via the Matomäki-Radziwiłł theorem establishes the lower-density version.

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:43d941b7594226be572523b97e817802b3a1405d7252edafb05b860633d2e3bf
Metadata
sha256:df6a6e67788a9d4bacfe6bcb72fb087f2062c4cf566ee94ff3982a3eaf423666
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:a1050eba42a598594b22089ce194375372c507f86a32ef9ce3b35fdd10bffc57
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page