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

You are not logged in.

#1 2005-11-08 15:05:47

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

discrete math problem

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

#2 2005-11-08 15:18:43

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

Re: discrete math problem

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

Offline

Board footer

Powered by FluxBB