Scribd
Upload
3 views

Classification and types of permutation questions ..

The document explains different types of permutations, including those without repetition, with repetition, of non-distinct objects, and circular permutations, along with their definitions and formulas. Examples illustrate how to calculate permutations for specific scenarios, such as arranging books or forming codes. A key takeaway is that permutations consider the order of objects, unlike combinations.

Uploaded by

Mazhar Hassnain
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
3 views

Classification and types of permutation questions ..

The document explains different types of permutations, including those without repetition, with repetition, of non-distinct objects, and circular permutations, along with their definitions and formulas. Examples illustrate how to calculate permutations for specific scenarios, such as arranging books or forming codes. A key takeaway is that permutations consider the order of objects, unlike combinations.

Uploaded by

Mazhar Hassnain
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
You are on page 1/ 1

When dealing with permutations, it's crucial to remember that order matters.

Here's a
breakdown of common permutation classifications and examples:
1. Permutations Without Repetition:
●​ Definition:
○​ These permutations involve arranging a set of distinct objects where each object
can only be used once.
○​ Formula: nPr = n! / (n - r)! (where n is the total number of objects and r is the
number of objects being arranged)
●​ Example:
○​ "How many different ways can you arrange 3 books on a shelf from a set of 5
different books?"
■​ Here, n = 5 and r = 3.
■​ 5P3 = 5! / (5 - 3)! = 5! / 2! = (5 x 4 x 3 x 2 x 1) / (2 x 1) = 60. There are 60
different arrangements.
2. Permutations With Repetition:
●​ Definition:
○​ These permutations allow objects to be used multiple times.
○​ Formula: n^r (where n is the number of choices for each position and r is the
number of positions)
●​ Example:
○​ "How many 3-digit codes can be formed using the digits 0-9 if repetition is
allowed?"
■​ Here, n = 10 (digits 0-9) and r = 3 (3-digit code).
■​ 10^3 = 1000. There are 1000 possible codes.
3. Permutations of Non-Distinct Objects (Permutations with Multi-sets):
●​ Definition:
○​ These permutations involve arranging objects where some are identical.
○​ Formula: n! / (n1! * n2! * ... * nk!) (where n is the total number of objects and n1, n2,
..., nk are the counts of each type of identical object)
●​ Example:
○​ "How many different ways can the letters in the word 'MISSISSIPPI' be arranged?"
■​ There are 11 letters total.
■​ 'I' appears 4 times, 'S' appears 4 times, 'P' appears 2 times, and 'M' appears
1 time.
■​ The number of arrangements is 11! / (4! * 4! * 2! * 1!) = 34,650.
4. Circular Permutations:
●​ Definition:
○​ These permutations involve arranging objects in a circular arrangement.
○​ Formula: (n - 1)! (where n is the number of objects)
●​ Example:
○​ "How many ways can 4 people be seated around a circular table?"
■​ (4 - 1)! = 3! = 6. There are 6 different arrangements.
Key takeaway: The key difference between permutations and combinations is that order matters
in permutations, and it does not matter in combinations.

You might also like