Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm trying to calculate the upper bound of the binomial coefficient:

\begin{equation} \sum\limits_{j=0}^{k} {n\choose j}<\left( \frac{ne}{k} \right)^k \end{equation}

Using binomial theorem and for $x\ge0$:

\begin{equation} \sum\limits_{j=0}^{k} {n\choose j}{x^j}\le(1+x)^n \end{equation}

dividing both sides by $x^k$,we obtain:

$$ \sum\limits_{j=0}^{k} {n\choose j}{\frac{1}{x^{k-j}}}\le\frac{(1+x)^n}{x^k} $$

For x<1 the term $\frac{(1+x)^n}{x^k}$

obtain his minimum value at point $x=\frac{k}{n-k}$

I don't understand why... Could you please help. I thank you in advance.

share|improve this question

1 Answer 1

up vote 1 down vote accepted

Consider $f(x) = \frac{(1+x)^n}{x^k}$ and apply your favorite calculus-based test for local extrema.

share|improve this answer
    
i got it ! thank you –  david Jun 15 '12 at 21:14

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.