Let’s look at some application based problems in Permutations and Combinations. We will take you through each step of the solution but while writing the exam it is advisable to just get the answer ...

The number of different groups of r objects that can be formed from a total of n objects when the order of selection is irrelevant is called the number of combinations of n objects taken r at a time.

The rich world of permutation tests can be supplemented by a variety of applications where only some permutations are permitted. We consider two examples: testing independence with truncated data and ...