Scribd
Upload
191 views

Permutation Combination Formulas

The document discusses factorials, permutations, and combinations. It defines factorial notation and the factorial of zero. It explains that factorials represent the product of consecutive natural numbers and permutations consider order while combinations do not. The key differences between permutations and combinations are that permutations consider order and usually have a higher count than combinations, while each combination corresponds to multiple permutations. Formulas for permutations and combinations are also provided.

Uploaded by

Ragesh Rajan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
191 views

Permutation Combination Formulas

The document discusses factorials, permutations, and combinations. It defines factorial notation and the factorial of zero. It explains that factorials represent the product of consecutive natural numbers and permutations consider order while combinations do not. The key differences between permutations and combinations are that permutations consider order and usually have a higher count than combinations, while each combination corresponds to multiple permutations. Formulas for permutations and combinations are also provided.

Uploaded by

Ragesh Rajan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Factorial: The continued product of first n natural numbers is called the n factorial and is denoted by n! orn i.e. n! = 1 2 3 4 (n 1) n 5 !

! = 1 2 3 4 5 = 120 Zero Factorial: We will require zero factorial in the latter sections of this chapter. It does not make any sense to define it as the product of the integers from 1 to zero. So, we define 0! = 1. Deduction: n ! = 1 2 3 4 (n 1) n = [1 2 3 4 (n 1)]n = [(n 1)!] n Thus, n! = n [(n 1)!] For example, 8 ! = 8(7 !) Permutation Vs. Combination: Permutation = ARRANGEMENT (ab and ba are different) In permutations the order of arrangement is taken into account; when the order is changed, a different permutation is obtained. For example, given 3 letters a, b, c suppose we arrange them taking 2 at a time. The various arrangements are ab, ba, bc, cb, ac, ca. Hence the number of arrangements of 3 things taken 2 at a time is 6 and this can be written as 3P2 = 6. Combination = SELECTION (ab and ba are the same) The word combination means selection. Suppose we are asked to make avselection of any two things from three things a, b and c, the different selections are ab, bc, ac. Here there is no reference to the order in which they are selected. Difference between Permutation and Combination: 1. In a combination only selection is made whereas in a permutation notonly a selection is made but also an arrangement in a definite order is considered (i.e. in a combination, the ordering of the selected objects is immaterialwhereas in a permutation, the ordering is essential). 2. Usually the number of permutation exceeds the number of combinations. 3. Each combination corresponds to many permutations. Formulas you need to know:

The number of mutually distinguishable permutations of n things, taken all at a time, of which p are alike of

one kind, q alike of second such that p + q = n,is

(ALGEBRA example)

The number of permutations of n different things, taken r at a time, when each may be repeated any number of r times in each arrangement, is n The number of circular permutations of n distinct objects is (n 1)!

You might also like