emmaticee
contestada

Suppose we want to choose 5 letters, without replacement, from 10 distinct letters. How many ways can this be done, if the order of the choices is relevant? How many ways can this be done, if the order of the choices is not relevant?

Respuesta :

MathPhys

Step-by-step explanation:

If the order is relevant, the number of permutations is:

₁₀P₅ = 30,240

If the order is not relevant, the number of combinations is:

₁₀C₅ = 252

Otras preguntas