Back to Problems

erdos_457.variants.qnk

Specification

More generally, let $q(n, k)$ denote the least prime which does not divide $\prod_{1 \le i \le k}(n + i)$. This problem asks whether $q(n, \log n) \ge (2 + \epsilon) \log n$ infinitely often.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_457.variants.qnk : answer(sorry) ↔ ∃ ε > (0 : ℝ),
    { (n : ℕ) | (2 + ε) * Real.log n ≤ q n (Real.log n) }.Infinite
ID: ErdosProblems__457__erdos_457.variants.qnk
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.