I have tried setting $$P=\Sigma_{i=0}^{n-1} (\Sigma_{j=i+1}^n(j(^nC_i) + i(^nC_j))$$ then $$P=\Sigma_{i=0}^{n-1} (\Sigma_{j=i+1}^n((n-j)(^nC_i) + (n-i)(^nC_j))$$ now adding them both $$2P=\Sigma_{i=0}^{n-1} (\Sigma_{j=i+1}^n(n((^nC_i)+(^nC_j))))$$ I think that we have to go ahead from here but I'm not able to think of anything else. Am I even on the right path? Please Help. Thanks!
2026-03-27 23:23:29.1774653809
Prove that $\Sigma_{i=0}^{n-1} (\Sigma_{j=i+1}^n(j(^nC_i) + i(^nC_j))) = n^22^{n-1}$
72 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
Comment:
In (1) we write the index region somewhat more conveniently to better see what's going on.
in (2) we use the symmetry of the index region and the summands.
In (3) we can write the sums separating the indices $i$ and $j$.
In (4) we simplify using closed forms and apply the binomial identity $\binom{p}{q}=\frac{p}{q}\binom{p-1}{q-1}$.
In (5) we shift the index to start with $i=0$ and use again a closed form expression as in (4).