document.write( "Question 1046042: Let , and
and
.\r
\n" );
document.write( "\n" );
document.write( "Prove that\r
\n" );
document.write( "\n" );
document.write( "+...+
. \n" );
document.write( "
Algebra.Com's Answer #661747 by robertb(5830)![]() ![]() You can put this solution on YOUR website! Use a combinatorial approach.\r \n" ); document.write( "\n" ); document.write( "Suppose a group of N people consists of two groups, with group A having \n" ); document.write( "\n" ); document.write( "The number of ways of selecting 0 people from group A and selecting k people from group B is \n" ); document.write( "\n" ); document.write( "The number of ways of selecting 1 person from group A and selecting k-1 people from group B is \n" ); document.write( "\n" ); document.write( "The number of ways of selecting 2 people from group A and selecting k-2 people from group B is \n" ); document.write( "\n" ); document.write( "This goes on until we come to the number of ways of selecting k people from group A and selecting 0 people from group B which is \n" ); document.write( "\n" ); document.write( "The total number of ways of selecting k people from N people, based on membership on group A or B, is then\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "But the total number of ways of selecting k people from N people, without any restriction (or regardless of membership), is \n" ); document.write( "\n" ); document.write( "Therefore,\r \n" ); document.write( "\n" ); document.write( " |