Scribd
Upload
516 views4 pages

Permutation and Combination

The document defines permutation and combination. Permutation is an arrangement where order matters, and the number of permutations of n objects taken r at a time is n!/(n-r)!. Combination is a selection where order does not matter, and the number of combinations of n objects taken r at a time is written as nCr= n!/r!(n-r)!. Examples are provided to illustrate calculating permutations and combinations to solve problems involving selecting groups from larger sets.

Uploaded by

niranjankumar79
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
516 views4 pages

Permutation and Combination

The document defines permutation and combination. Permutation is an arrangement where order matters, and the number of permutations of n objects taken r at a time is n!/(n-r)!. Combination is a selection where order does not matter, and the number of combinations of n objects taken r at a time is written as nCr= n!/r!(n-r)!. Examples are provided to illustrate calculating permutations and combinations to solve problems involving selecting groups from larger sets.

Uploaded by

niranjankumar79
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Permutation and Combination

Before we get into permutation, lets look at the fundamental principle of counting and factorial notation: Fundamental Principle of Counting If an event M can occur in m ways and is followed by an event N that can occur in n ways, then the event M followed by event N can occur in m n ways. Factorial: n!, read n factorial, where n is greater than zero, is the product of all positive integers beginning with n and counting backward to 1.

Permutation
An arrangement or listing in which order or placement is important is called a permutation. The number of permutations of n objects taken r at a time is the quotient of n! and (n - r)!.
  


pr= p(n,r) = (n-r)! =n(n-1)(n-2)........... to r factors. p0=np1=n pn=n!

n!

n n n

pr=n-1pr + r. n-1pr-1

The number of permutations of n different things on a line is n!.

Example: 1 A word processing program requires a user to enter a 7-digit registration code made up of the digits 1, 2, 4, 5, 6, 7, and 9. Each number has to be used, and no number can be used more than once. How many different registration codes are possible? (a) 5040 (b) 4900 (c) 7! (d) None of the above Solution: Since the order of the numbers in the code is important, this situation is a permutation of 7 digits taken 7 at a time. p(n,r) = P(7,7) = = 5040 = 7x6x5x4x3x2x1

Combinations
Combinations are a method of selecting subsets of a larger set in which order is not important. For example, you might be asked how many possible groups of three can be made from a set of five individuals. Here, groups ABC, ACB, BCA, BAC, CAB, and CBA are all the same group of three people. The trick here is to do the permutation problem, but to divide out by the number of different orders for each group. In this case:

In general, if you want to find the number of groups of m individuals that can be selected from a set of n, first find nPm and then divide by m!

This formula can be written more simply using factorials.

Example 1: A sample of four cell phones taken from a batch of 100 cell phones is to be inspected. How many different samples could be selected? (a) 3,921,225 (b) 400 (c) 22.5 (d) None of the above Solution:

Example 2: A group of 7 seniors, 5 juniors, and 4 sophomores have volunteered to be peer tutors. Mr. DeLuca needs to choose 12 students out of the group. How many ways can the 12 students be chosen? (a) 1680 (b) 1820 (c) 140 (d) None of the above Solution: The order in which the students are chosen does not matter, so we must find the number of combinations of 16 students taken 12 at a time. Using the combination formula, we get
16C12 16C12

= 16! / ( 4! 12! ) = 43,680 / 24 = 1820

Practice Problems: 1. If nCr + nCr+1= n+1Cx, then x = (a) r (b) r-1 (c) n (d) r + 1
n

2. If (a) 20 (b) 12 (c) 6 (d) 30

C12= nC8 , then n=

3. n(3) persons are sitting in a row. If the probability event that two selected persons are not together is 6/7, then value of n is (a) 7 (b) 8 (c) 12 (d) None of these.

4. The letters of the word TREASON are arranged in a row in all possible ways, How many of them begin with T and end with N? (a) 720 (b) 60 (c) 120 (d) 240

5. All the letters of the word 'EAMCET' are arranged in possible ways. The number of such arrangements in which no two vowels are adjacent to each other is (a) 360 (b) 144 (c) 72 (d) 54

Found an error in the worksheet? Email us at [email protected] and get an awesome FREEBIE!!

NEED HELP? Visit www.educateNcare.com

You might also like