0 votes 0 votes Show that $\binom{n}{k} \leq 2^{n}$ for all positive integers $n$ and all integers $k$ with $0 \leq k \leq n.$ Combinatory kenneth-rosen discrete-mathematics counting binomial-theorem descriptive + – admin asked Apr 30, 2020 • edited Apr 30, 2020 by Lakshman Bhaiya admin 270 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.