Determine whether the following problem involves a permutation or a combination and explain your answer. How many different -le
tter passwords can be formed from the letters , , , , , , and if no repetition of letters is allowed? Choose the correct answer below. A. The problem involves a permutation because the order in which the letters are selected does matter. B. The problem involves a combination because the order in which the letters are selected does not matter. C. The problem involves a combination because the order in which the letters are selected does matter. D. The problem involves a permutation because the order in which the letters are selected does not matter.
B. The problem involves a combination because the order in which the letters are selected does not matter.
Step-by-step explanation:
Computation technique is a method of statistics to find possible ways of combination. In computation technique it is assumed that order does not matter and letters will be selected at random. Permutation is a statistics technique to find possible ways of combination when the order does matter. Permutation technique cannot be used when order does not matter.
Step-by-step explanation: There are 4 primes. So the probability for the first draw is 4/9. Since the card is not replaced, the second probability is 3/8. 3/8 * 4/9 is 12/72, which simplifies into 1/6.
