# Multiplication Theorem

If there are two jobs in such a way that one of them can be done in*m*ways and when it is completed in any of the

*m*ways, the second job can be completed in

*n*ways, then the whole job can be done in

*m*Ã—

*n*.

# Addition Theorem

If there are two jobs in such a way that one of them can be done in*m*ways and the second one can be done in

*n*ways independently, then either of the jobs can be done in

*(m + n)*ways.

Basically, there is one point where these two theorems differâ€”in multiplication the job does not get completed while in addition it gets completed. In a laymanâ€™s language, we multiply the number of ways when the job has not been completed and we add the number of ways when the job has been completed.

Example

There are 10 girls and 15 boys in a class. In how many ways can

- a class representative be selected?
- a team of two students be chosen with one girl and one boy?

Solution

- A class representative can be a girl or a boy. Now, one girl can be selected from 10 girls in 10 ways (any of the girls can be selected) and one boy can be selected from 15 boys in 15 ways (any of the boys can be selected). So the ways of selecting a class representative includes either selecting a boy or a girl. So, the total number of ways of selecting a class representative =10 + 15 = 25
- One girl can be chosen from 10 girls in 10 ways. Now corresponding to every selected girl, any one of the 15 boys can be selected in 15 ways.

_{1}, G

_{2}, G

_{3},â€¦G

_{9,}G

_{10}) â€“ G

_{1}

_{1}, B

_{2}, B

_{3},â€¦B

_{14}, B

_{15 })â€“ B

_{1}, Or B

_{2}, or B

_{3}, or B

_{15}.

_{1}, the total number of selection of a boy = 15

_{2}, the total number of selection of a boy = 15

_{3}, the total number of selection of a boy = 15

_{15}, the total number of selection of a boy = 15

So, the total number of ways of selecting a team of one boy and a girl = the total number of ways of selecting a girl Ã— the total number of ways of selecting a boy = 10 Ã— 15 = 150

In this case, just by selecting a girl or a boy, work has not been completed. So, it is a case of multiplication.

# Another Example of Multiplication Theorem

If there are three cities A, B and C located in such a way that there are 3 roads joining A and B, and 4 roads joining B and C, then the number of ways one can travel from A to C is 3 Ã— 4, i.e., 12.