document.write( "Question 594320: simplify (n-1)C(r-1) + (n-1)Cr \n" ); document.write( "
Algebra.Com's Answer #376863 by richard1234(7193)![]() ![]() You can put this solution on YOUR website! Pascal's triangle. It can be proven using a committee-forming argument (suppose you choose r people from a group of n. If person X is chosen, we have to choose r-1 people from n-1. If X is not chosen, we choose r people from n-1).\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You can also do it algebraically. \n" ); document.write( " |