document.write( "Question 1022435: In how many ways can a doubles game of tennis be arranged from eleven boys and seven girls if each side must have one boy and one girl?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #638136 by mathmate(429)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Question: \n" ); document.write( "In how many ways can a doubles game of tennis be arranged from eleven boys and seven girls if each side must have one boy and one girl? \n" ); document.write( " \n" ); document.write( "Solution: \n" ); document.write( "It should be understood that order does not count here, so it is a question of combination. \n" ); document.write( "For each match, we need two boys and two girls. \n" ); document.write( "The number of ways this can be done is C(11,2)*C(7,2)=55*21=1155 \n" ); document.write( "where C(n,r)=n!/(r!(n-r)!) is the binomial coefficient. \n" ); document.write( " \n" ); document.write( "Moreover, given two boys and two girls, there are two arrangements of opponents, i.e. a particular girl can choose one of the two boys as partner. \n" ); document.write( " \n" ); document.write( "Therefore the total number of different matches is 1155*2=2310. \n" ); document.write( " |