- #1
katatonia
- 2
- 0
Anybody know how to do this one:
For each odd prime p and for each k such that 0<= k <=(p-1), prove that:
the combination (p-1, k) is congruent to (-1)^k (mod p)
Any help would be great.
For each odd prime p and for each k such that 0<= k <=(p-1), prove that:
the combination (p-1, k) is congruent to (-1)^k (mod p)
Any help would be great.