document.write( "Question 475183: Dear math teacher, \r
\n" );
document.write( "\n" );
document.write( "I am not sure why I am having a pretty hard time with combinations. I really nailed the Permutations section of the chapter but the combinations are not that nice to me. \r
\n" );
document.write( "\n" );
document.write( "Here is the problem I am struggling with:
\n" );
document.write( "\"A has 3 maps and B has 9 maps. Determine the number of ways in which they can exchange maps if each keeps his initial number of maps. \"\r
\n" );
document.write( "\n" );
document.write( "Here is what I did: 12C3 + 12C9 = 220 + 220 = 440 but that is not the right answer. Thank you for your time and help. \r
\n" );
document.write( "\n" );
document.write( "Yours respectfully, \r
\n" );
document.write( "\n" );
document.write( "I. \n" );
document.write( "
Algebra.Com's Answer #325818 by scott8148(6628)![]() ![]() You can put this solution on YOUR website! there are 3 ways that A can give B one map, and 9 ways that B can give A one map \n" ); document.write( "___ 27 ways they can exchange ONE map ___ (3C1) * (9C1)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "for TWO maps ___ (3C2) * (9C2)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "for THREE maps ...\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "add the three results \n" ); document.write( " |