MODBasic Difficult

Problem - 4222

Let $p$ be a prime number and $\lfloor{x}\rfloor$ denote the largest integer not exceeding real number $x$. Show that $$C_n^p\equiv\left\lfloor{\frac{n}{p}}\right\rfloor\pmod{p}$$


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error