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.)

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

step-by-step explanation:

hope it

step-by-step explanation:

x^(1/6) · x^(1/6) · x^(1/6)   ·x^(1/6) = x^(4/6)   since we add the exponents

4/6 can be simplified to 2/3

the simplified form is x^(2/3)