0 votes 0 votes Show that if $p$ is a prime and $k$ is an integer such that $1 \leq k \leq p − 1,$ then $p$ divides $\binom{p}{k} .$ Combinatory kenneth-rosen discrete-mathematics counting binomial-theorem descriptive + – admin asked Apr 30, 2020 admin 206 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.