Permutations P(n,r)

Permutations are a fundamental concept in combinatorics that deal with the arrangement of objects in a specific order. When we talk about permutations, the order of selection matters. For example, if we have three letters A, B, and C, the permutations are ABC, ACB, BAC, BCA, CAB, CBA. Each of these is a distinct arrangement.

The number of permutations of 'n' distinct objects taken 'r' at a time is denoted by P(n,r) or ⁿP_r. This means we are selecting 'r' objects from a set of 'n' distinct objects and arranging them in all possible orders.

Definition of Permutation P(n,r)

A permutation is an arrangement of objects in a definite order. The number of permutations of 'n' distinct objects taken 'r' at a time is given by the formula:

P(n,r) = n! / (n-r)!

Where:

• n is the total number of distinct objects available.
• r is the number of objects to be selected and arranged.
• '!' denotes the factorial function (e.g., 5! = 5 × 4 × 3 × 2 × 1).

The factorial of a non-negative integer 'n', denoted by n!, is the product of all positive integers less than or equal to n.

Example: 5! = 5 × 4 × 3 × 2 × 1 = 120. By convention, 0! = 1.

The formula P(n,r) can also be understood as selecting 'r' objects from 'n' and then arranging them. The number of ways to select 'r' objects from 'n' is given by combinations C(n,r), and the number of ways to arrange these 'r' objects is r!. So, P(n,r) = C(n,r) × r!.

Let's expand the formula: P(n,r) = n × (n-1) × (n-2) × ... × (n-r+1)

This expanded form is often more intuitive. It means for the first position, we have 'n' choices. For the second position, we have 'n-1' choices remaining, and so on, until the 'r'-th position, for which we have (n-r+1) choices.

Derivation of the Formula P(n,r)

Let's consider selecting and arranging 'r' objects from a set of 'n' distinct objects.

1. For the first position in the arrangement, we have 'n' choices.
2. After selecting one object for the first position, we have (n-1) objects remaining. So, for the second position, we have (n-1) choices.
3. For the third position, we have (n-2) choices.
4. We continue this process until we fill the 'r'-th position. For the 'r'-th position, we would have made (r-1) selections already, leaving us with n - (r-1) = (n-r+1) choices.

By the multiplication principle, the total number of ways to arrange 'r' objects from 'n' is the product of the number of choices for each position:

P(n,r) = n × (n-1) × (n-2) × ... × (n-r+1)

Now, let's see how this relates to the factorial formula. We can write the expression above as:

P(n,r) = [n × (n-1) × (n-2) × ... × (n-r+1)] × [(n-r) × (n-r-1) × ... × 2 × 1] / [(n-r) × (n-r-1) × ... × 2 × 1]

The numerator is the product of all integers from 'n' down to 1, which is n!.

The denominator is the product of all integers from (n-r) down to 1, which is (n-r)!.

Therefore, P(n,r) = n! / (n-r)!.

Special Cases for P(n,r)

There are a few important special cases to remember regarding permutations:

1. P(n,0): The number of permutations of 'n' objects taken 0 at a time.

   Using the formula: P(n,0) = n! / (n-0)! = n! / n! = 1.

   This makes sense because there is only one way to arrange zero objects – by doing nothing.

2. P(n,n): The number of permutations of 'n' objects taken 'n' at a time. This is equivalent to finding the number of ways to arrange all 'n' objects.

   Using the formula: P(n,n) = n! / (n-n)! = n! / 0! = n! / 1 = n!.

   This is the factorial of 'n', which represents all possible orderings of the 'n' objects.

3. P(n,1): The number of permutations of 'n' objects taken 1 at a time.

   Using the formula: P(n,1) = n! / (n-1)! = [n × (n-1)!] / (n-1)! = n.

   This means there are 'n' ways to choose and arrange one object from a set of 'n' distinct objects.

Examples of Permutations P(n,r)

Let's work through some examples to solidify your understanding.

Example 1: Arranging Letters

How many ways can the letters of the word 'CAT' be arranged?

Here, we have n=3 distinct letters (C, A, T) and we want to arrange all of them, so r=3.

We use P(n,n) = n!.

P(3,3) = 3! = 3 × 2 × 1 = 6.

