document.write( "Question 1125784: 1) A warehouse employs 26 workers on first​ shift, 15 workers on second​ shift, and 12 workers on third shift. Eight workers are chosen at random to be interviewed about the work environment. \r
\n" ); document.write( "\n" ); document.write( " a) Find the probability of choosing exactly two second shift workers and two third shift workers. \r
\n" ); document.write( "\n" ); document.write( "I was able to understand everything up to this point. I think I am just having issues because classwork is piling up and my brain is a little foggy.
\n" ); document.write( "Thank you so much to anyone that can help!
\n" ); document.write( "

Algebra.Com's Answer #742185 by Theo(13342)\"\" \"About 
You can put this solution on YOUR website!
26 on first shift.
\n" ); document.write( "15 on second shift.
\n" ); document.write( "12 on third shift.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "8 workers are chosen at random.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "you want the probability of getting exactly 2 from the second shift and 2 from the third shift.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "in order for this to happen, you would need 2 from the second shift, 2 from the third shift, and 4 from the first shift.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "the number of ways of getting 8 from the total of 26 + 15 + 12 = 53 is c(53,8).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "the number of ways of getting 2 from the 15 on the second shift is c(15,2).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "the number of ways of getting 2 from the 12 on the third shift is c(12,2).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "the number of ways of getting 4 from the first shift is c(26,4).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "the probability should therefore be (c(15,2) * c(12,3) * c(26,4)) / c(53,8).\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "that would be equal to (105 * 66 * 14950) / 886322710 = .1168913973.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "i think that's the way to do it, but can't be 100% sure because there's no way to go back and tally up the total ways.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "one method i use to is try a simpler example where you can tally up the ways.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "that's difficult in this problem, but i did try a much simpler problem with only 2 possibilities (first shift and second shift only) with much less workers, and the formula seems to work with that much simpler problem.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "that, however, doesn't mean it will work with the more complex problem, although i have used the method before in other problems where it was satisfactory.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "here's a referenced on the topic.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "http://www.probabilityformula.org/combination-probability-formula.html\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "note that nCx is the same as c(n,x)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "they are both equal to n! / (x! * (n-x)!)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );