Permutations and combinations

 

Permutations and Combinations

Permutations and combinations are fundamental concepts in combinatorics that deal with arranging and selecting objects.


1. Permutations (Order Matters)

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

Formula for Permutations

The number of ways to arrange rr objects from a set of nn distinct objects:

P(n,r)=n!(nr)!P(n, r) = \frac{n!}{(n-r)!}

Example of Permutation

How many ways can 3 people (A, B, and C) be arranged in 2 seats?

P(3,2)=3!(32)!=3!1!=3×2×11=6P(3,2) = \frac{3!}{(3-2)!} = \frac{3!}{1!} = \frac{3 \times 2 \times 1}{1} = 6

Arrangements: (AB, BA, AC, CA, BC, CB)


2. Combinations (Order Doesn’t Matter)

A combination is a selection of objects where order does not matter.

Formula for Combinations

The number of ways to choose rr objects from nn distinct objects:

C(n,r)=n!r!(nr)!C(n, r) = \frac{n!}{r!(n-r)!}

Example of Combination

How many ways can you choose 2 people from a group of 3 (A, B, and C), ignoring order?

C(3,2)=3!2!(32)!=3!2!×1!=3×2×1(2×1)×1=3C(3,2) = \frac{3!}{2!(3-2)!} = \frac{3!}{2! \times 1!} = \frac{3 \times 2 \times 1}{(2 \times 1) \times 1} = 3

Selections: (AB, AC, BC)


Key Differences Between Permutations and Combinations

FeaturePermutationsCombinations
OrderMattersDoesn't matter
FormulaP(n,r)=n!(nr)!P(n, r) = \frac{n!}{(n-r)!}C(n,r)=n!r!(nr)!C(n, r) = \frac{n!}{r!(n-r)!}
ExampleArranging books on a shelfSelecting a committee from a group

Comments

Popular posts from this blog

Parad Gandhak Bhasm (Mercury-Sulfur Ash) in Ayurveda

मकोय (Makoy) के आयुर्वेदिक प्रयोग

Eulerian Path & Circuit Problem