Anybody know how to do this one:(adsbygoogle = window.adsbygoogle || []).push({});

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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Congruence help

**Physics Forums | Science Articles, Homework Help, Discussion**