The arrangements are: CAT, CTA, ACT, ATC, TCA, TAC.

Example 2: Selecting and Arranging Books

You have 5 distinct books on a shelf. In how many ways can you select and arrange 3 of them on a smaller display shelf?

Here, n=5 (total books) and r=3 (books to be selected and arranged).

We use the formula P(n,r) = n! / (n-r)!.

P(5,3) = 5! / (5-3)! = 5! / 2!

P(5,3) = (5 × 4 × 3 × 2 × 1) / (2 × 1) = 5 × 4 × 3 = 60.

Alternatively, using the expanded form: P(5,3) = 5 × 4 × 3 = 60.

There are 60 different ways to select and arrange 3 books from a set of 5.

Example 3: Forming Numbers

How many 3-digit numbers can be formed using the digits 1, 2, 3, 4, and 5 without repetition?

We have n=5 distinct digits and we want to form 3-digit numbers, which means we are arranging r=3 digits.

P(5,3) = 5! / (5-3)! = 5! / 2! = (5 × 4 × 3 × 2 × 1) / (2 × 1) = 5 × 4 × 3 = 60.

So, 60 different 3-digit numbers can be formed.

Understanding the 'n' and 'r' in P(n,r)

It's crucial to correctly identify 'n' and 'r' from the problem statement.

• 'n' (Total items): This is the total number of distinct items available to choose from. It's the size of the set you are working with.
• 'r' (Items to arrange): This is the number of items you are actually selecting and arranging. It is the number of positions you need to fill or the length of the arrangement.

Let's take another look at Example 2: "You have 5 distinct books... select and arrange 3 of them".

• 'n' is 5 because there are 5 books available in total.
• 'r' is 3 because you are selecting and arranging 3 of them.

Permutations with Repetition (Brief Mention)

The formula P(n,r) = n! / (n-r)! applies when all 'n' objects are distinct and repetition is not allowed. If repetitions are allowed, the number of permutations of 'n' objects taken 'r' at a time is simply n^r. For example, if you can form a 3-digit number using digits 1, 2, 3 with repetition allowed, the number of possibilities is 3³ = 27. However, for this topic, we are focusing on permutations without repetition.

Applications of Permutations

Permutations have wide-ranging applications in various fields:

• Computer Science: Generating passwords, scheduling tasks, analyzing algorithms.
• Cryptography: Designing secure codes and ciphers.
• Statistics: Sampling techniques, probability calculations.
• Genetics: Studying the order of genes on chromosomes.
• Everyday Life: Arranging items in a line, assigning roles to people, creating sequences.

Understanding Factorials in Detail

The factorial function is central to permutation calculations. Let's ensure you're comfortable with it.

n	n! (n factorial)	Calculation
0	0!	1 (by definition)
1	1!	1
2	2!	2 × 1 = 2
3	3!	3 × 2 × 1 = 6
4	4!	4 × 3 × 2 × 1 = 24
5	5!	5 × 4 × 3 × 2 × 1 = 120
6	6!	6 × 5 × 4 × 3 × 2 × 1 = 720
10	10!	3,628,800

As you can see, factorials grow very rapidly. For larger numbers, it's common to leave the answer in factorial form or use the simplified P(n,r) expression.

Common Pitfalls to Avoid

Students sometimes confuse permutations with combinations. Remember:

• Permutations (P(n,r)): Order matters. (e.g., arranging digits to form a number, seating people in a row).
• Combinations (C(n,r)): Order does not matter. (e.g., selecting a team, choosing lottery numbers).

Another common mistake is misidentifying 'n' and 'r'. Always read the problem carefully to determine the total pool of items ('n') and the number of items being arranged ('r').

Ensure you understand the condition of repetition. The formula P(n,r) = n! / (n-r)! is for arrangements *without* repetition.

Practice Problems

To master permutations, practice is key. Try these:

1. How many ways can you arrange the letters in the word 'COMPUTER'? (Hint: All letters are distinct).
2. In how many ways can 4 students be selected from a group of 10 students and arranged in a line for a photograph?
3. How many different 4-letter arrangements can be made from the letters of the word 'EQUATION' if no letter is repeated?
4. Calculate P(10, 4).
5. Find the value of 'n' if P(n, 2) = 72.