Show that if n and k are integers with 1 ? k ? n, then

Chapter 9, Problem 17E

(choose chapter or problem)

Show that if \(n\) and \(k\) are integers with \(1 \leq k \leq n\), then \(\left(\begin{array}{l}n \\ k\end{array}\right) \leq n^{k} / 2^{k-1}\).

Equation Transcription:

Text Transcription:

n

k

1 \leq k \leq n

(n \\ k) \leq n^{k} / 2^{k-1}