Business Administration 1220E Lecture : Permutation_and_Combination.pdf

• School: Western University
• Department: Business Administration
• Course: Business Administration 1220E
• Professor: Tom Haffie

Document Summary

If an operation can be performed in "m" different ways and another operation in "n" different ways then these two operations can be performed one after the other in "mn" ways. If an operation can be performed in "m" different ways and another operation in "n" different ways then either ofthese two operations can be performed in "m+n" ways. (provided only one has to be done) This principle can be extended to any number of operations. The continuous produ ct of the first "n" natural numbers is called factorial n and is deonoted by n! i. e, n!=1 2x3x x(n -1)xn. An arrangement that can be formed by taking some or all of a finite set of things (or objects) is called a permutation. Order of the things is very important in case of permutation. A permutation is said to be a linear permutation if the objects are arranged in a line. A linear permutation is simply called as a permutation.