CHAPTER 7
Permutation and Combination
7.1 FUNDAMENTAL COUNTING PRINCIPLE
It helps us to find the total outcomes possible for a given problem.
If a certain thing can be done in m ways and another thing is done independently in n ways, then the total number of ways in which both the things can be done are m × n ways.
Take one way of doing the first thing. Combine this with any one of the n ways of doing the second thing. Therefore, there are n ways of combining the first thing with the happening of the second thing. Hence, there are m × n = mn ways of combining the happening of the first thing with the happening of the second thing.
EXAMPLES
- If you have m ways of doing an event 1, n ways of doing event 2 and k ways of doing event 3, the total ...
Get Business Mathematics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
