Skip to content

Erdős problem 457

Is there some ϵ>0\epsilon > 0 such that there are infinitely many nn where all primes p≤(2+ϵ)log⁡np \le (2 + \epsilon) \log n divide ∏1≤i≤log⁡n(n+i)? \prod_{1 \le i \le \log n} (n + i)?

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

457.lean

Retained formal statement2 of 3

Taking nn to be the product of primes between log⁡n\log n and (2+o(1))log⁡n(2 + o(1)) \log n gives an example where q(n,log⁡n)≥(2+o(1))log⁡n. q(n, \log n) \ge (2 + o(1)) \log n. Can one prove that q(n,log⁡n)<(1−ϵ)(log⁡n)2q(n, \log n) < (1 - \epsilon) (\log n)^2 for all large nn and some ϵ>0\epsilon > 0?

FormalConjectures/ErdosProblems/457.leanErdos457.erdos_457.variants.one_sub1 lineExact file
sorry ↔ ∃ ε > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ↑(Erdos457.q n (Real.log ↑n)) < (1 - ε) * Real.log ↑n ^ 2
OpenStatement only, no proof