prove that.

where nCk = combintions.....

Printable View

- May 9th 2009, 04:01 AMKhonics89Positive integer n question help please
prove that.

where nCk = combintions..... - May 9th 2009, 04:14 AMbobby
$\displaystyle \sum_{k=0}^{n} nC_k*k^{(n-k)} * (n-k)^k $ $\displaystyle \leq \frac{1}{2} *n^n $

prove that.

where $\displaystyle nC_k =$ combinations.....

Just trying my latex skills out, but is that what you mean? This may help others out if it is right.