SOLUTION: In how many ways can 2 letters be chosen from [R,S,T,U,V}, assuming that the order of the choices doesn't matter and that repeats are not allowed?

Algebra ->  Probability-and-statistics -> SOLUTION: In how many ways can 2 letters be chosen from [R,S,T,U,V}, assuming that the order of the choices doesn't matter and that repeats are not allowed?      Log On


   

Question 446381: In how many ways can 2 letters be chosen from [R,S,T,U,V}, assuming that the order of the choices doesn't matter and that repeats are not allowed?
Answer by stanbon(75887) About Me  (Show Source):
You can put this solution on YOUR website!
In how many ways can 2 letters be chosen from [R,S,T,U,V}, assuming that the order of the choices doesn't matter and that repeats are not allowed?
------------------
Ans: 5C2 = 10 ways
========================
Cheers,
Stan H.