document.write( "Question 415765: A) Consider an alphabet, consisting of 9 distinct symbols from which strings (words) of length 4 that do not use the same symbol twice are to be formed. How many possible words are
\n" );
document.write( "there?\r
\n" );
document.write( "\n" );
document.write( "B) if we suppose that the 4 symbols are chosen uniformly randomly with replacement,
\n" );
document.write( "(i.e. equal probability of selection true each time), what is the probability that a string will be formed in which no symbol is utilised more than once? \n" );
document.write( "
Algebra.Com's Answer #291414 by stanbon(75887) ![]() You can put this solution on YOUR website! A) Consider an alphabet, consisting of 9 distinct symbols from which strings (words) of length 4 that do not use the same symbol twice are to be formed. \n" ); document.write( "How many possible words are there? \n" ); document.write( "Ans: 9*8*7*6 \n" ); document.write( "------------------------------- \n" ); document.write( "B) if we suppose that the 4 symbols are chosen uniformly randomly with replacement, (i.e. equal probability of selection true each time), what is the probability that a string will be formed in which no symbol is utilised more than once? \n" ); document.write( "--- \n" ); document.write( "Ans: [9*8*7*6/9^4] \n" ); document.write( "------ \n" ); document.write( "Cheers, \n" ); document.write( "Stan H. \n" ); document.write( "============== \n" ); document.write( " |