Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: √ ∞ ≠ ≤ ≥ ≈ ⇒ ∈ Δ θ ∴ ∑ ∫ π -

Login

Username

Password

Not registered yet?

Post a reply

Go back

Write your message and submit
:) :| :( :D :o ;) :/ :P :lol: :mad: :rolleyes: :cool: | :dizzy :eek :kiss :roflol :rolleyes :shame :down :up :touched :sleep :wave :swear :tongue :what :faint :dunno
Options

Go back

Topic review (newest first)

Navigatr85
2005-11-09 14:18:43

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

Navigatr85
2005-11-09 14:05:47

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.

Board footer

Powered by FluxBB