document.write( "Question 1209585: The number of ways to seat 3 students, 2 male teachers, and 4 female teachers around a round table with 10 chairs is how much?\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #849573 by ikleyn(52873)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "The number of ways to seat 3 students, 2 male teachers, and 4 female teachers
\n" ); document.write( "around a round table with 10 chairs is how much?
\n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For standard circular permutations, the general statement is:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "    +---------------------------------------------------------------------------------+\r\n" );
document.write( "    |                If there are n distinguishable objects,                          |\r\n" );
document.write( "    | then there are (n-1)! distinguishable circular permutations of these n objects. |\r\n" );
document.write( "    +---------------------------------------------------------------------------------+\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Since you came with more complicated problem with a vacant chair, you should be just
\n" ); document.write( "familiar with these traditional problems with no vacant chairs.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "In this problem, we have 3 students + 2 male teachers + 4 female teachers.
\n" ); document.write( "They all are distinguishable objects. So, there are 3+2+4 = 9 distinguishable objects.\r
\n" ); document.write( "\n" ); document.write( "Plus to it, we have one chair, which is #10 distinguishable object.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Thus, the total of distinguishable objects in this problem is 10.
\n" ); document.write( "All 10 objects are distinguishable and there are no repeating undistinguishable objects.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Therefore, according to the general statement, in this problem there are (10-1)! = 9!
\n" ); document.write( "distinguishable circular permutations.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So, this given problem is similar/identical to just familiar to you other problems
\n" ); document.write( "on circular permutations with distinguishable objects.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The difference appears when the number of undistinguishable objects in the problem
\n" ); document.write( "(like undistinguishable vacant chairs) is 2 or more. Then the value of different
\n" ); document.write( "circular arrangement (n-1)!, where n is the number of all objects, in total, should be
\n" ); document.write( "divided by k!, where k is the number undistinguishable objects (repeating copies). \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );