document.write( "Question 973968: 5 friends 3girls and 2boys! They have to go to market! One time 2girls and 1 boy is allowed n mandatory! How many such pattern can be obtained! \n" ); document.write( "
Algebra.Com's Answer #595986 by Boreal(15235)![]() ![]() You can put this solution on YOUR website! For the mandatory pattern, there are 3 ways to choose 2 girls \n" ); document.write( "AB, AC,BC \n" ); document.write( "There are two ways to choose 2 boys for the one boy, D or E.\r \n" ); document.write( "\n" ); document.write( "The mandatory pattern of 2 girls and 1 boy may be chosen as \n" ); document.write( "ABD \n" ); document.write( "ABE \n" ); document.write( "ACD \n" ); document.write( "ACE \n" ); document.write( "BCD \n" ); document.write( "BCE\r \n" ); document.write( "\n" ); document.write( "If there are other patterns, the question itself has to be rewritten.\r \n" ); document.write( "\n" ); document.write( "If the question is that 3 may go to market, and it doesn't matter how they are chosen, then\r \n" ); document.write( "\n" ); document.write( "there are 5C3=10 total ways the 5 children may be chosen. Some will have 3 girls, some will have 2 girls, and some will have 1 girl.\r \n" ); document.write( "\n" ); document.write( "The number of patterns that allow 2 girls and 1 boy are 6. \n" ); document.write( "The number of patterns that allow 3 girls are 1 \n" ); document.write( "The number of patterns that allow 1 girl and 2 boys are 3, both boys and each of the three girls. \n" ); document.write( " |