Question: Determine whether the following problem involves a permutation or combination. (It is not necessary to solve the problem.) How many different 3 -letter passwords can

Determine whether the following problem involves a permutation or combination. (It is not necessary to solve the problem.)

How many different 3-letter passwords can be formed from the letters H, I, J, K, L,M, and N if no repetition of letters is allowed?

A. Permutation

B. Combination

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!