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.

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1201.lean

Retained formal statement2 of 2

Erdős wrote he could prove this for ϵ=1/2\epsilon=1/2.

FormalConjectures/ErdosProblems/1201.leanErdos1201.erdos_1201.variants.epsilon_half1 lineExact file
∀ η > 0, ∃ k, Filter.liminf (fun x => ↑↑(Nat.count (Erdos1201.Erdos1201Set (1 / 2) k) x) / ↑↑x) Filter.atTop ≥ 1 - η
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page