SOLUTION: So find the number of distinguishable five - letter permutations that can be formed from the letters in the word window using the following steps
a) Find the number of distingui
Algebra ->
Probability-and-statistics
-> SOLUTION: So find the number of distinguishable five - letter permutations that can be formed from the letters in the word window using the following steps
a) Find the number of distingui
Log On
Question 756855: So find the number of distinguishable five - letter permutations that can be formed from the letters in the word window using the following steps
a) Find the number of distinguishable five letter sequences containing exactly one w
b)Find the number of distinguishable five letter sequences containing exactly two w's
c) Add the results of steps a and b
I get a is 5 factorial but how do you do b??? Answer by stanbon(75887) (Show Source):
You can put this solution on YOUR website! So find the number of distinguishable five - letter permutations that can be formed from the letters in the word window using the following steps
a) Find the number of distinguishable five letter sequences containing exactly one w
Ans: 5! = 120
----------------------------------
b)Find the number of distinguishable five letter sequences containing exactly two w's
Patterns:
wwind
wwino
wwido
wwndo
-----
# of arrangements of each pattern: 5!/2! = 60
Total # of arrangements 4*60 = 240
-----------------------
c) Add the results of steps a and b
Ans: 360
===============================================
Note: The answer to part "b" was provided by the
person who posted this problem. Thank You
==============================================
Cheers,
Stan H.
(