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
there?
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?
Answer by stanbon(75887)   (Show Source):
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.
How many possible words are there?
Ans: 9*8*7*6
-------------------------------
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?
---
Ans: [9*8*7*6/9^4]
------
Cheers,
Stan H.
==============
|
|
|
