document.write( "Question 1201328: How many different committees can be formed from 7 teachers and 43 students if the committee consists of 3 teachers and 3 ​students? \n" ); document.write( "
Algebra.Com's Answer #835642 by math_tutor2020(3817)\"\" \"About 
You can put this solution on YOUR website!

\n" ); document.write( "Answer: 431,935
\n" ); document.write( "This number is slightly less than 432 thousand\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Explanation:\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "There are 7 teachers to choose from for slot1.
\n" ); document.write( "There are 6 teachers to choose from for slot2.
\n" ); document.write( "There are 5 teachers to choose from for slot3.
\n" ); document.write( "We count down by 1 each time we need to fill another slot.
\n" ); document.write( "This is because we cannot reselect a certain teacher more than once.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "There would be 7*6*5 = 42*5 = 210 permutations if the order of teachers mattered.
\n" ); document.write( "However, the order doesn't matter on a committee.
\n" ); document.write( "Each member has equal rank, and the seats aren't labeled.
\n" ); document.write( "If we had seat names like \"chair person\", \"VP\", \"secretary\", \"treasurer\", etc, then order would matter.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Let's look at the number of ways to arrange a group of 3 people.
\n" ); document.write( "I'll call them A,B,C
\n" ); document.write( "We have 3*2*1 = 6 ways to do so as listed below.
  1. ABC
  2. ACB
  3. BAC
  4. BCA
  5. CAB
  6. CBA
Because there are 6 ways to rearrange a group of three people, we must divide the permutations result we got earlier by 6. This will give us how many combinations of teachers there are.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "210/6 = 35
\n" ); document.write( "This corrects the over-counting done by a factor of 6.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "There are 35 ways to select the three teachers from a pool of seven. Order does not matter.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Here is another way to get the \"35\"
\n" ); document.write( "n = 7 teachers
\n" ); document.write( "r = 3 selections
\n" ); document.write( "Use the nCr combination formula since order doesn't matter
\n" ); document.write( "n C r = (n!)/(r!(n-r)!)
\n" ); document.write( "7 C 3 = (7!)/(3!*(7-3)!)
\n" ); document.write( "7 C 3 = (7!)/(3!*4!)
\n" ); document.write( "7 C 3 = (7*6*5*4!)/(3!*4!)
\n" ); document.write( "7 C 3 = (7*6*5)/(3!)
\n" ); document.write( "7 C 3 = (7*6*5)/(3*2*1)
\n" ); document.write( "7 C 3 = 210/6
\n" ); document.write( "7 C 3 = 35
\n" ); document.write( "Note: we have 7*6*5 = 210 up top and 3*2*1 = 6 down below
\n" ); document.write( "These values were mentioned in the previous section.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Yet another way to get the 35 is to look at Pascal's Triangle
\n" ); document.write( "Look at the row that has 1,7,... at the start
\n" ); document.write( "The start index is r = 0 which corresponds to the \"1\" at the left edge.
\n" ); document.write( "r = 1 then corresponds to the 7 and so on
\n" ); document.write( "Count over four spaces to arrive at the index r = 3, and this value is the first copy of \"35\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "---------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Unfortunately Pascal's triangle is not practical when determining how many ways there are to pick the three students from a pool of 43.
\n" ); document.write( "It can be done, but the triangle would be really massive.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So I'll use the nCr formula
\n" ); document.write( "n = 43 students
\n" ); document.write( "r = 3 student selections
\n" ); document.write( "n C r = (n!)/(r!(n-r)!)
\n" ); document.write( "43 C 3 = (43!)/(3!*(43-3)!)
\n" ); document.write( "43 C 3 = (43!)/(3!*40!)
\n" ); document.write( "43 C 3 = (43*42*41*40!)/(3!*40!)
\n" ); document.write( "43 C 3 = (43*42*41)/(3!)
\n" ); document.write( "43 C 3 = (43*42*41)/(3*2*1)
\n" ); document.write( "43 C 3 = 74046/6
\n" ); document.write( "43 C 3 = 12341\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Or a shortcut
\n" ); document.write( "43*42*41 = 74046 permutations
\n" ); document.write( "74046/6 = 12341 combinations
\n" ); document.write( "We divide by 6 for the same reasoning as applied to the teachers.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "---------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Let's recap
  • 35 ways to pick the three teachers (order doesn't matter).
  • 12341 ways to pick the three students (order doesn't matter).
Therefore, we have 35*12341 = 431,935 ways to pick the committee of 3 teachers and 3 students (order doesn't matter).
\n" ); document.write( "
\n" ); document.write( "
\n" );