SOLUTION: 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

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.
==============
RELATED QUESTIONS
HOW MANY WORDS OF THREE DISTINCT LETTERS CAN BE FORMED FROM THE ALPHABET(A,B,Y,Z) (answered by stanbon)

consider strings of length 10 which contain only letters from the set{A,E,I,O,U} and... (answered by Edwin McCravy)

We want to build 13 letter “words” using only the first n = 9 letters of the... (answered by math_tutor2020)

Consider strings of length 6 which contain letters only from the set { P,Q,R,S,T} and... (answered by Edwin McCravy)

How many strings of 4 lower case English letters are there that have the letter x in them (answered by edjones)

Consider strings of length 9 with elements being a, b or c. How many strings will... (answered by stanbon)

The English alphabet has 26 letters of which 5 are vowels. Consider only 5- letter... (answered by Edwin McCravy)

Consider the strings that consist of four lowercase letters and have the letter z in... (answered by Fombitz)

Consider the sequence 1, 3, 4, 9, 10, 12, 13, ... which consists of every positive... (answered by CPhill,greenestamps)