document.write( "Question 1098954: Suppose five integers are chosen successively at random between 0 and 15, inclusive. Find the probability that:
\n" );
document.write( "(Round your answer to four decimal places if necessary.)
\n" );
document.write( "a. not more than 2 are the same? \n" );
document.write( "
Algebra.Com's Answer #713591 by Edwin McCravy(20056)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "There are 16 integers from 0 to 15, inclusive. \r\n" ); document.write( "\r\n" ); document.write( "There are three cases:\r\n" ); document.write( "\r\n" ); document.write( "Case 1: The sequence of five choices of integers contains\r\n" ); document.write( " no integers which are the same.\r\n" ); document.write( "\r\n" ); document.write( "16 ways to choose the 1st integer.\r\n" ); document.write( "15 ways to choose the 2nd integer.\r\n" ); document.write( "14 ways to choose the 3rd integer.\r\n" ); document.write( "13 ways to choose the 4th integer.\r\n" ); document.write( "12 ways to choose the 5th integer.\r\n" ); document.write( "\r\n" ); document.write( "That's (16)(15)(14)(13)(12) = 16P5 = 524160 for case 1\r\n" ); document.write( "\r\n" ); document.write( "Case 2: exactly 1 pair of the integers are alike, and \r\n" ); document.write( "the other three integers are all different, and different\r\n" ); document.write( "from the one pair of like integers.\r\n" ); document.write( "\r\n" ); document.write( "First we choose the 5 integers and then we order them as\r\n" ); document.write( "choice 1, choice 2,..., choice 5\r\n" ); document.write( "\r\n" ); document.write( "We can choose the integer for the one like pair in 16 ways.\r\n" ); document.write( "We choose the other 3 integers in 15C3 = 455 ways\r\n" ); document.write( "That's (16)(455) = 7280\r\n" ); document.write( "\r\n" ); document.write( "Now that we have chosen the set of integers to be chosen, we\r\n" ); document.write( "now find the number of ways in which each set can be arranged\r\n" ); document.write( "in a sequence. \r\n" ); document.write( "\r\n" ); document.write( "Each of those 7280 combinations can be arranged in the \r\n" ); document.write( "same number of ways as the number of distinguishable \r\n" ); document.write( "permutations of the word THERE, which has 2 \r\n" ); document.write( "indistinguishable E's. which is\n" ); document.write( " |