erdos_386.variants_forall

For all $2 \le k \le n - 2$, can $\binom{n}{k}$ be the product of consecutive primes infinitely often?

theorem erdos_386.variants_forall :
    answer(sorry) ↔ ∀ k ≥ 2, ∃ᶠ n in .atTop,
      k ≤ n - 2 ∧ ∃ p q : ℕ, n.choose k = ∏ i ∈ .Ico p q, nth Nat.Prime i

Recent Submissions

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