**What will you learn in this chapter?**

- What is Factorial and its properties
- What is Permutation and its important formulae
- Permutations of repeated objects
- Circular Permutations
- What is Combination and its important formulae

**Exam Connect**

Questions from this topic are often asked in competitive exams. In addition, it very important to learn this topic because sometimes other topics like probability, is asked combined with permutation and combination.

**Factorial of a given number**

Factorial is the very basic concept that youâ€™ll be using while solving questions based on Permutation and Combination. Factorial is the process of multiplying all the positive integers that comes before a given number. In simple terms, Factorial is the process of finding the product of all natural numbers till we get to the given number. It is denoted using an exclamation mark i.e. â€˜!â€™ or sometimes using â€˜|_â€™.

**Permutations**

**Definition and Representation**

Permutation is defined as the way of coming up with different types of arrangements for a given number of things by taking some or all the things at the same time. In simple terms, permutation is the process of arranging things in different ways by taking some or all the things at the same time.

Permutation is denoted as â€˜^{n}P_{r}â€™ or â€˜P (n, r)â€™, where â€˜nâ€™ is the given number of things and â€˜râ€™ is the number of things taken at a time. For example, if we are given 6 objects and we are asked to determine the number of arrangements we can do by taking 4 out of 6 objects at a time, then the permutation is given as ^{6}P_{4}.

**Formulae based on Permutation**

There are three different concepts based on formulae for Permutation. They are:

- The general formula for permutation is given as:

^{n}P_{r} = n!/(n-r!)

- When n = r, then the permutation is given as:

^{n}P_{n} = n!

- When the permutation is asked to be defined in Binomial form, then the permutation is given as:

^{n}P_{r} = ^{n â€“ 1}P_{r} + r.^{n â€“ 1}P_{r â€“ 1}

**Permutations of Repeated Objects**

Sometimes, it is said in the question that some given objects are â€˜alikeâ€™. This means that there are repeated objects in that permutation. Now, to find the permutation in such cases, follow this simple concept that weâ€™ll study right now.

Suppose, a total â€˜nâ€™ number of objects are given in which â€˜pâ€™ number of objects are alike i.e. are of one kind, another â€˜qâ€™ number of objects are alike i.e. are of another kind and the remaining objects are different. Now, if all â€˜nâ€™ number of objects are taken at a time, then the permutation is given as:

n!/(p! Ã— q!)

**Combinations**

**Definition and Representation**

Combination is the process in which some or all objects can be categorized into groups, irrespective of their arrangements. In simple terms, the categorization of given objects into groups is known as combination. The main difference between permutation and combination is ordering. That is, in permutation, we need to care about the way objects are arranged orderly. However, in combination, we donâ€™t need to care about the order as weâ€™ll be putting the given objects into groups irrespective of their arrangements.

Combination is denoted as ^{n}C_{r} or C (n, r), where â€˜nâ€™ is the given number of objects and â€˜râ€™ is the number of objects taken at a time. For example, if the total number of objects is 6 and we have to categorize these objects into groups by taking 4 objects at a time, then the combination is given as ^{6}C_{4} or C (6, 4).

**Formulae based on Combination**

There are six different concepts based on formulae for Combination. They are:

- The general formula of combination is given as:

^{n}C_{r} = n!/(r!n-r!), where 1â‰¤râ‰¤n

- When n = r, then the combination is given as:

^{n}C_{n} = 1

- When r = 0, then the combination is given as:

^{n}C_{0} = 1

^{n}C_{r}for a given number of objects is always equal to^{n}C_{n-r}. That is,

^{n}C_{n â€“ r} = n! / [(n â€“ r)! (n â€“ (n â€“ r)!]

= n! / [(n â€“ r)! (n â€“ n + r)!]

= n! / (n â€“ r)!r! = ^{n}C_{r}

- When
^{n}C_{p}=^{n}C_{q}, then either p = q or n = p + q - When the combination is asked to be expressed using Binomial Theorem, it is given as:

^{n}C_{r} + ^{n}C_{r â€“ 1 }= ^{n + 1}C_{r}

DD