Page 1 of 1
Putnam, 1962: Summing Binomials
Posted: Tue Sep 04, 2012 9:31 pm
by sowmitra
Given, $n \in \mathbb{N}$, show that,
\[\displaystyle\sum^{n}_{r=1}r^{2}\binom{n}{r}=n(n+1)2^{n-2}\]
Re: Putnam, 1962: Summing Binomials
Posted: Tue Sep 04, 2012 9:36 pm
by sowmitra
Re: Putnam, 1962: Summing Binomials
Posted: Thu Sep 06, 2012 5:57 am
by SANZEED
$\displaystyle\sum_{r=1}^{n}r^{2}\binom{n}{r}=\displaystyle\sum_{r=1}^{n}nr\binom{n-1}{r-1}$ [Since $\binom{n}{r}=\frac{n}{r}\binom{n-1}{r-1}$]$=n\displaystyle\sum_{r=1}^{n}r\binom{n-1}{r-1}=n\displaystyle\sum_{r=1}^{n}(r-1)\binom{n-1}{r-1}+n\displaystyle\sum_{r=1}^{n}\binom{n-1}{r-1}$
Which is equal to $n\displaystyle\sum_{i=0}^{n-1}i\binom{n}{i}+\displaystyle\sum_{i=0}^{n-1}\binom{n-1}{i}=n\times (n-1)\times 2^{n-2}+2^{n-1}$ and the desired result follows.
Re: Putnam, 1962: Summing Binomials
Posted: Fri Sep 07, 2012 6:20 pm
by sowmitra
SANZEED wrote:$\displaystyle\sum_{r=1}^{n}r^{2}\binom{n}{r}=\displaystyle\sum_{r=1}^{n}nr\binom{n-1}{r-1}$ [Since $\frac{n}{r}\binom{n}{r}=\binom{n-1}{r-1}$]
I think, it is, $\displaystyle\binom{n}{r}=\frac{n}{r}\binom{n-1}{r-1}$
Re: Putnam, 1962: Summing Binomials
Posted: Fri Sep 07, 2012 11:16 pm
by SANZEED
Sorry, I have edited the typo.
Re: Putnam, 1962: Summing Binomials
Posted: Tue Sep 18, 2012 3:24 pm
by sm.joty
using second derivative can give a nice proof.
Re: Putnam, 1962: Summing Binomials
Posted: Tue Sep 18, 2012 11:00 pm
by SANZEED
sm.joty wrote:using second derivative can give a nice proof.
And here is the proof:
From the binomial theorem,we have,$(x+y)^{n}=\displaystyle\sum_{r=0}^{n}\binom{n}{r}x^{n-r}y^{r}$. Substitute $x=1$, then $(1+y)^{n}=\displaystyle\sum_{r=0}^{n}\binom{n}{r}y^{r}$. Now taking the second derivative on each side, we have that $n(n-1)(1+y)^{n-2}=\displaystyle\sum_{r=0}^{n}r(r-1)\binom{n}{r}y^{r-2}\Rightarrow n(n-1)(1+y)^{n-2}=\displaystyle\sum_{r=0}^{n}r^{2}\binom{n}{r}y^{r-2}-\displaystyle\sum_{r=0}^{n}r\binom{n}{r}y^{r-2}$. Substitute $y=1$ and use the lemma $\displaystyle\sum_{r=0}^{n}r\binom{n}{r}=n\cdot 2^{n-1}$ (Which can also be proved taking
first derivative instead of second). The result then follows.
Re: Putnam, 1962: Summing Binomials
Posted: Tue Oct 30, 2012 2:29 pm
by Tahmid Hasan
Masum wrote: The Instructor and the captain same- we have $2^{n-2}*n^2$ (why?). And if not, $2^{n-2}n$. And the total number is just their sum.
I beg to differ. When the instructor and captain is the same there are $n.2^{n-1}$ choices and when they are different there are $\binom{n}{2}.2!.2^{n-2}$ choices. Since the cases are disjoint, the total number of choices are $2^{n-2}(2n+n^2-n)=n(n+1)2^{n-2}$.
Re: Putnam, 1962: Summing Binomials
Posted: Wed Oct 31, 2012 11:30 pm
by Masum
Yeah, you are right. Something was wrong, when I was writing the post.
Re: Putnam, 1962: Summing Binomials
Posted: Wed Oct 31, 2012 11:33 pm
by Masum
Now, find the sum \[\sum_{i=0}^n\binom nii^3\]
The same trick should work.