## Summary

are ways in which an element from a set is selected considering that the order is significant**Permutations**- when repetition is not allowed
- when repetition is allowed
are defined as ways in which an element from a set is selected, such that the order of selection does not matter**Combinations**- when repetition is not allowed
- when repetition is allowed

*All the above formulas are defined for Number of Permutations or Combinations of r objects chosen from n objects .*

Both permutations and combinations are groups or arrangements of objects.. When dealing with combinations, the order of the objects is insignificant, whereas in permutations the order of the objects makes a difference. Permutations are studied in almost every branch of mathematics. They are also used in computer science t for analyzing and sorting algorithms, in quantum physics for describing states of particles and in biology for describing RNA sequences. This articles explains both permutation and combination in detail.

#### What is Permutation?

Permutation is important for sets where order matters. It is defined as ways in which an element from a set is selected considering that the order is significant. For example, if we are given a word ”HOUSE”, and we need to find different ways in which the letters of this word can be arranged, we first see that the order of letters in this word are important as when we we write the letters in a different order like ”UESOH” it is a completely different arrangement and makes a difference to the word, so we can see that the order matters here. Therefore we will use permutation formulas to solve this.

To work out permutations, given formulas are:

- Number of Permutations of
*r*objects from*n*objects whenis allowed is defined as:**no repetition**

where

- Number of Permutations of
*r*objects from*n*objects whenis allowed is defined as:**repetition**

#### Example #1

Q. If you have 6 New Year greeting cards and you want to send them to 4 of your friends, in how many ways can this be done?

*Solution:*

We have to find number of permutations of 4 objects out of 6 objects.

Hence we know, r = 4 and n = 6

As repetitions are not allowed here, we will use the formula:

Therefore, we can say that cards can be sent in 360 different ways.

#### What is Combination?

The combination is defined as ways in which an element from a set is selected, such that (unlike permutations) the order of selection does not matter.

For a combination, the set ABC is similar to BCA. They are used for groups where you have to select items from a collection and order can be decided by yourself. An example of this would be Think of combining ingredients flour, salt and water in a bowl is the same as salt, water and flour. As it does not matter in which order these ingredients are added here.

To work out combinations, given formulas are:

- Number of Combinations of
*r*objects chosen from*n*objects whenis allowed is defined as:**no repetition**

- Number of Combinations of
*r*objects chosen from*n*objects when**repetition**is allowed is defined as:

#### Example #2

Q. Five bingo numbers are being picked from a ball containing 100 bingo numbers. How many possible ways are there for picking different numbers?

*Solution:*

Since the order does not matter here, we know its combinations and from the question we extracted relevant data r = 5 and n = 100

Put these values in the above given formula to find out the combinations:

Therefore, we worked out there are 75,287,520, different ways for picking different numbers.

##### Reference

- https://study.com/academy/lesson/permutation-combination-problems-practice.html
- https://byjus.com/maths/permutation-and-combination/
- https://www.statisticshowto.datasciencecentral.com/probability-and-statistics/probability-main-index/permutation-combination-formula/
- https://www.andlearning.org/permutation-combination-formulas/
- https://en.wikipedia.org/wiki/Permutation