document.write( "Question 1199291: A signal can be formed by running different colored flags up a pole, one above the other. Find the number of different signals consisting of 8 flags that can be made if 3 of the flags are white, 3 are red, and 2 are blue. \n" ); document.write( "
Algebra.Com's Answer #833099 by ikleyn(52781)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "A signal can be formed by running different colored flags up a pole,
\n" ); document.write( "one above the other. Find the number of different signals consisting of
\n" ); document.write( "8 flags that can be made if 3 of the flags are white, 3 are red, and 2 are blue.
\n" ); document.write( "~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "It is the same as to ask how many 8-letter distinguishable words\r\n" );
document.write( "can be made using 3 letters W, 3 letters R and 2 letters B.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The anwer is  \"8%21%2F%283%21%2A3%21%2A2%21%29\" = \"%281%2A2%2A3%2A4%2A5%2A6%2A7%2A8%29%2F%281%2A2%2A3%2A1%2A2%2A3%2A1%2A2%29\" = 560.\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Solved.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For explanations, and to see many other similar solved problems, look into the lesson\r
\n" ); document.write( "\n" ); document.write( "    - Arranging elements of sets containing indistinguishable elements \r
\n" ); document.write( "\n" ); document.write( "in this site.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Also,  you have this free of charge online textbook in ALGEBRA-II in this site\r
\n" ); document.write( "\n" ); document.write( "    - ALGEBRA-II - YOUR ONLINE TEXTBOOK.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The referred lesson is the part of this online textbook under the topic  \"Combinatorics: Combinations and permutations\". \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Save the link to this textbook together with its description\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Free of charge online textbook in ALGEBRA-II
\n" ); document.write( "https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "into your archive and use when it is needed.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );