Problem

Source:

Tags: number theory, p-adic



Given positive integer $k$, prove that there exists a positive integer $N$ depending only on $k$ such that for any integer $n\geq N$, $\binom{n}{k}$ has at least $k$ different prime divisors.