CR-MO 2006 Problem 2

Let $n$ be a positive integer, and let $p$ be a prime, such that $n>p$ . Prove that : $$\binom np \equiv \left\lfloor\frac{n}{p}\right\rfloor \ \pmod p.$$