document.write( "Question 1149232: A urn contains 10 coins of which 4 are counterfeit. Coins are removed
\n" );
document.write( "from the urn, one at a time, until all counterfeit coins are found. If the
\n" );
document.write( "random variable X denotes the number of coins removed to find the first
\n" );
document.write( "counterfeit one, then what are the space and the probability density function
\n" );
document.write( "of X? \n" );
document.write( "
Algebra.Com's Answer #770573 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "X=1: You need to get a counterfeit on the first draw. \n" ); document.write( " \n" ); document.write( "X=2: You need to get a genuine first and a counterfeit second. \n" ); document.write( " \n" ); document.write( "X=3: You need to get a genuine on the first two draws and a counterfeit on the third. \n" ); document.write( " \n" ); document.write( "Similarly.... \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "Simplify as required to find the probability density function. \n" ); document.write( "It is interesting to observe that the sum of all the probabilities is indeed 1. \n" ); document.write( "The sample space is 1 to 7. Clearly if there are 6 genuine coins and 4 counterfeit coins, the \"worst case\" if you are trying to get a counterfeit coin is to draw all 6 of the genuine coins first, thus drawing the first counterfeit coin on the 7th draw. \n" ); document.write( " \n" ); document.write( " |