You are not logged in.
Pages: 1
I keep doubting myself that I am calculating the following problem incorrectly:
How many sequences of three letters can be made from the letters {A, B, C, D, E} if
(a) The letters must be all different.
I would assume that I would use the permutation equation to solve this. Pn,r = n!/(n-r)!
(b) Repetitions are allowed.
I would assume I would use the combination equation to solve this. Cn,r = n!/r!(n-r)!
If anyone can verify whether that is correct or incorrect I would greatly appreciate it. Thanks!
Offline
b.) > a.), so ofcourse you are wrong with at least 1 equation...
igloo myrtilles fourmis
Offline
It might be easier just to think about it terms of choices.
a)
For the first letter, you have 5 options: A, B, C, D or E.
For the second letter, you have 4 options - every letter except the one you had first.
Similarly, you can pick any of the 3 unchosen letters as the final one.
The number of sequences is therefore 5x4x3 = 60.
b)
This time, you have 5 options for each pick, since the later choices aren't restricted by what you've already picked.
The number of sequences here is 5x5x5 = 125.
Why did the vector cross the road?
It wanted to be normal.
Offline
Thank you so much! Thinking in terms of order and no order was completely throwing me off.
Offline
Pages: 1