document.write( "Question 923981: 1/A batch contains 10 transistors of which three are defective. If three are chosen, in how many ways can one get two defective?\r
\n" );
document.write( "\n" );
document.write( "2/ Three marbles are chosen from an urn that contains 5 reds, 4 white, and 3 blue marbles. how many samples if we choose all three of the same color?\r
\n" );
document.write( "\n" );
document.write( "I very appreciate your help !!! \n" );
document.write( "
Algebra.Com's Answer #560520 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! I'll do the first one to get you started.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "# 1\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "10 transistors \n" ); document.write( "3 defective \n" ); document.write( "7 nondefective\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Number of ways to get exactly 2 defective\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "(3 C 2)*(7 C 1) = (3)*(7) = 21\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "There are 21 ways to pick exactly 2 defective transistors (out of 3 selected transistors).\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Side note: I'm using the combination formula \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Another side note: 3 C 2 represents picking exactly 2 bad transistors out of 3. 7 C 1 represents picking exactly 1 good transistor out of 7. \n" ); document.write( " |