Permutations (DP IB Analysis & Approaches (AA)): Revision Note

Permutations

 What are Permutations?

• A permutation is the number of possible arrangements of a set of objects when the order of the arrangements matters

• A permutation can either be finding the number of ways to arrange n items or finding the number of ways to arrange r out of n items

How many ways can n different objects be arranged?

• When considering how many ways you can arrange a number of different objects in a row consider how many of the objects can go in the first position, how many can go in the second and so on

• For n = 2 there are two options for the first position and then there will only be one option to go in the second position so:

  • The first object has two places it could go and the second object has one place

  • By the fundamental counting principle both objects have 2 × 1 places to go

  • For example to arrange the letters A and B we have

    • AB and BA

• For n = 3 there are three options for the first position and then there will be two options for the second position and one for the third position so

  • The first object has three places it could go, the second object has two places and the third object has one place

  • By the fundamental counting principle the three objects have 3 × 2 × 1 places to go

  • For example to arrange the letters A, B and C we have

    • ABC, ACB, BAC, BCA, CAB and CBA

• For n objects there are n options for the first position, n - 1 options for the second position and so on until there is only one object left to go in final position

• The number of permutations of n different objects is n factorial (n!)

  • Where 

  • For 5 different items there are permutations

  • For 6 different items there are permutations

  • It is easy to see how quickly the number of possible permutations of different items can increase

  • For 10 different items there are 10! = 3 628 800 possible permutations

What are factorials?

• Factorials are a type of mathematical operation (just like +,  -,  ×,  ÷)

• The symbol for factorial is !

  • So to take a factorial of any non-negative integer, n, it will be written n! and pronounced ‘n factorial’

• The factorial function for any positive integer, n, is 

  • For example, 5 factorial is 

• The factorial of a negative number is not defined

  • You cannot arrange a negative number of items

• 0! = 1

  • There are no positive integers less than zero, so zero items can only be arranged once

• Your GDC will have a mode for calculating factorials, make sure you can put yours into the correct mode

• Most normal calculators cannot handle numbers greater than about 70!, experiment with yours to see the greatest value of x such that your calculator can handle x!

What are the key properties of using factorials?

• Some important relationships to be aware of are:

  • 

    • Therefore 

• 

  • Therefore 

• Expressions with factorials in can be simplified by considering which values cancel out in the fraction

  • Dividing a large factorial by a smaller one allows many values to cancel out

    • 

How do we find r  permutations of n items?

• If we only want to find the number of ways to arrange a few out of n  different objects, we should consider how many of the objects can go in the first position, how many can go in the second and so on

• If we wanted to arrange 3 out of 5 different objects, then we would have 3 positions to place the objects in, but we would have 5 options for the first position, 4 for the second and 3 for the third

  • This would be 5 × 4 × 3 ways of permutating 3 out of 5 different objects

  • This is equivalent to 

• If we wanted to arrange 4 out of 10 different objects, then we would have 4 positions to place the objects in, but we would have 10 options for the first position, 9 for the second, 8 for the third and 7 for the fourth

  • This would be 10 × 9 × 8 × 7 ways of permutating 4 out of 10 different objects

  • This is equivalent to 

• If we wanted to arrange r out of n different objects, then we would have r positions to place the objects in, but we would have n options for the first position, for the second, for the third and so on until we reach 

  • This would be ways of permutating r out of n different objects

  • This is equivalent to 

• The function can be written as 

  • Make sure you can find and use this button on your calculator

• The same function works if we have n spaces into which we want to arrange r objects, consider

  • for example arranging five people into a row of ten empty chairs

Permutations when two or more items must be together

• If two or more items must stay together within an arrangement, it is easiest to think of these items as ‘stuck’ together

• These items will become one within the arrangement

• Arrange this ‘one’ item with the others as normal

• Arrange the items within this ‘one’ item separately

• Multiply these two arrangements together

Permutations when two or more items cannot be all together

• If two items must be separated …

  • consider the number of ways these two items would be together

  • subtract this from the total number of arrangements without restrictions

• If more than two items must be separated…

  • consider whether all of them must be completely separate (none can be next to each other) or whether they cannot all be together (but two could still be next to each other)

  • If they cannot all be together then we can treat it the same way as separating two items and subtract the number of ways they would all be together from the total number of permutations of the items, the final answer will include all permutations where two items are still together

  • If the items must all be completely separate then

    • lay out the rest of the items in a line with a space in between each of them where one of the items which cannot be together could go

    • remember that this could also include the space before the first and after the last item

    • You would then be able to fit the items which cannot be together into any of these spaces, using the r permutations of n items rule

    • You do not need to fill every space

Permutations when two or more items must be in specific places

• Most commonly this would be arranging a word where specific letters would go in the first and last place

• Or arranging objects where specific items have to be at the ends/in the middle

  • Imagine these specific items are stuck in place, then you can find the number of ways to arrange the rest of the items around these ‘stuck’ items

• Sometimes the items must be grouped

  • for example all vowels must be before the consonants

  • Or all the red objects must be on one side and the blue objects must be on the other

  • Find the number of permutations within each group separately and multiply them together

  • Be careful to check whether the groups could be in either place

    • e.g. the vowels on one side and consonants on the other

    • or if they must be in specific places (the vowels before the consonants)

  • If the groups could be in either place than your answer would be multiplied by two

  • If there were n groups that could be in any order then your answer would be multiplied by n!