All Questions

Given a prime $p$ and an integer $0 \leq k \leq p-1$, a famous congruence on binomial coefficients states: $$\binom{p-1}{k} \equiv (-1)^k \pmod{p}$$ It is generally taught as a consequence of Pascal’s ...