Have you ever had a combination lock? Take a look at this dilemma.
Telly was sitting in the middle of a whole pile of combination locks when Carey arrived on Tuesday morning.
“What are you doing?” Carey asked sitting next to the pile of locks.
“I am checking to make sure that all of these locks work,” Telly explained. “Here is a pile for you.”
Carey starting working on the locks too. After about five minutes, she stopped and looked at Telly.
“You know these shouldn’t even be called combination locks. A lock isn’t a real combination, it’s actually a permutation,” Carey said laughing.
Telly looked at her friend as if she had six heads. She was completely puzzled.
“What do you mean?” Telly asked.
Do you know what Carey means? If you don’t right now, you will by the end of this Concept. Then you will understand permutations.
Order is important in some situations and not important in others. For example, in following a cake recipe, the order in which the events take place is important. You need to crack the eggs before you mix them with the flour. Similarly, you put the icing on the cake only after it has baked.
In buying the ingredients to make a cake, on the other hand, order is not important. Does it matter if you buy the flour before the eggs or the milk before the icing? It doesn’t, so you would say that order is NOT important in buying cake ingredients.
For solving many problems in which order is important, you can use permutations . A permutation is a selection of items in which order is important. To use permutations to solve problems, you need to be able to identify the problems in which order, or the arrangement of items, matters.
Take a look at this situation.
Francis Imelda Guzman wants to know how many ways she can arrange her initials, . Does order matter for this problem?
Since she wants to arrange each letter in a particular arrangement, the order does matter. This is a permutation not a combination.
Step 1 : Write out a single order, or permutation.
Step 2 : Now rearrange those same letters. Did changing the order of the items change the outcome? If so, then order matters.
different than original
Each arrangement of letters is a different permutation.
We can count permutations too. There is a mathematical way to calculate the number of permutations possible given the number of items selected.
To count the number of permutations in a problem you need to look at the problem as a series of choices.
We can find the number of permutations in a group if you include all members of that group. Suppose there are 3 cabs in front of a hotel, Acme, Bluebird, and Checker.
If all 3 line up to wait for the next customer, the number of different lineups, or permutations, of 3 items taken 3 at a time is:
Again, this is the permutation for three cabs lined up three at a time. We could also say that this is three objects taken three at a time.
What happens when 4 cabs show up at the hotel, but there is only room for 3 cabs to line up? For example, how many different 3-cab lineups would there be if you started with 4 cabs – Acme, Bluebird, Checker, and Decker?
Now, for choice 1 you have four choices instead of 3.
For the choice 2 you have 3 choices instead of 2 and for choice 3 you have 2 choices instead of 1.
The final calculation gives 24 total choices:
This is the answer when we have four options taken three at a time.
Yes. That is true. We do count them down. This is how we can multiply them to find the accurate number of permutations.
If five people want to go to the movies, but there are only two seats available. How many ways can the people sit if they can only sit two at a time?
How many different ways could the people be seated if there were three seats?
How many different ways could the people be seated if there were four seats?
Now let's go back to the dilemma from the beginning of the Concept.
Carey said the lock should be called a permutation lock because a permutation is a series of numbers in a specific order. If you don’t put the numbers in that order, then the lock will not open.
- a selection of items in which order is important.
Here is one for you to try on your own.
Three taxis – an Acme Cab, a Bluebird Limo, and a Checker – all arrive outside of the BigWig Hotel at exactly the same moment. In how many different ways can the three line up?
One way to look at this problem is as the product of 3 different choices. For choice 1 you can select any of the three cabs, Acme, Bluebird, or Checker.
For choice 2, your options are now limited. You’ve already chosen the first cab, so you now only have 2 cabs to choose from.
Finally, for choice 3 you have only 1 choice left.
You can multiply the three choices together to get the total number of choices, or permutations, as 6.
Here are the 6 different ways the cabs can line up.
Directions: Figure out each permutation or each outcome.
- Four different frogs entered the jumping contest – Spots, Dots, Slimey, and Croaky. In how many ways can the 4 finish in first, second, third, and fourth place?
- Denise has the letters A, R, X, O, G, I, and L. How many different 4-letter arrangements can she make?
- Six people have signed up to play Scrabble – Tim, Jim, Kim, Pam, Sam, and Cam. Only 4 people can play at one time. How many different 4-player games are possible?
- Arnold printed out his 8-page report without putting page numbers on the pages. Now the pages have gotten all mixed up. In how many different ways can Arnold arrange the 8 pages?
- The special lunch at Bamboo Restaurant gives you a choice of won-ton or hot-sour soup, a choice of kung pao shrimp or chicken with broccoli, and a choice rice or noodles. How many different special lunches are there?
- Rex forgot the password for his ATM bank card. He knows that the password is made of the 4 digits of his birthday, October 24 or 1, 0, 2, 4.? How many different passwords does he need to try to be sure he gets his password?
- Javier wrote out wrote out the letters of Jasmine’s name on 7 cupcakes and put them in a box. How many different ways can he take them out of the box one by one?
- On the new reality show, Lazybones, the five finalists – Snoozin’ Betty, Lounge Man, The Yawn Meister, Lana Later, and Bob the Procrastinator – compete to see who is the laziest person. On today’s show, the five will be weeded down to 3 super-finalists. How many different ways can the 3 super-finalists be chosen?
- Four friends have printed the letters M, E, T, S on the front of their shirts. They’re going to the Mets game and will sit in 4 seats side by side. In how many different ways can the four sit?
- How many different 3-digit numbers can you form from the digits 4, 5, and 6?
Directions: Use permutations to solve each problem.
- How many 3-digit numbers can Blanche write using the digits 7, 8, and 9?
- How many 4-letter arrangements can Blanche write using the letters A, B, C, D?
- The programmer for Oddball-TV has 5 new half-hour shows she wants to air on Tuesday evenings: Strange Days, Slightly Off, Odd Rod, Bent, and Icky the Great. In how many different orders can she present the shows?
- A train has 6 different cars – a passenger car, a baggage car, a mail car, a diner car, a freight car, and a caboose. In how many different orders can the cars be arranged?
- The last 5 digits of Beryl’s phone number are 34567. How many numbers have these same 5 digits?
- Mia has 7 charms for her charm bracelet – a heart, a moon, a turtle, a cube, a bird, a hoop, and a car. Into how many different orders can she arrange the 7 charms?