A binomial coefficient (N k) with k>=2 is called good if its least prime factor satisfies lpf(N k)>k . This is equivalent to the requirement that GCD((N k), k!) = 1.

binomial coefficient | deficiency | Erdős-Selfridge function | exceptional binomial coefficient