Question

Determine whether the following problem involves a permutation or combination. (It is not necessary to solve the problem.)How many different 2-letter passwords can be formed from the letters H, I, J, K, L, M, and N if no repetition of letters is allowed?

Answer 1

A permutation is an arrangement of outcomes in which the order does matter.

A combination is an arrangement of outcomes in which the order does not matter.

In this case, for example, the password HI is different from the password IH. In both cases, the outcomes (letters H and I) are the same, but the order of them changes the arrangement (the password). Therefore, the problem involves a permutation because the order of letters selected does matter