Prove that if p is prime and 1 less than or equal to k less than p then the binomial coefficient p = (p!)/(k!(p-k)!) is divisible by p.

k

Printable View

- February 10th 2008, 05:44 PMmandy123prove if p is prime then...
Prove that if p is prime and 1 less than or equal to k less than p then the binomial coefficient p = (p!)/(k!(p-k)!) is divisible by p.

k - February 10th 2008, 07:10 PMThePerfectHacker
This proves that for any we have that is divisible by . Now because is a prime this means is divisible by thus is divisibly by .