c) (nCo)^2 + (nC1)^2 + (nC2)^2+...+(nCn)^2 = 2n Cn
____________________________________________________
ryan.cck:
no idea wot combinatoral argument means

.. we havent done binomial at skool either so yeh..
____________________________________________________
c) could be done by applying counting principles in your "permutation and combination" topic, usually discussed at the start of Yr11 Ext1 to frighten off or reduce the number of students in the Extension class (please, I am just joking!)
Here's a primer on combination, a retake of Grey Council's argument.
No. of ways of choosing n from 2n objects is 2n C(hoose)n = RHS
This could also be done by splitting the 2n objects into 2 sets of n objects:
Choose 0 objects in 1st set and n objects from 2nd set, or 1 object in 1st and n-1 in 2nd, or 2 in 1st and n-2 in 2nd, or etc. up to n objects in 1st and 0 in the 2nd.
From counting principles : "and" means "times" and "or" means "plus"
Thus nCo*nCn+nC1*nCn-1 + nC2*nCn-2 +...+nCn*nCo =
(nCo)^2 + (nC1)^2 + (nC2)^2+...+(nCn)^2 =LHS using a).
Yes, could also be done using CM_tutor's way.
maniac is right about c) being a special case of d).
btw d) has got a fancy name : Vandermonde's Convolution Formula