Permutations

In this lesson we will be learning about permutations. Actually, though, you've already learned about permutations! We just haven't called it that yet. 

Suppose there are 20 drivers in a car race. How many ways can the drivers finish first, second and third? This is an example of a permutation problem because you are taking n objects (the number of drivers) and choosing r of them to go in a certain order (1st, 2nd, 3rd). 

See, this is a problem you've done before! But in this following lesson video you will learn a formula to follow for these types of problems. You will also see how to input this formula into a calculator. In this video, he uses a TI-83 calculator, but you are able to do the same calculations with the desmos graphing calculator. 

So watch the following lesson video and take notes on the important formulas and steps to follow when calculating permutations:


Remember, with permutations, the order is important! Here are some examples of cases where order is important: people are lining up in a line, books are being arranged on a shelf, or people are placing 1st, 2nd and 3rd. These are all examples of ORDER MATTERING, in which case, we use permutation calculations.

Last modified: Monday, 19 February 2018, 8:37 PM