Permutations and Combinations. Quantitative Aptitude & Business Statistics
|
|
|
- Beatrix Houston
- 5 years ago
- Views:
Transcription
1 Permutations and Combinations Statistics
2 The Fundamental Principle of If there are Multiplication n 1 ways of doing one operation, n 2 ways of doing a second operation, n 3 ways of doing a third operation, and so forth, 2
3 then the sequence of k operations can be performed in n 1 n 2 n 3.. n k ways. N= n 1 n 2 n 3. n k 3
4 Example 1 A used car wholesaler has agents who classify cars by size (full, medium, and compact) and age (0-2 years, 2-4 years, 4-6 years, and over 6 years). Determine the number of possible automobile classifications. 4
5 Full(F) Medium (M) Solution > > Compact 4-6 (C) >6 The tree diagram enumerates all possible classifications, the total number of which is 3x4= 12. 5
6 Example 2 Mr. X has 2 pairs of trousers, 3 shirts and 2 ties. He chooses a pair of trousers, a shirt and a tie to wear everyday. Find the maximum number of days he does not need to repeat his clothing. 6
7 Solution The maximum number of days he does not need to repeat his clothing is = 12 7
8 1.2 Factorials The product of the first n consecutive integers is denoted by n! and is read as factorial n. That is n! = (n-1) n For example, 4!=1x2x3x4=24, 7!= =5040. Note 0! defined to be 1. 8
9 The product of any number of consecutive integers can be expressed as a quotient of two factorials, for example, = 9!/5! = 9! / (9 4)! = 15! / 10! =15! / (15 5)! In particular, n (n 1) (n 2)... (n r + 1) 9
10 (A) 1.3 Permutations Permutations A permutation is an arrangement of objects. abc and bca are two different permutations. 10
11 1. Permutations with repetition The number of permutations of r objects, taken from n unlike objects, can be found by considering the number of ways of filling r blank spaces in order with the n given objects. If repetition is allowed, each blank space can be filled by the objects in n different ways. 11
12 r n n n n n Therefore, the number of permutations of r objects, taken from n unlike objects, each of which may be repeated any number of times = n n n... n(r factors) = n r 12
13 2. Permutations without repetition If repetition is not allowed, the number of ways of filling each blank space is one less than the preceding one r n n-1 n-2 n-3 n-r+1 13
14 Therefore, the number of permutations of r objects, taken from n unlike objects, each of which can only be used once in each permutation =n(n 1)(n 2)... (n r + 1) Various notations are used to represent the number of permutations of a set of n elements taken Statistics:Permutations r and at Combinations a time; 14
15 some of them are 15 ), (,, r n P P P r n n r ), (,, r n P P P r n n r ), (,, r n P P P r n n r ), (,, r n P P P r n n r ), (,, r n P P P r n n r ), (,, r n P P P r n n r ), (,, r n P P P r n n r n P r r n n n n r n r n r n n n n r n n = + = + = 1) 2)...( 1)( ( 1 2 )...3 ( 1 2 )...3 1)( 2)...( 1)( ( )! (! Since We have )! (! r n n P n r =
16 Example 3 How many 4-digit numbers can be made from the figures 1, 2, 3, 4, 5, 6, 7 when (a) repetitions are allowed; (b) repetition is not allowed? 16
17 Solution (a) Number of 4-digit numbers = 7 4 = (b) Number of 4 digit numbers = =
18 Example 4 In how many ways can 10 men be arranged (a) in a row, (b) in a circle? Solution (a) Number of ways is = P
19 Suppose we arrange the 4 letters A, B, C and D in a circular arrangement as shown. Note that the arrangements ABCD, BCDA, CDAB and DABC are not distinguishable. D A C B 19
20 For each circular arrangement there are 4 distinguishable arrangements on a line. If there are P circular arrangements, these yield 4P arrangements on a line, which we know is 4!. Hence P = 4! 4 = (4 1)! = 3! 20
21 Solution (b) The number of distinct circular arrangements of n objects is (n 1)! Hence 10 men can be arranged in a circle in 9! = ways. 21
22 (B) Conditional Permutations When arranging elements in order, certain restrictions may apply. In such cases the restriction should be dealt with first.. 22
23 Example 5 How many even numerals between 200 and 400 can be formed by using 1, 2, 3, 4, 5 as digits (a) if any digit may be repeated; (b) if no digit may be repeated? 23
24 Solution (a) Number of ways of choosing the hundreds digit = 2. Number of ways of choosing the tens digit = 5. Number of ways of choosing the unit digit = 2. Number of even numerals between 200 and 400 is =
25 Solution (b) If the hundreds digit is 2, then the number of ways of choosing an even unit digit = 1, and the number of ways of choosing a tens digit = 3. the number of numerals formed = 3. 25
26 If the hundreds digit is 3, then the number of ways of choosing an even. unit digit = 2, and the number of ways of choosing a tens digit = 3. number of numerals formed = = 6. the number of even numerals between 200 and 400 = = 9 26
27 Example 6 In how many ways can 7 different books be arranged on a shelf (a) if two particular books are together; 27
28 Solution (a) If two particular books are together, they can be considered as one book for arranging. The number of arrangement of 6 books = 6! = 720. The two particular books can be arranged in 2 ways among themselves. The number of arrangement of 7 books with two particular books 28
29 (b) if two particular books are separated? Solution (b) Total number of arrangement of 7 books = 7! = the number of arrangement of 7 books with 2 particular books separated = =
30 (C) Permutation with Indistinguishable Elements In some sets of elements there may be certain members that are indistinguishable from each other. The example below illustrates how to find the number of permutations in this kind of situation. 30
31 Example 7 In how many ways can the letters of the word ISOS CELES be arranged to form a new word? Solution If each of the 9 letters of ISOSCELES were different, there would be P= 9! different possible words. 31
32 However, the 3 S s are indistinguishable from each other and can be permuted in 3! different ways. As a result, each of the 9! arrangements of the letters of ISOSCELES that would otherwise spell a new word will be repeated 3! times. 32
33 To avoid counting repetitions resulting from the 3 S s, we must divide 9! by 3!. Similarly, we must divide by 2! to avoid counting repetitions resulting from the 2 indistinguishable E s. Hence the total number of words that can be formed is 9! 3! 2! =
34 If a set of n elements has k 1 indistinguishable elements of one kind, k 2 of another kind, and so on for r kinds of elements, then the number of permutations of the set of n elements is n!!! Quantitative Aptitude & 2Business k k k 1 r! 34
35 1.4 Combinations When a selection of objects is made with no regard being paid to order, it is referred to as a combination. Thus, ABC, ACB, BAG, BCA, CAB, CBA are different permutation, but they are the same combination of letters. 35
36 Suppose we wish to appoint a committee of 3 from a class of 30 students. We know that P 30 3 is the number of different ordered sets of 3 students each that may be selected from among 30 students. However, the ordering of the students on the committee has no significance, 36
37 so our problem is to determine the number of three-element unordered subsets that can be constructed from a set of 30 elements. Any three-element set may be ordered in 3! different ways, so P 30 3 is 3! times too large. Hence, if we divide P 30 3 by 3!,the result will be the number of unordered subsets of 30 elements taken 3 at a time. 37
38 This number of unordered subsets is also called the number of combinations of 30 elements taken 3 at a time, denoted by C 3 30 and C = P 3! = 30! 27!3! =
39 In general, each unordered r- element subset of a given n- element set (r n) is called a combination. The number of combinations of n elements taken r at a time is denoted by C n r or ncr or C(n, r). 39
40 A general equation relating combinations to permutations is n 1 n n! Cr = Pr = r! ( n r)! r! 40
41 Note: (1) C n n = C n 0 = 1 (2) C n 1 = n (3) C n n = C n n-r 41
42 Example8 If 167 C C x =168 C x then x is Solution: nc r-1 +nc r =n+1 C r Given 167 C c x =168C x We may write 167C C 91 =167+1 C 61 =168 C 91 X=91 42
43 Example9 If 20 C 3r = 20C 2r+5,find r Using nc r =nc n-r in the right side of the given equation,we find, 20 C 3 r =20 C 20-(2r+5) 3r=15-2r r=3 43
44 Example 10 If 100 C 98 =999 C 97 +x C 901 find x. Solution 100C 98 =999C C 97 = 999C C 97 X=999 44
45 Example11 If 13 C C C 4 =15 C x,the value of x is Solution : 15C x= 13C C C 4 = =(13c 6+13 C 5 ) + (13 C C 4) = 14 C C 5 =15C6 X=6 or x+6 =15 X=6 or 8 45
46 Example12 If n C r-1 =36,n C r =84 and n C r+1 =126 then find r Solution n-r+1 =7/3 * r r /2 (r+1)+1 =7/3 * r r=3 nc nc r + 1 = = r nc nc 3 2 r = =
47 Example 13 How many different 5-card hands can be dealt from a deck of 52 playing cards? 47
48 Solution Since we are not concerned with the order in which each card is dealt, our problem concerns the number of combinations of 52 elements taken 5 at a time. The number of different hands is C 52 5=
49 Example 14 6 points are given and no three of them are collinear. (a) How many triangles can be formed by using 3 of the given points as vertices? 49
50 Solution: Solution (a) Number of triangles = number of ways of selecting 3 points out of 6 = C 6 3 =
51 b) How many pairs of triangles can be formed by using the 6 points as vertices? 51
52 Let the points be A, B, C, D, E, F. If A, B, C are selected to form a triangles, then D, E, F must form the other triangle. Similarly, if D, E, F are selected to form a triangle, then A, B, C must form the other triangle. 52
53 Therefore, the selections A, B, C and D, E, F give the same pair of triangles and the same applies to the other selections. Thus the number of ways of forming a pair of triangles = C = 10 53
54 Example 15 From among 25 boys who play basketball, in how many different ways can a team of 5 players be selected if one of the players is to be designated as captain? 54
55 Solution A captain may be chosen from any of the 25 players. The remaining 4 players can be chosen in C 25 4 different ways. By the fundamental counting principle, the total number of different teams that can be formed is 25 C 24 4=
56 (B) Conditional Combinations If a selection is to be restricted in some way, this restriction must be dealt with first. The following examples illustrate such conditional combination problems. 56
57 A committee of 3 men and 4 women is to be selected from 6 men and 9 women. If there is a married couple among the 15 persons, in how many ways can the committee be selected so that it contains the married 57
58 Solution If the committee contains the married couple, then only 2 men and 3 women are to be selected from the remaining 5 men and 8 women. The number of ways of selecting 2 men out of 5 = C 5 2 =
59 The number of ways of selecting 3 women out of 8 =C 8 3 = 56. the number of ways of selecting the committee = lo 56 =
60 Example 17 Find the number of ways a team of 4 can be chosen from 15 boys and 10 girls if (a) it must contain 2 boys and 2 girls, 60
61 Solution (a) Boys can be chosen in C 15 2 = 105 ways Girls can be chosen in C 10 2 = 45 ways. Total number of ways is =
62 (b) it must contain at least 1 boy and 1 girl. Solution : If the team must contain at least 1 boy and 1 girl it can be formed in the following ways: (I) 1 boy and 3 girls, with C 15 1 C 10 3 = 1800 ways, (ii) 2 boys and 2 girls, with 4725 ways, (iii) 3 boys and 1 girl, with C 15 3 C 10 1 = 4550 ways. 62 the total number of teams is
63 Example 18 Mr..X has 12 friends and wishes to invite 6 of them to a party. Find the number of ways he may do this if (a) there is no restriction on choice, 63
64 Solution (a) An unrestricted choice of 6 out of 12 gives C 12 6=
65 (b) two of the friends is a couple and will not attend separately, 65
66 B Solution If the couple attend, the remaining 4 may then be chosen from the other 10 in C 10 4 ways. If the couple does not attend, then He simply chooses 6 from the other 10 in C 10 6 ways. total number of ways is C C 10 6 =
67 Example 19 Find the number of ways in which 30 students can be divided into three groups, each of 10 students, if the order of the groups and the arrangement of the students in a group are immaterial. 67
68 Solution Let the groups be denoted by A, B and C. Since the arrangement of the students in a group is immaterial, group A can be selected from the 30 students in C ways. 68
69 Group B can be selected from the remaining 20 students in C ways. There is only 1 way of forming group C from the remaining 10 students. 69
70 Since the order of the groups is immaterial, we have to divide the product C C C by 3!, hence the total number of ways of forming the three groups is 1 3! C C C
71 Example20 If n Pr = C r =120,find the value of r We Know that nc r.r P r = npr. We will use this equality to find r 10Pr =10Cr.r r =604800/120=5040=7 r=7 71
72 Example 21 Find the value of n and r n P r = n P r+1 and n C r = n C r-1 Solution : Given n P r = n P r+1 n r=1 (i) n C r = n C r-1 Solving i and ii r=2 and n=3 n-r = r-1 (ii) 72
73 Multiple choice Questions 73
74 1. Eleven students are participating in a race. In how many ways the first 5 prizes can be won? A) B) C) 120 D) 90 74
75 1. Eleven students are participating in a race. In how many ways the first 5 prizes can be won? A) B) C) 120 D) 90 75
76 2. There are 10 trains plying between Calcutta and Delhi. The number of ways in which a person can go from Calcutta to Delhi and return A) 99. B) 90 C) 80 D) None of these 76
77 2. There are 10 trains plying between Calcutta and Delhi. The number of ways in which a person can go from Calcutta to Delhi and return A) 99. B) 90 C) 80 D) None of these 77
78 3. 4P4 is equal to A) 1 B) 24 C) 0 D) None of these 78
79 3. 4P4 is equal to A) 1 B) 24 C) 0 D) None of these 79
80 4.In how many ways can 8 persons be seated at a round table? A) 5040 B) 4050 C) 450 D)
81 4.In how many ways can 8 persons be seated at a round table? A) 5040 B) 4050 C) 450 D)
82 5. If n P : n+1 P =3:4 then value of n is A) 15 B) 14 C) 13 D) 12 82
83 5. If n P : n+1 P =3:4 then value of n is A) 15 B) 14 C) 13 D) 12 83
84 6.Find r if 5Pr = 60 A) 4 B) 3 C) 6 D) 7 84
85 6.Find r if 5Pr = 60 A) 4 B) 3 C) 6 D) 7 85
86 7. In how many different ways can seven persons stand in a line for a group photograph? A) 5040 B) 720 C) 120 D) 27 86
87 7. In how many different ways can seven persons stand in a line for a group photograph? A) 5040 B) 720 C) 120 D) 27 87
88 8. If C = of n is C n n+2 A) 0 B) 2 C) 8 D) None of above then the value 88
89 8. If C = of n is C n n+2 A) 0 B) 2 C) 8 D) None of above then the value 89
90 9. The ways of selecting 4 letters from the word EXAMINATION is A) 136. B) 130 C) 125 D) None of these 90
91 9. The ways of selecting 4 letters from the word EXAMINATION is A) 136. B) 130 C) 125 D) None of these 91
92 10 If 5Pr = 120, then the value of r is A) 4,5 B) 2 C) 4 D) None of these 92
93 10 If 5Pr = 120, then the value of r is A) 4,5 B) 2 C) 4 D) None of these 93
94 Permutations and Combinations THE END
CHAPTER 5 BASIC CONCEPTS OF PERMUTATIONS AND COMBINATIONS
CHAPTER 5 BASIC CONCEPTS OF PERMUTATIONS AND COMBINATIONS BASIC CONCEPTS OF PERM UTATIONS AND COM BINATIONS LEARNING OBJECTIVES After reading this Chapter a student will be able to understand difference
Elementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
Objectives: Permutations. Fundamental Counting Principle. Fundamental Counting Principle. Fundamental Counting Principle
and Objectives:! apply fundamental counting principle! compute permutations! compute combinations HL2 Math - Santowski! distinguish permutations vs combinations can be used determine the number of possible
PERMUTATION AND COMBINATION
PERMUTATION AND COMBINATION Fundamental Counting Principle If a first job can be done in m ways and a second job can be done in n ways then the total number of ways in which both the jobs can be done in
The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n
Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product
Fundamental Counting Principle
Lesson 88 Probability with Combinatorics HL2 Math - Santowski Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more
Permutations. and. Combinations
Permutations and Combinations Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then there
Chapter 10A. a) How many labels for Product A are required? Solution: ABC ACB BCA BAC CAB CBA. There are 6 different possible labels.
Chapter 10A The Addition rule: If there are n ways of performing operation A and m ways of performing operation B, then there are n + m ways of performing A or B. Note: In this case or means to add. Eg.
In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.
Section 10.6 Permutations and Combinations 10-1 10.6 Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve
CHAPTER 8 Additional Probability Topics
CHAPTER 8 Additional Probability Topics 8.1. Conditional Probability Conditional probability arises in probability experiments when the person performing the experiment is given some extra information
7.4 Permutations and Combinations
7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting
Introduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:
Worksheet 4.11 Counting Section 1 Introduction When looking at situations involving counting it is often not practical to count things individually. Instead techniques have been developed to help us count
PERMUTATIONS AND COMBINATIONS
8 PERMUTATIONS AND COMBINATIONS FUNDAMENTAL PRINCIPLE OF COUNTING Multiplication Principle : If an operation can be performed in 'm' different ways; following which a second operation can be performed
Section Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?
Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with
Contents 2.1 Basic Concepts of Probability Methods of Assigning Probabilities Principle of Counting - Permutation and Combination 39
CHAPTER 2 PROBABILITY Contents 2.1 Basic Concepts of Probability 38 2.2 Probability of an Event 39 2.3 Methods of Assigning Probabilities 39 2.4 Principle of Counting - Permutation and Combination 39 2.5
Finite Math - Fall 2016
Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples
Discrete Structures Lecture Permutations and Combinations
Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these
Permutations and Combinations Problems
Permutations and Combinations Problems Permutations and combinations are used to solve problems. Factorial Example 1: How many 3 digit numbers can you make using the digits 1, 2 and 3 without method (1)
COUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
Unit on Permutations and Combinations (Counting Techniques)
Page 1 of 15 (Edit by Y.M. LIU) Page 2 of 15 (Edit by Y.M. LIU) Unit on Permutations and Combinations (Counting Techniques) e.g. How many different license plates can be made that consist of three digits
Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting
Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles
LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?
LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates
Permutations and Combinations
Permutations and Combinations In statistics, there are two ways to count or group items. For both permutations and combinations, there are certain requirements that must be met: there can be no repetitions
6.4 Permutations and Combinations
Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects
Counting Things. Tom Davis March 17, 2006
Counting Things Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 17, 2006 Abstract We present here various strategies for counting things. Usually, the things are patterns, or
Sec$on Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?
WEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)
WEEK 7 REVIEW Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.) Definition of Probability (7.2) WEEK 8-7.3, 7.4 and Test Review THE MULTIPLICATION
Math 166: Topics in Contemporary Mathematics II
Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11 Last Time Factorials For any natural number n, we define
Permutation and Combination
BANKERSWAY.COM Permutation and Combination Permutation implies arrangement where order of things is important. It includes various patterns like word formation, number formation, circular permutation etc.
Sec. 4.2: Introducing Permutations and Factorial notation
Sec. 4.2: Introducing Permutations and Factorial notation Permutations: The # of ways distinguishable objects can be arranged, where the order of the objects is important! **An arrangement of objects in
6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments
The Poker Manipulation Unit 5 Probability 6/24/14 Algebra 1 Ins1tute 1 6/24/14 Algebra 1 Ins1tute 2 MAFS. 7.SP.3: Investigate chance processes and develop, use, and evaluate probability models MAFS. 7.SP.3:
Unit 5, Activity 1, The Counting Principle
Unit 5, Activity 1, The Counting Principle Directions: With a partner find the answer to the following problems. 1. A person buys 3 different shirts (Green, Blue, and Red) and two different pants (Khaki
Probability and Counting Techniques
Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each
Counting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
CHAPTER - 7 PERMUTATIONS AND COMBINATIONS KEY POINTS When a job (task) is performed in different ways then each way is called the permutation. Fundamental Principle of Counting : If a job can be performed
JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson
JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects
STAT 430/510 Probability Lecture 1: Counting-1
STAT 430/510 Probability Lecture 1: Counting-1 Pengyuan (Penelope) Wang May 22, 2011 Introduction In the early days, probability was associated with games of chance, such as gambling. Probability is describing
Question No: 1 If you join all the vertices of a heptagon, how many quadrilaterals will you get?
Volume: 427 Questions Question No: 1 If you join all the vertices of a heptagon, how many quadrilaterals will you get? A. 72 B. 36 C. 25 D. 35 E. 120 Question No: 2 Four students have to be chosen 2 girls
Permutations and Combinations
Motivating question Permutations and Combinations A) Rosen, Chapter 5.3 B) C) D) Permutations A permutation of a set of distinct objects is an ordered arrangement of these objects. : (1, 3, 2, 4) is a
(1). We have n different elements, and we would like to arrange r of these elements with no repetition, where 1 r n.
BASIC KNOWLEDGE 1. Two Important Terms (1.1). Permutations A permutation is an arrangement or a listing of objects in which the order is important. For example, if we have three numbers 1, 5, 9, there
Introduction to Mathematical Reasoning, Saylor 111
Here s a game I like plying with students I ll write a positive integer on the board that comes from a set S You can propose other numbers, and I tell you if your proposed number comes from the set Eventually
Probability Concepts and Counting Rules
Probability Concepts and Counting Rules Chapter 4 McGraw-Hill/Irwin Dr. Ateq Ahmed Al-Ghamedi Department of Statistics P O Box 80203 King Abdulaziz University Jeddah 21589, Saudi Arabia ateq@kau.edu.sa
Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ.
Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ. 1 Chance of winning?! What s the chances of winning New York Megamillion Jackpot!! just pick 5 numbers from 1 to 56, plus a mega ball number
Counting Methods and Probability
CHAPTER Counting Methods and Probability Many good basketball players can make 90% of their free throws. However, the likelihood of a player making several free throws in a row will be less than 90%. You
n r for the number. (n r)!r!
Throughout we use both the notations ( ) n r and C n n! r for the number (n r)!r! 1 Ten points are distributed around a circle How many triangles have all three of their vertices in this 10-element set?
Permutations and Combinations Section
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Permutations and Combinations Section 13.3-13.4 Dr. John Ehrke Department of Mathematics Fall 2012 Permutations A permutation
Strings. A string is a list of symbols in a particular order.
Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a
CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
19.2 Permutations and Probability
Name Class Date 19.2 Permutations and Probability Essential Question: When are permutations useful in calculating probability? Resource Locker Explore Finding the Number of Permutations A permutation is
Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]
![Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]](/thumbs/90/102632904.jpg "Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]")
Math 3201 Assignment 2 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. Show all
* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
4.4: The Counting Rules
4.4: The Counting Rules The counting rules can be used to discover the number of possible for a sequence of events. Fundamental Counting Rule In a sequence of n events in which the first one has k 1 possibilities
Topics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
Mat 344F challenge set #2 Solutions
Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This
Multiple Choice Questions for Review
Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send
9.5 Counting Subsets of a Set: Combinations. Answers for Test Yourself
9.5 Counting Subsets of a Set: Combinations 565 H 35. H 36. whose elements when added up give the same sum. (Thanks to Jonathan Goldstine for this problem. 34. Let S be a set of ten integers chosen from
Section The Multiplication Principle and Permutations
Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally
CHAPTER Permutations and combinations
CHAPTER 3 Permutations and combinations a How many different number plates can be made? b In how many ways can these five people rearrange themselves? c How many different handshakes are possible? d How
aabb abab abba baab baba bbaa permutations of these. But, there is a lot of duplicity in this list, each distinct word (such as 6! 3!2!1!
Introduction to COMBINATORICS In how many ways (permutations) can we arrange n distinct objects in a row?answer: n (n ) (n )... def. = n! EXAMPLE (permuting objects): What is the number of different permutations
Review I. October 14, 2008
Review I October 14, 008 If you put n + 1 pigeons in n pigeonholes then at least one hole would have more than one pigeon. If n(r 1 + 1 objects are put into n boxes, then at least one of the boxes contains
Combinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)
2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are
Permutations and Combinations
Permutations and Combinations Rosen, Chapter 5.3 Motivating question In a family of 3, how many ways can we arrange the members of the family in a line for a photograph? 1 Permutations A permutation of
Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]
![Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]](/thumbs/80/80865142.jpg "Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +]")
Math 3201 Assignment 1 of 1 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. 1.
Week 3-4: Permutations and Combinations
Week 3-4: Permutations and Combinations February 20, 2017 1 Two Counting Principles Addition Principle. Let S 1, S 2,..., S m be disjoint subsets of a finite set S. If S = S 1 S 2 S m, then S = S 1 + S
Chapter 2. Permutations and Combinations
2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find
6.1.1 The multiplication rule
6.1.1 The multiplication rule 1. There are 3 routes joining village A and village B and 4 routes joining village B and village C. Find the number of different ways of traveling from village A to village
Tree Diagrams and the Fundamental Counting Principle
Objective: In this lesson, you will use permutations and combinations to compute probabilities of compound events and to solve problems. Read this knowledge article and answer the following: Tree Diagrams
Created by T. Madas COMBINATORICS. Created by T. Madas
COMBINATORICS COMBINATIONS Question 1 (**) The Oakwood Jogging Club consists of 7 men and 6 women who go for a 5 mile run every Thursday. It is decided that a team of 8 runners would be picked at random
Welcome! Worksheet Counting Principal, Permutations, Combinations. Updates: U4T is 12/12
Welcome! U4H1: Worksheet Counting Principal, Permutations, Combinations Updates: U4T is 12/12 Announcement: December 16 th is the last day I will accept late work. No new assignment list since this section
11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b
11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in
Generalized Permutations and The Multinomial Theorem
Generalized Permutations and The Multinomial Theorem 1 / 19 Overview The Binomial Theorem Generalized Permutations The Multinomial Theorem Circular and Ring Permutations 2 / 19 Outline The Binomial Theorem
CISC 1400 Discrete Structures
CISC 1400 Discrete Structures Chapter 6 Counting CISC1400 Yanjun Li 1 1 New York Lottery New York Mega-million Jackpot Pick 5 numbers from 1 56, plus a mega ball number from 1 46, you could win biggest
Permutations And Combinations Questions Answers
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with permutations and combinations
CS 237: Probability in Computing
CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 5: o Independence reviewed; Bayes' Rule o Counting principles and combinatorics; o Counting considered
Section 6.4 Permutations and Combinations: Part 1
Section 6.4 Permutations and Combinations: Part 1 Permutations 1. How many ways can you arrange three people in a line? 2. Five people are waiting to take a picture. How many ways can you arrange three
Math 3338: Probability (Fall 2006)
Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/7 2.3 Counting Techniques (III) - Partitions Probability p.2/7 Partitioned
Lesson1.notebook July 07, 2013
Lesson1.notebook July 07, 2013 Topic: Counting Principles Today's Learning goal: I can use tree diagrams, Fundamental counting principle and indirect methods to determine the number of outcomes. Tree Diagram
How can I count arrangements?
10.3.2 How can I count arrangements? Permutations There are many kinds of counting problems. In this lesson you will learn to recognize problems that involve arrangements. In some cases outcomes will be
Distribution of Aces Among Dealt Hands
Distribution of Aces Among Dealt Hands Brian Alspach 3 March 05 Abstract We provide details of the computations for the distribution of aces among nine and ten hold em hands. There are 4 aces and non-aces
50 Counting Questions
50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,
Section : Combinations and Permutations
Section 11.1-11.2: Combinations and Permutations Diana Pell A construction crew has three members. A team of two must be chosen for a particular job. In how many ways can the team be chosen? How many words
ACTIVITY 6.7 Selecting and Rearranging Things
ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize
CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions)
CSE 31: Foundations of Computing II Quiz Section #1: Counting (solutions Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m possible outcomes
Permutations & Combinations
Permutations & Combinations Extension 1 Mathematics HSC Revision UOW PERMUTATIONS AND COMBINATIONS: REVIEW 1. A combination lock has 4 dials each with 10 digits. How many possible arrangements are there?
With Question/Answer Animations. Chapter 6
With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and
Finite Math Section 6_4 Solutions and Hints
Finite Math Section 6_4 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in
MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017
MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa
4.1 Organized Counting McGraw-Hill Ryerson Mathematics of Data Management, pp
Name 4.1 Organized Counting McGraw-Hill yerson Mathematics of Data Management, pp. 225 231 1. Draw a tree diagram to illustrate the possible travel itineraries for Pietro if he can travel from home to
Probability. Engr. Jeffrey T. Dellosa.
Probability Engr. Jeffrey T. Dellosa Email: jtdellosa@gmail.com Outline Probability 2.1 Sample Space 2.2 Events 2.3 Counting Sample Points 2.4 Probability of an Event 2.5 Additive Rules 2.6 Conditional
Chapter 5 - Elementary Probability Theory
Chapter 5 - Elementary Probability Theory Historical Background Much of the early work in probability concerned games and gambling. One of the first to apply probability to matters other than gambling
CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions)
CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions Review: Main Theorems and Concepts Combinations (number of ways to choose k objects out of n distinct objects,
Examples: Experiment Sample space
Intro to Probability: A cynical person once said, The only two sure things are death and taxes. This philosophy no doubt arose because so much in people s lives is affected by chance. From the time a person
Chapter 11, Sets and Counting from Applied Finite Mathematics by Rupinder Sekhon was developed by OpenStax College, licensed by Rice University, and
Chapter 11, Sets and Counting from Applied Finite Mathematics by Rupinder Sekhon was developed by OpenStax College, licensed by Rice University, and is available on the Connexions website. It is used under
Well, there are 6 possible pairs: AB, AC, AD, BC, BD, and CD. This is the binomial coefficient s job. The answer we want is abbreviated ( 4
2 More Counting 21 Unordered Sets In counting sequences, the ordering of the digits or letters mattered Another common situation is where the order does not matter, for example, if we want to choose a
November 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
Case 1: If Denver is the first city visited, then the outcome looks like: ( D ).
2.37. (a) Think of each city as an object. Each one is distinct. Therefore, there are 6! = 720 different itineraries. (b) Envision the process of selecting an itinerary as a random experiment with sample