Erdős problem 387

Is there an absolute constant $c > 0$ such that, for all $1 \leq k < n$ , the binomial coefficient $\binom{n}{k}$ has a divisor in $(cn, n]$ ?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

387.lean

Retained formal statement4 of 4

The following is Schinzel's conjecture, which appears in [Gu04].

FormalConjectures/ErdosProblems/387.leanErdos387.erdos_387.variants.schinzel1 lineExact file

1True ↔ ∀ᶠ (k : ℕ) in Filter.atTop, ¬IsPrimePow k → ∃ n, ∀ i < k, ¬n - i ∣ n.choose k

OpenStatement only, no proof