You are given the set of letters { A, B, C, D, E } . How many three-letter strings (i.e., sequences of 3 letters) can be made out of these letters if each letter can be used only once? (In this and subsequent questions, your answer should be a number. Do not enter ‘!' or combinations in your answer.)

Respuesta :

Answer:

60

Step-by-step explanation:

If each letter can be used only once then

- The first slot has a total of 5 options

- The 2nd slot has a total of 4 options

- The 4rd slot has a total of 3 options

Then the total number of combination to arrange 5 letters into 3 slots is

5 * 4 * 3 = 60

Set is a collection of things. The number of strings that can be found with

the set of letters {A, B, C, D, E}  is 60.

What is a set?

A set is the mathematical model of a collection of things.

We know that the set has 5 letters, while the string is made up of only 3 letters, therefore, we have 5 choices to fill each of the three places in the string. But since the letters can not be repeated the number of choices will reduce after every place is filled, thus,

The number of three-letter strings that can be made

[tex]\rm= 5\ choices \times 4\ choices \times 3\ choices\\= 5 \times 4 \times 3\\= 60[/tex]

Hence, the number of strings that can be found with the set of letters {A, B, C, D, E} is 60.

Learn more about Set:

https://brainly.com/question/8053622