If a “word” is any arrangement of 3 different letters, how many 3-letter “words” can be formed from the letters B, O, N, and K, where each letter is to be used once?

=========================================================

Explanation:

We have 3 slots, which I'll call slot 1, slot 2, slot 3.

Once all the slots are accounted for, we multiply the values mentioned: 4*3*2 = 12*2 = 24.

There are 24 different three-letter "words" that can be formed where any letter selected cannot be reused.

--------------

A slightly different approach:

Order matters because a "word" like BON is different from a "word" like BNO.

Since order matters, we'll use a permutation

We have n = 4 letters to pick from and r = 3 slots to fill.

Apply those values into the nPr permutation formula

We end up with the same result as before.

if you use photomath right away it will give you the answer not like this app that you have to wait for people.