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 - The Fusion of Science and Community**

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

# Congruence help

Loading...

Similar Threads - Congruence help | Date |
---|---|

I Congruence Subgroups and Modular Forms Concept Questions | Dec 27, 2016 |

Basic Congruences Confusion | Nov 12, 2012 |

A Theorem on Squares and Congruences | Oct 21, 2012 |

Congruence of rectangles? please help | Jun 28, 2010 |

System of linear congruences Help, please! | Dec 26, 2004 |

**Physics Forums - The Fusion of Science and Community**