My question is whether there is a simple criteria to determine whether n divides C(n,r). For example if n is prime or more generally, g.c.d of n and r equals 1 , then n divides C(n,r).A naive method is to compute C(n,r) mod n. is there any simpler way without evaluating C(n,r) mod n .
Asked
Active
Viewed 80 times
1
-
When I tried to search a bit, I found that there are some posts which seem related. For example, When is $\binom{n}{k}$ divisible by $n$? and Conditions for which $n | {n \choose k} $for all $k$ – Martin Sleziak Oct 23 '16 at 08:28