MathDB
D 1

Source:

May 25, 2007
floor functionmodular arithmeticblogsCongruences

Problem Statement

If pp is an odd prime, prove that (kp)kp(modp).{k \choose p}\equiv \left\lfloor \frac{k}{p}\right\rfloor \pmod{p}.