Euclid theory problem on number theory for p divides the binomial coefficient.
110876
Prove that $p\mid \binom{p}{k},\ 0< k< p$
111505
Proof $\binom{p-1}{k}\equiv (-1)^k \mod{p}$
150438
Binomial theorem for non integers ? O_o ??
135351
$C(n,p)$: even or odd?
1507
The product of $n$ consecutive integers is divisible by $n$ factorial
117775
Combinatorial proof of a Stirling number identity.
120074
Prove by Combinatorial Argument that $\binom{n}{k}= \frac{n}{k} \binom{n-1}{k-1}$
125220
Solving binomial theorem via induction
98082
Another combinatorics problem: $\sum\limits_{k = 0}^n (-1)^k \binom{2n-k}k2^{2n-2k}=2n+1$
7083
Alternating sum of binomial coefficients: given $n \in \mathbb N$, prove $\sum^n_{k=0}(-1)^k {n \choose k} = 0$
73515
Primes Number Theory
91648
Binomial coefficient proof
38876
$r! \equiv (−1)^k \pmod p$
91239
Sum of binomial coefficients involving $n,p,q,r$
71797
Combinatorial argument for $\sum\limits_{k=i}^{n}\binom{n}{k}\binom{k}{i} = \binom{n}{i}2^{n-i}$
3632
Basic number theory proofs
144814
If $p$ and $q$ are primes, which binomial coefficients $\binom{pq}{n}$ are divisible by $pq$?