Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
17 views5 pages

Permutation and Combinations

The document explains the concepts of permutations and combinations, including key counting principles such as the multiplication and addition principles. It provides definitions, formulas, and examples for calculating permutations and combinations, highlighting the differences between ordered arrangements and unordered selections. Additionally, it discusses constraints in selections and arrangements, emphasizing the importance of repetition and distinctiveness in calculations.

Uploaded by

swapnilb03108
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
17 views5 pages

Permutation and Combinations

The document explains the concepts of permutations and combinations, including key counting principles such as the multiplication and addition principles. It provides definitions, formulas, and examples for calculating permutations and combinations, highlighting the differences between ordered arrangements and unordered selections. Additionally, it discusses constraints in selections and arrangements, emphasizing the importance of repetition and distinctiveness in calculations.

Uploaded by

swapnilb03108
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/ 5

Permutation & Combination:

Permutations and combinations deal with arranging or selecting objects


without listing them.
Key Counting Principles:
Multiplication Principle:

If event E occurs in m ways and F in n ways, the total combinations = m × n ways

Addition Principle:

If event E occurs in m ways and F in n ways (mutually exclusive), total = m+n

Permutations
Defination: Arrangement of objects in a specific order.

𝑟
Total permutations when repetition is allowed = 𝑛

Non-Distinct Objects:

● If n objects include p1, p2, ..., pk of identical types: Permutations =

Question 1: Arrange 3 letters: A,B,C

Total arrangements = 𝑃3= 3! = 3 × 2 × 1 = 6

Arrangements: ABC, ACB, BAC, BCA, CAB, CBA, ABC

Question 2: Choose 2 letters from A, B, C, D


Solution: Total permutations = P(4,2) = 4!/ (4−2)! = 4 × 3 × 2 × 1 / (2×1) = 12

Arrangements: AB, AC, AD, BA, BC, BD, CA, CB, CD, DA, DB, DC.

Question 3: Form 3-digit numbers using 1,2,3 repetition allowed.


3
Solution: Total numbers = 3 =27
Numbers: 111, 112, 113, 121, 122, 123,... ,333

Question 4: Arrange the word "BANANA" (n = 6, 𝑝𝑏 = 1, 𝑝𝑎 = 3 , 𝑝𝑛 = 2).


Solution: Total arrangements = 6!/ (1! × 3! × 2!) = 720/12 ​= 60.

Combinations:

Definition: Selection of objects where order does not matter.

● Total combinations of r objects from n : C(n,r) = 𝑛! /(𝑛 − 𝑟)!

Examples:

Question 1: Choose 2 people from 5: A,B,C,D,E

Solution: Total combinations = C(5,2) = 5! /(5 − 2)!

= 5 × 4/ (2×1) = 10

Groups: AB,AC,AD,AE,BC,BD,BE,CD,CE,DE.

● Combinations when n and r are related:


Property: C(n,r) = C(n,n − r)
C(5,2) = C(5,2) = 5! /(5 − 2)!

= 5 × 4/ (2×1) = 10

C(5,3)= C(5,3) = 5! /(5 − 3)!

= 5 × 4 × 3 / (3 × 2 × 1) = 10

Thus, C(5,2) = C(5,3)

● Special property of combinations: C(n,r) + C(n,r − 1) = C(n + 1,r)


C(4,2) = 6,C(4,1) = 4.
C(5,2) = C(4,2) + C(4,1) = 6 + 4 = 10

Mixed Formulas
● Fundamental Principle of Counting (Multiplication)

Example:

Question 1: Select a shirt (3 options) and pants (4 options).

Solution: Total choices = 3 × 4 = 12

● Fundamental Principle of Counting (Addition)

Example:

Question 2: A person can choose either an apple (4 types) or an orange (3


types).

Solution: Total choices = 4 + 3 = 7

Combination and Permutation with Constraints

● At least one object constraint

Example:

Question: From A,B,C,D choose at least 1 letter.

𝑛 4
Solution: Total subsets = 2 −1 = 2 −1 = 15

● Specific arrangement constraint:

Example:

Question: Arrange 5 letters such that 2 are always together.

Solution: Treat the 2 as a single unit: 4!

Permute within the unit: 2!.


Total: 4! × 2! = 48

Key Takeaways

● Permutations are for ordered arrangements; combinations are for


unordered selections.
● Repetition and distinctiveness are crucial modifiers.
● Use factorial operations and basic principles (addition/multiplication) as
the foundation.
● Apply the correct formula based on problem type:
● Order matters: Use P(n,r)
● Order doesn’t matter: Use C(n,r)

You might also like