This homework problem has me stumped.
Show that C(n,floor(n/2)) ≥ (2^n)/n
C(n,r) means the number of r-combinations, i.e.,
C(n,r) = --------
It says to use corollary 1 from the book, which is:
∑ C(n,k) = 2^n
Thanks in advance.