Erdős problem 1094 · problems.science

For all $n\ge 2k$ the least prime factor of $\binom{n}{k}$ is $\le\max(n/k,k)$ , with only finitely many exceptions.

Sources

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

1 retained statement2415f78e850a

FormalConjectures/ErdosProblems/

1094.lean

Retained formal statement1 of 1

For all $n\ge 2k$ the least prime factor of $\binom{n}{k}$ is $\le\max(n/k,k)$ , with only finitely many exceptions.

FormalConjectures/ErdosProblems/1094.leanErdos1094.erdos_10941 lineExact file

1{(n, k) | 0 < k ∧ 2 * k ≤ n ∧ (n.choose k).minFac > max (n / k) k}.Finite

OpenStatement only, no proof