230,403 views
19 votes
19 votes
Determine whether the following problem involves a permutation or combination.​ (It is not necessary to solve the​ problem.)

How many different ​-letter passwords can be formed from the letters ​S, T​, U​, ​W, X​, Y​, and Z if no repetition of letters is​ allowed?

The problem involves (combination or permiation) because the (order or number) of letters selected (does or does not) matter.

User Shahid Chaudhary
by
3.2k points

1 Answer

4 votes
4 votes

Answer:

Explanation:

The order matters

stuwxyz is different than zyxwuts

You have 7 letters

The number of permutations is 7! which is 7*6*5*4*3*2*1 = 5040

User Nicolas Riousset
by
3.2k points