1 votes 1 votes Show that if $n$ and $k$ are integers with $1 \leq k \leq n,$ then $\binom{n}{k} \leq \frac{n^{k}}{2^{k−1}}.$ Combinatory kenneth-rosen discrete-mathematics counting binomial-theorem descriptive + – admin asked Apr 30, 2020 admin 277 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.