Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**Navigatr85****Member**- Registered: 2005-11-08
- Posts: 2

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.,

n!

C(n,r) = --------

r!(n-r)!

It says to use corollary 1 from the book, which is:

n

∑ C(n,k) = 2^n

k=0

Thanks in advance.

Offline

**Navigatr85****Member**- Registered: 2005-11-08
- Posts: 2

Also, I forgot to say that n is an integer greater than 1.

Offline

Pages: **1**