Discrete Mathematics - Counting Theory
In daily lives, many a times one needs to find out the number of all possible outcomes for a series of events. For instance, in how many ways can a panel of judges comprising of 6 men and 4 women be chosen from among 50 men and 38 women? How many different 10 lettered PAN numbers can be generated such that the first five letters are capital alphabets, the next four are digits and the last is again a capital letter. For solving these problems, mathematical theory of counting are used. Counting mainly encompasses fundamental counting rule, the permutation rule, and the combination rule.
The Rule of Sum and Rule of Product are used to decompose difficult counting problems into simple problems.
·
The Rule
of Sum −
If a sequence of tasks can
be done in ways
respectively (the condition is that no tasks can be performed simultaneously),
then the number of ways to do one of these tasks is ⋯
·
The Rule
of Product −
If a sequence of tasks can
be done in ways
respectively and every task arrives after the occurrence of the previous task,
then there are ⋯
Question − A boy lives at X and wants to go to School at Z. From his home X he has to first reach Y and then Y to Z. He may go X to Y by either 3 bus routes or 2 train routes. From there, he can either choose 4 bus routes or 5 train routes to reach Z. How many ways are there to go from X to Z?
Solution − From X to Y, he can go in ways (Rule of Sum). Thereafter, he can go Y to Z in ways (Rule of Sum). Hence from X to Z he can go in ways (Rule of Product).