0% found this document useful (0 votes)
6 views6 pages

Permutations: Formulas & Practice Questions

Uploaded by

engieworks15
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
0% found this document useful (0 votes)
6 views6 pages

Permutations: Formulas & Practice Questions

Uploaded by

engieworks15
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

PERMUTATIONS — FULL NOTES, FORMULAS, EXPLANATIONS & 20 PRACTICE QUESTIONS

=====================================================

1. WHAT IS A PERMUTATION?

=====================================================

A permutation is an arrangement of objects in a specific order.

Order matters.

Example:

ABC, ACB, BAC, BCA, CAB, CBA are different permutations.

=====================================================

2. MAIN PERMUTATION FORMULAS

=====================================================

-----------------------

Formula 1: P(n) = n!

-----------------------

The number of ways to arrange n distinct items.

Explanation:

First position: n choices

Second: n−1 choices

...

Last: 1 choice

Total = n!

Example:

Permutations of ABCD = 4! = 24.

-----------------------
Formula 2: P(n, r) = n! / (n − r)!

-----------------------

Number of ways to pick and arrange r items from n.

Example:

Arrange 3 from 10:

10! / 7! = 720.

-----------------------

Formula 3: Permutation with Repeated Items

n! / (n1! n2! n3! …)

-----------------------

Example:

BANANA: A(3), N(2), B(1)

6! / (3! 2! 1!) = 60.

-----------------------

Formula 4: Circular Permutations

(n − 1)!

-----------------------

Circular order ignores rotation.

Explanation:

Fix 1 person. Arrange the remaining n−1.

Example:

5 people around table = 4! = 24.

-----------------------

Formula 5: Circular Permutations with Repetition

(n − 1)! / (n1! n2! …)


-----------------------

=====================================================

3. EXAMPLES FOR EACH FORMULA

=====================================================

Example A:

Permute 6 digits: 6! = 720.

Example B:

P(7,4) = 7×6×5×4 = 840.

Example C:

MISSISSIPPI:

11! / (4! 4! 2!) = 34,650.

Example D:

Circular 8 beads:

7! = 5040.

Example E (must stay together):

Treat block AB as 1 unit:

4! × 2! = 48.

Example F (must NOT be together):

5! − 48 = 120 − 48 = 72.

=====================================================

4. 20 PRACTICE QUESTIONS

=====================================================

Easy:

1. How many permutations of 5 letters?


2. Arrange digits 1,2,3.

3. Find P(7,2).

4. 8 students in a line.

5. Permutations of DOG.

Medium:

6. Find P(9,4).

7. 3-digit numbers from 1–6 no repetition.

8. Permutations of LEVEL.

9. Circular seating of 6 people.

10. Arrange 5 books from 10.

11. Orderings of ABCADE.

12. TIGER with T first.

13. 4-letter passwords from A–G.

Hard:

14. 10 items, 3 must stay together.

15. Permutations of UNIVERSITY.

16. Permutations of COMMITTEE.

17. 5-digit numbers from 0–9, no repetition, no zero-leading.

Very Hard:

18. ARRANGEMENTS permutations.

19. 8 people, two opposite each other.

20. 6-letter words from MATHEMATICS (no repeated letters).

=====================================================

5. CYCLIC PERMUTATIONS — FULL DETAILED EXPLANATION

=====================================================
A cyclic (circular) permutation is arranging objects in a circle where rotations do not change the
arrangement.

-----------------------------------------------------

Why circular permutations use (n − 1)!

-----------------------------------------------------

In a circle, we fix one person to break rotation symmetry.

Remaining (n−1)! are unique.

-----------------------------------------------------

Round-table vs Necklace

-----------------------------------------------------

Round-table:

Clockwise ≠ counter-clockwise

Formula: (n−1)!

Necklace:

Flips identical

Formula: (n−1)! / 2

-----------------------------------------------------

Circular with Repetition

-----------------------------------------------------

(n − 1)! / (k1! k2! ...)

Example:

AABBC around circle:

(5−1)! / (2! 2!) = 6.

-----------------------------------------------------

Special Cases

-----------------------------------------------------
1. Labeled seats → n!

2. One fixed seat → (n−1)!

3. Restrictions → case analysis.

-----------------------------------------------------

Cyclic Examples

-----------------------------------------------------

Example 1:

7 people → 6! = 720.

Example 2:

Circular MISSISSIPPI:

10! / (4! 4! 2!) = 15,750.

Example 3:

5-bead necklace:

(5−1)! / 2 = 12.

Example 4:

8 people, A and B opposite:

Fix A, B fixed opposite.

Remaining 6: 6! = 720.

=====================================================

END OF DOCUMENT

=====================================================

You might also like