5. Suppose a password requires three distinct letters. Find the number of permutations for the three letters in the code if the

Question

Scilla [17]

2 years ago

13

5. Suppose a password requires three distinct letters. Find the number of permutations for the three letters in the code if the

letters may not be repeated.

Mathematics

1 answer:

Roman55 [17] · Answer 1 · 2022-08-10T05:22:16+03:00

Answer:

There are 15600 ways to pick a password

Step-by-step explanation:

We have 26 possibilities to pick a letter. So, we have 26 possibilities for the first component of the password. The second letter should be different from the first one, so we have one less possibility, giving us a total of 25, and for the third letter we have 24.

This gives us 26*25*24 = 15600 ways of picking a password.