Scribd
Upload
102 views3 pages

Permutation Problems Solutions

The document provides detailed solutions to various problems related to permutations, including cases with fixed positions and identical objects. Key formulas are established, such as n! / (n-k)! for permutations with k fixed objects and n! / r! for permutations with identical objects. Each solution is explained with logical reasoning and examples, illustrating how to calculate the total number of arrangements in different scenarios.

Uploaded by

Lucky Rathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
102 views3 pages

Permutation Problems Solutions

The document provides detailed solutions to various problems related to permutations, including cases with fixed positions and identical objects. Key formulas are established, such as n! / (n-k)! for permutations with k fixed objects and n! / r! for permutations with identical objects. Each solution is explained with logical reasoning and examples, illustrating how to calculate the total number of arrangements in different scenarios.

Uploaded by

Lucky Rathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Detailed Solutions for Permutations Problems

1. Prove that the number of permutations of n objects with k objects restricted (fixed) in their

positions is given by n! / (n-k)!.

Solution:

In permutations, the number of ways to arrange n objects is n!.

If k objects are fixed in their positions, we are left with the remaining n - k objects to permute.

Thus, the total number of permutations is n! / (n-k)!.

2. Show that the number of ways to arrange n distinct objects where k specific objects must be in

fixed positions is n! / (n-k)!.

Solution:

The logic is the same as question 1. After fixing k objects, there are (n-k)! ways to arrange the

remaining objects.

Thus, the total number of arrangements is n! / (n-k)!.

3. Prove that the number of permutations of n objects where r objects are identical is given by n! / r!.

Solution:

If r objects are identical, swapping them doesn't create new permutations. So we divide by r! to

eliminate redundancy.

Thus, the number of distinct permutations is n! / r!.


4. Show that the number of permutations of the letters in the word "PROBLEM" (where some letters

are repeated) is 7! / 2!.

Solution:

In "PROBLEM", the letter "P" appears twice. So we divide by 2! to account for the repeated P.

Thus, the number of permutations is 7! / 2!.

5. Prove that the number of permutations of n objects where exactly r objects are fixed in their

positions is given by n! / r!(n-r)!.

Solution:

We are permuting the remaining n - r objects, and the fixed r objects don't change the count.

Thus, the total number of permutations is n! / r!(n-r)!.

6. Show that the number of permutations of n objects where k objects are restricted to be in the first

k positions is k!(n-k)!.

Solution:

We arrange the k restricted objects in k! ways, and the remaining n - k objects in (n-k)! ways.

Thus, the total number of permutations is k!(n-k)!.

7. Prove that the number of ways to arrange n distinct books on a shelf with m specific books fixed is

m!(n-m)!.

Solution:

The m specific books can be arranged in m! ways and the remaining n - m books in (n-m)! ways.
Thus, the total number of arrangements is m!(n-m)!.

8. Show that the number of permutations of 5 letters where 2 of them are identical is 5! / 2!.

Solution:

Since 2 of the letters are identical, we divide by 2! to account for repeated letters.

Thus, the number of permutations is 5! / 2!.

9. Prove that the number of ways to arrange 8 people in a line with 3 specific people always in the

first 3 positions is 3! * 5!.

Solution:

The 3 specific people can be arranged in 3! ways, and the remaining 5 people in 5! ways.

Thus, the total number of arrangements is 3! * 5!.

10. Show that the number of permutations of n objects with exactly k objects fixed is given by n! /

(n-k)!.

Solution:

After fixing k objects, the remaining n - k objects are arranged in (n-k)! ways.

Thus, the total number of permutations is n! / (n-k)!.

You might also like