Prove that:
If p is a prime number greater than 3 and k = ⌊2p/3⌋,
the sum
C(p,1)+C(p,2)+C(p,3)+C(p,4)+...C(p,k)
of k binomial coefficients is divisible by p^2.
 |
All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars |
