## Permutations

We will discuss permutations and combinations. After you finish this lesson, view all of our Algebra 1 lessons and practice problems.

In the first video, we are going to work with permutations.

We have three cars, the blue car, the white car, and the green car.

We can have different orders of:

B W G,

B G W,

W B G,

W G B,

G B W, and

G W B

which adds up to the total number of order of 6 possibilities.

Another way to look at this would be thinking the cars in order:

- In the first place, there can be three cars.
- In the second place, there can be only two cars since one car is already in the first place.
- At the third place, there can be only one car since there is only one left.

Multiplying *3* by *2* by *1*, we have *6*. which is the same answer as above.

We can simply use factorial, “*!*” to solve this kind of questions.

For *4!* the expression can also be written as

from the given number to *1*

Multiplying the numbers together and we have

Let’s work on another example:

If there are 5 cars, in how many ways can they finish for the first three cars?

In this situation, we cannot directly use *5!* because we are not finding the order for all five cars.

Instead, we can apply multiplication up to the desired order, to which we call permutations. We use permutations in situations where the order and position matters.

_{5}P_{3}=

_{5}P_{3}=

On a calculator, we can type in the first number, press MATH/PRB nPr, and enter the second number. The answer is the same in both situations.

## Examples of Permutations

### Example 1

A code have digits in a specific order, the digits are between . How many different permutations are there if one digit may only be used once?

Since we are told in the question that one digit only may be used once it limits our number of combinations.

Therefore,

_{10}_{4}=

### Example 2

In how many different ways that pool balls could be arranged out of balls.

_{16}_{3}=

## Video-Lesson Transcript

Let’s go over permutations.

For example, there are three cars. A blue car, a white car, and a green car. We want to see how many different ways we can place them in different orders.

We can have different orders like this:

Blue-White-Green

Blue-Green-White

White-Blue-Green

White-Green-Blue

Green-Blue-White

Green-White-Blue

There are different ways that these three cars can be placed.

Another way to think about this is like having first place, second place, and third place.

The number of cars that can go into first place is .

But after one car is placed on the first spot, there are only two cars left.

Then after the first two spots, only one car is left for the third place.

If we multiply these three, we’ll get

This is the same as which is

If we have four cars, we do four factorial

If we’re going to count for all the places, we could use this thing called factorial.

Let’s look at this example.

There are cars: A, B, C, D, and E in a race.

a) How many can they finish, ?

Since we’re going to count all five, we’re going to use five factorial.

If we multiply these together:

This is because five cars can go first. Then only four to go second and three will battle for the third place. Then only two will remain for the second place since three spots have already filled in. Two can be in second place and lastly, one will be in the fifth place.

So, there are ways that these five cars can finish.

b) How many can they finish, ?

Here, we can’t do factorial because we won’t have the last or fifth place.

Let’s just write four spots here which represents the first place, second place, third place, and fourth place.

Doing this also gave us the same answer as the first one because the last one is inconsequential.

It is inconsequential because, after the fourth place, there is only one car left. It wouldn’t change the number of outcomes.

Now, let’s look at

c) How many can they finish, ?

Again, let’s draw first place, second place, and third place.

d) How many can they finish, ?

We’ll look into first place and second place.

e) How many can they finish ?

There are cars so all can possibly come in first place.

Permutations are similar to factorials except we don’t finish the entire thing.

If we have different numbers and want four outcomes, we’ll start with the total numbers we have then write the number of spots we’re going up to.

In letter b,

This will multiply all the way down to spots.

In solving letter c, we’ll have

Letter d will be solved as

And the answer to letter e is

These two are interchangeable.

Now, let’s look at the actual permutation.

This means we’ll start at and multiply the first numbers.

We don’t stop at number , we stop at the fourth spot or number.

In a calculator, we can just type this in.

Go to Math then Probability then choose nPr which stands for a number, permutation, and a second number.

This gives us the same answer.

When do we use permutation?

We use permutation if order or position matters.

For example, if we have first place, second place, third place, and so on with distinct order, we use permutation.

Or we pick people to be President, VP, Secretary, and Treasurer, we can also use permutation.

Let’s say there are students running for the student council with available positions which are President, VP, and Treasurer.

We can use

Let’s say we have another students to form a team of with no distinct position and order doesn’t matter, then we do not use permutation.

Remember in a permutation, there is a distinct order or position that matters.

## Permutations with Repeated Elements

In the second video, we are going to work with permutations with repeated elements.

For the word KNEE, there are three distinctive letters with the letter E being repeated twice.

If we were to reorganize the letters around to form another order, then we would also use factorial like in the last video. The only difference here is that since there is a repeated element, we need to divide the number of total outcomes by the repeated outcomes.

## Examples of Permutations with Repeated Elements

### Example 1

KNEE

### Example 2

TATTOO

## Video-Lesson Transcript

We’ll have permutation with repetition.

For example, the word ACT. Its letters A-C-T can be reordered in different ways.

ACT

ATC

CTA

CAT

TCA

TAC

This is

Now, let’s look at the word TOO. Let’s reorganize this

TOO

TOO

OTO

OOT

OTO

OOT

Here, there’s not much difference since there are two letter O’s.

There are arrangements that are similar to another because of the same letter.

So, you can’t just do factorial or permutation.

Instead, we should do this:

Let’s look at another example and this will make a lot more sense.

Let’s reorganize the letters in the word KNEE.

Let us look at the word TATTOO

Let’s look at the word DIVIDEND

If you have repeated letters or items, just do the permutation like you would

normally divide by the factorial of the number of repeated items.

## Combinations

In this video, we are going to work with combinations.

**Combinations:** Number of orderings where order doesn’t matter.

We can use the formula: _{n}C_{r} to find the combination.

For _{5}C_{3}=

We would have *5!* on the top and *3! 2!* on the bottom, which is similar to permutations with repeated elements.

_{5}C_{3}=

Reduce if necessary

_{5}C_{3}=

Multiply across

_{5}C_{3}=

And we have

_{5}C_{3}=

## Examples of Combinations

### Example 1

Jones is the Chairman of a committee. In how many ways can a committee of be chosen from people given that Jones must be one of them?

Jones is already chosen, so we need to choose another from .

In choosing a committee, order doesn’t matter; so we need the number of combinations of people chosen from

_{9}C_{4}

### Example 2

The number of combinations of six objects taken two at a time.

_{6}C_{2}

## Video-Lesson Transcript

Let’s go over combinations.

This is a way of finding how many ways can be done where order or place do

not matter.

When we form a committee, or a group, or a team, or a combination and order don’t matter, we’re going to use this formula to solve:

This may seem complicated but it’s really not that bad.

If we have

Let’s look at another example:

We can also use the calculator here.

Let’s have this example.

There are students in a class. of them will be given class duties for the week. How many groups of can be formed?

Here, the order doesn’t matter because there are no distinguishing factors among the students chosen.

In this case, we’ll use the combination.

This is much easier using a calculator.

Next is we have students to be picked for class office – Pres., VP, Sec., Treasurer, and Judge.

What’s important is that there are five distinct order or places. It’s not just a group of different people. It’s a people each one has a specific position.

In this case, order matters. So, we’ll use permutation.

There is a distinct difference between the combination and permutation.