6.4 Permutations and Combinations
|
|
- Randall Fitzgerald
- 6 years ago
- Views:
Transcription
1 Math 141: Business Mathematics I Fall Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects Factorial notation Recall that in 6.3, when we were applying the multiplication principle, we often (but not always) got expressions such as or The factorial notation allows us to write such expressions more concisely. The first expression would be written as 3! and the second expression would be written as 10!. Given any positive integer n, we write (read n factorial ) to mean n (n 1) (n 2) 2 1. By convention, we also define 0! = 1. Example. 1! = 1, 2! = 2 1 = 2, 5! = = 120. Using a calculator to compute factorials 1. Enter the number. 2. Press MATH, and move to the PRB menu. Select 4:!. Press Enter. Example. How many ways are there to seat 8 people in a row of 8 seats? 1
2 2 6.4 Permutations and Combinations Permutations - arranging objects Given a set of objects, a permutation of the set is an arrangement of the objects in a definite order. If the objects in the set are all distinct, then as we saw in the previous section (and the previous example), the number of possible arrangements can be found by applying the multiplication principle. If we are using up all the objects in the set, then the answer will simply be given by some factorial. In the previous example, there were 8 seats and there were 8 people to arrange so the multiplication principle tells us that the number of possible arrangements is , which is simply 8!. But what if there were only 5 seats? In this case, the multiplication principle tells us that the number of possible arrangements is Since we are not multiplying all the way down to 1, this expression is not the factorial of any number but nevertheless it is related to the factorials of some numbers - observe that it is equal to = 8! !. In general, if we have n distinct objects and we want to arrange r of them, then the number of possible arrangements is given by P (n, r) = (n r)!. Sometimes, we also say that it is the number of permutations of n distinct objects taken r at a time. As a special case, if we want to arrange all n objects (meaning r = n), then the number of possible arrangements would be P (n, n) = (n n)! = = (since 0! = 1 by definition). 0! Using a calculator to compute P (n, r) 1. Enter the number n. 2. Press MATH, and move to the PRB menu. Select 2:nPr. 3. Enter the number r. Press Enter. Example. In how many ways can we select 8 people from a group of 60 and arrange them in 8 chairs? Example (Exercise 26 in the text). How many three-digit numbers can be formed by using the numerals in the set {3, 2, 7, 9} if repetition is not allowed?
3 6.4 Permutations and Combinations 3 We have discussed the case where all the objects are distinct. When some of the objects are identical, we will get fewer possible arrangements because interchanging the identical objects results in the same arrangement. Consider the following example. Suppose we have 2 blue balls and 1 red ball. If we pretend for a moment that the two blue balls are different, say by labeling them as B 1 and B 2, then from what we have discussed previously, we would get 3! possible arrangements. We can list all the possible arrangements as follows: RB 1 B 2 RB 2 B 1 B 1 RB 2 B 2 RB 1 B 1 B 2 R B 2 B 1 R Now we remember that the two blue balls were actually indistinguishable and remove their labels. Then we get the following list: RBB RBB BRB BRB BBR BBR So we see that there are actually only 3 possible arrangements. To get the correct number of possible arrangements, we need to account for over-counting as a result of interchanging identical objects. In the example above, the correct number, 3, was actually 3! where the 3! in the numerator comes from pretending that every ball is distinct, 2! and the 2! in the denominator comes from the number of possible arrangements of the two identical blue balls. In general, if we have n objects in which n 1 objects are alike and of one kind, n 2 objects are alike and of another kind,..., and n m objects are alike and of yet another kind, so that n 1 + n n m = n, then the number of permutations of these n objects (taken n at a time) is given by n 1!n 2! n m!. Example. Suppose we have 2 identical red marbles, 3 identical green marbles, and 1 blue marble. If we want to line the marbles up in a row, how many distinguishable arrangements of the 6 marbles are there? Example (Exercise 40 in the text). Find the number of distinguishable permutations that can be formed from the letters of the word PHILIPPINES. Example (Exercise 44 in the text). How many different signals can be made by hoisting two yellow flags, four green flags, and three red flags on a ship s mast at the same time?
4 4 6.4 Permutations and Combinations Combinations - selecting objects We have seen that permutations involve arrangements of objects so the order matters in these situations. In some cases, we are only interested in the number of ways of selecting a certain number of objects (in other words, a subset) from a collection without any regard to the order in which they are selected. These subsets are called combinations. The number of combinations of n objects taken r at a time is given by C(n, r) = (n r)!r!. Notice that this formula looks similar to that for the number of permutations of n distinct objects taken r at a time. The extra term r! in the denominator comes from disregarding the order in which the r objects are arranged. Using a calculator to compute C(n, r) 1. Enter the number n. 2. Press MATH, and move to the PRB menu. Select 3:nCr. 3. Enter the number r. Press Enter. Example. In how many ways can I pick a group of 3 from a class of 60 students? Example (Exercise 38 in the text). In how many ways can an investor select four mutual funds for his investment portfolio from a recommended list of eight mutual funds?
5 6.4 Permutations and Combinations 5 Examples - distinguishing between permutations and combinations; dealing with restrictions Example (Exercise 48 in the text). A group of five students studying for a bar exam has formed a study group. Each member of the group will be responsible for preparing a study outline for one of five courses. In how many different ways can the five courses be assigned to the members of the group? Example (Exercise 52 in the text). L.A. Wedding Caterers offers a wedding reception buffet. Suppose a menu is planned around four different salads, six entrees, six side dishes, and seven desserts. There are eight different choices of salads, ten different choices of entrees, eight different choices of side dishes, and ten different choices of desserts. How many menus are possible? Example (Exercise 54 in the text). A company car that has a seating capacity of six is to be used by six employees who have formed a car pool. If only four of these employees can drive, how many possible seating arrangements are there for the group? Example (Exercise 56 in the text). The town of Carson employs 15 police officers. On a typical day, 6 of the officers are to be assigned to duty in patrol cars, 4 are assigned to the foot patrol, and the remaining 5 are assigned to duty at the station. How many different job configurations are there?
6 6 6.4 Permutations and Combinations Example (Exercise 58 in the text). In how many ways can four married couples attending a concert be seated in a row of eight seats if: (a) There are no restrictions? (b) Each married couple is seated together? (c) The members of each sex are seated together? Example (Exercise 68 in the text). In how many ways can a subcommittee of four be chosen from a Senate committee of five Democrats and four Republicans if: (a) All members are eligible? (b) The subcommittee must consist of two Republicans and two Democrats?
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
More informationFinite 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
More information7.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
More informationCHAPTER 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
More informationIn 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
More informationQuestion 1: How do you count choices using the multiplication principle?
8.1 Permutations Question 1: How do you count choices using the multiplication principle? Question 2: What is factorial notation? Question 3: What is a permutation? In Chapter 7, we focused on using statistics
More informationExam 2 Review (Sections Covered: 3.1, 3.3, , 7.1) 1. Write a system of linear inequalities that describes the shaded region.
Exam 2 Review (Sections Covered: 3.1, 3.3, 6.1-6.4, 7.1) 1. Write a system of linear inequalities that describes the shaded region. 5x + 2y 30 x + 2y 12 x 0 y 0 2. Write a system of linear inequalities
More informationMath 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
More informationMath Week in Review #4
Math 166 Fall 2008 c Heather Ramsey and Joe Kahlig Page 1 Section 2.1 - Multiplication Principle and Permutations Math 166 - Week in Review #4 If you wish to accomplish a big goal that requires intermediate
More informationFinite Mathematics MAT 141: Chapter 8 Notes
Finite Mathematics MAT 4: Chapter 8 Notes Counting Principles; More David J. Gisch The Multiplication Principle; Permutations Multiplication Principle Multiplication Principle You can think of the multiplication
More information* 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)
More information* 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)
More information2. 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
More informationŸ 8.1 The Multiplication Principle; Permutations
Ÿ 8.1 The Multiplication Principle; Permutations The Multiplication Principle Example 1. Suppose the city council needs to hold a town hall meeting. The options for scheduling the meeting are either Monday,
More informationSection 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
More informationPermutations and Combinations. Quantitative Aptitude & Business Statistics
Permutations and Combinations Statistics 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,
More informationWEEK 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
More informationThe 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
More informationCS100: 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
More informationSimple Counting Problems
Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using
More informationProbability 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
More informationChapter 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.
More informationPermutations and Combinations
Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;
More informationSlide 1 Math 1520, Lecture 15
Slide 1 Math 1520, Lecture 15 Formulas and applications for the number of permutations and the number of combinations of sets of elements are considered today. These are two very powerful techniques for
More informationJUST 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
More informationDetermine the number of permutations of n objects taken r at a time, where 0 # r # n. Holly Adams Bill Mathews Peter Prevc
4.3 Permutations When All Objects Are Distinguishable YOU WILL NEED calculator standard deck of playing cards EXPLORE How many three-letter permutations can you make with the letters in the word MATH?
More informationProbability. The MEnTe Program Math Enrichment through Technology. Title V East Los Angeles College
Probability The MEnTe Program Math Enrichment through Technology Title V East Los Angeles College 2003 East Los Angeles College. All rights reserved. Topics Introduction Empirical Probability Theoretical
More informationDiscrete 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
More informationChapter 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
More informationChapter 7. Intro to Counting
Chapter 7. Intro to Counting 7.7 Counting by complement 7.8 Permutations with repetitions 7.9 Counting multisets 7.10 Assignment problems: Balls in bins 7.11 Inclusion-exclusion principle 7.12 Counting
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not
More informationRaise your hand if you rode a bus within the past month. Record the number of raised hands.
166 CHAPTER 3 PROBABILITY TOPICS Raise your hand if you rode a bus within the past month. Record the number of raised hands. Raise your hand if you answered "yes" to BOTH of the first two questions. Record
More informationDay 1 Counting Techniques
Day 1 Counting Techniques Packet p. 1-2 Day 1 Fundamental Counting Principle Other Counting Techniques Notes p. 1 I. Introduction Probability Defined: What do you know about probability? Notes p. 1 I.
More informationUnit 5 Radical Functions & Combinatorics
1 Graph of y Unit 5 Radical Functions & Combinatorics x: Characteristics: Ex) Use your knowledge of the graph of y x and transformations to sketch the graph of each of the following. a) y x 5 3 b) f (
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #22: Generalized Permutations and Combinations Based on materials developed by Dr. Adam Lee Counting
More informationFinite 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
More informationCHAPTER 9 - COUNTING PRINCIPLES AND PROBABILITY
CHAPTER 9 - COUNTING PRINCIPLES AND PROBABILITY Probability is the Probability is used in many real-world fields, such as insurance, medical research, law enforcement, and political science. Objectives:
More informationPermutations 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
More informationCombinations and Permutations
Combinations and Permutations What's the Difference? In English we use the word "combination" loosely, without thinking if the order of things is important. In other words: "My fruit salad is a combination
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,
More informationIntroduction to Counting and Probability
Randolph High School Math League 2013-2014 Page 1 If chance will have me king, why, chance may crown me. Shakespeare, Macbeth, Act I, Scene 3 1 Introduction Introduction to Counting and Probability Counting
More information10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.
Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things
More informationCounting 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
More informationSec. 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
More informationCourse Learning Outcomes for Unit V
UNIT V STUDY GUIDE Counting Reading Assignment See information below. Key Terms 1. Combination 2. Fundamental counting principle 3. Listing 4. Permutation 5. Tree diagrams Course Learning Outcomes for
More informationWeek 6: Advance applications of the PIE. 17 and 19 of October, 2018
(1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3
More informationCombinatorics problems
Combinatorics problems Sections 6.1-6.4 Math 245, Spring 2011 1 How to solve it There are four main strategies for solving counting problems that we will look at: Multiplication principle: A man s wardrobe
More informationAdditional Topics in Probability and Counting. Try It Yourself 1. The number of permutations of n distinct objects taken r at a time is
168 CHAPTER 3 PROBABILITY 3.4 Additional Topics in Probability and Counting WHAT YOU SHOULD LEARN How to find the number of ways a group of objects can be arranged in order How to find the number of ways
More informationCh 9.6 Counting, Permutations, and Combinations LESSONS
Ch 9.6 Counting, Permutations, and Combinations SKILLS OBJECTIVES Apply the fundamental counting principle to solve counting problems. Apply permutations to solve counting problems. Apply combinations
More informationPermutations 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
More informationW = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}
UNIT V STUDY GUIDE Counting Course Learning Outcomes for Unit V Upon completion of this unit, students should be able to: 1. Apply mathematical principles used in real-world situations. 1.1 Draw tree diagrams
More informationChapter 2 Math
Chapter 2 Math 3201 1 Chapter 2: Counting Methods: Solving problems that involve the Fundamental Counting Principle Understanding and simplifying expressions involving factorial notation Solving problems
More information6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices?
Pre-Calculus Section 4.1 Multiplication, Addition, and Complement 1. Evaluate each of the following: a. 5! b. 6! c. 7! d. 0! 2. Evaluate each of the following: a. 10! b. 20! 9! 18! 3. In how many different
More informationLAMC Junior Circle February 3, Oleg Gleizer. Warm-up
LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator
More informationSection 5.4 Permutations and Combinations
Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to
More information4.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
More informationUnit 2 Lesson 2 Permutations and Combinations
Unit 2 Lesson 2 Permutations and Combinations Permutations A permutation is an arrangement of objects in a definite order. The number of permutations of n distinct objects is n! Example: How many permutations
More informationSection 5.4 Permutations and Combinations
Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! = n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to
More informationDistinguishable Boxes
Math 10B with Professor Stankova Worksheet, Discussion #5; Thursday, 2/1/2018 GSI name: Roy Zhao Distinguishable Boxes Examples 1. Suppose I am catering from Yali s and want to buy sandwiches to feed 60
More informationPERMUTATIONS AND COMBINATIONS
PERMUTATIONS AND COMBINATIONS 1. Fundamental Counting Principle Assignment: Workbook: pg. 375 378 #1-14 2. Permutations and Factorial Notation Assignment: Workbook pg. 382-384 #1-13, pg. 526 of text #22
More informationThe factorial of a number (n!) is the product of all of the integers from that number down to 1.
ointers 5.5 Factorial The factorial of a number (n!) is the product of all of the integers from that number down to 1. 6! 6 x 5 x 4 x 3 x 2 x 1 20 You should have a built-in button or function on your
More informationACTIVITY 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
More information9.5 COUnTIng PRInCIPleS. Using the Addition Principle. learning ObjeCTIveS
800 CHAPTER 9 sequences, ProbAbility ANd counting theory learning ObjeCTIveS In this section, you will: Solve counting problems using the Addition Principle. Solve counting problems using the Multiplication
More information4.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
More informationSection : 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
More informationAlgebra II- Chapter 12- Test Review
Sections: Counting Principle Permutations Combinations Probability Name Choose the letter of the term that best matches each statement or phrase. 1. An illustration used to show the total number of A.
More informationJessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3. Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II
Jessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3 Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II Academic Standard(s): A2.8.4 Use permutations, combinations,
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationPermutations. Used when "ORDER MATTERS"
Date: Permutations Used when "ORDER MATTERS" Objective: Evaluate expressions involving factorials. (AN6) Determine the number of possible arrangements (permutations) of a list of items. (AN8) 1) Mrs. Hendrix,
More informationName: Exam 1. September 14, 2017
Department of Mathematics University of Notre Dame Math 10120 Finite Math Fall 2017 Name: Instructors: Basit & Migliore Exam 1 September 14, 2017 This exam is in two parts on 9 pages and contains 14 problems
More informationMath 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
More information19.2 Permutations and Probability Combinations and Probability.
19.2 Permutations and Probability. 19.3 Combinations and Probability. Use permutations and combinations to compute probabilities of compound events and solve problems. When are permutations useful in calculating
More informationPermutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014
Permutations and Combinations MATH 107: Finite Mathematics University of Louisville March 3, 2014 Multiplicative review Non-replacement counting questions 2 / 15 Building strings without repetition A familiar
More informationContents 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
More information3 ky. t x 1) 1/3, -1/2 2) = 140 4) 74 units 5) a) 2400 b) $12 c) 96 students. 6) a) y = 1.10x x b) points c) 1984, 2003
1) 1/3, -1/2 2) 3.8039 3) m SRQ < = 140 4) 74 units 5) a) 2400 b) $12 c) 96 students t x 6) a) y = 1.10x 2 30.49x + 890.03 b) 790.61 points c) 1984, 2003 7) a) 4 3 b) 3ky 3y 3 3 5 7 4 4 3 ky 8) 10) a)
More informationWeek in Review #5 ( , 3.1)
Math 166 Week-in-Review - S. Nite 10/6/2012 Page 1 of 5 Week in Review #5 (2.3-2.4, 3.1) n( E) In general, the probability of an event is P ( E) =. n( S) Distinguishable Permutations Given a set of n objects
More informationCPCS 222 Discrete Structures I Counting
King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222 Discrete Structures I Counting Dr. Eng. Farag Elnagahy farahelnagahy@hotmail.com Office Phone: 67967 The Basics of counting
More informationNwheatleyschaller s The Next Step...Conditional Probability
CK-12 FOUNDATION Nwheatleyschaller s The Next Step...Conditional Probability Say Thanks to the Authors Click http://www.ck12.org/saythanks (No sign in required) Meery To access a customizable version of
More informationMATH STUDENT BOOK. 8th Grade Unit 10
MATH STUDENT BOOK 8th Grade Unit 10 Math 810 Probability Introduction 3 1. Outcomes 5 Tree Diagrams and the Counting Principle 5 Permutations 12 Combinations 17 Mixed Review of Outcomes 22 SELF TEST 1:
More informationLesson 16: The Computation of the Slope of a Non Vertical Line
++ Lesson 16: The Computation of the Slope of a Non Vertical Line Student Outcomes Students use similar triangles to explain why the slope is the same between any two distinct points on a non vertical
More information1. For which of the following sets does the mean equal the median?
1. For which of the following sets does the mean equal the median? I. {1, 2, 3, 4, 5} II. {3, 9, 6, 15, 12} III. {13, 7, 1, 11, 9, 19} A. I only B. I and II C. I and III D. I, II, and III E. None of the
More informationMATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30
MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in
More informationIntroduction. 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
More informationTopics 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
More informationElementary 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
More informationMath Fall 2011 Exam 2 Solutions - November 1, 2011
Math 365 - Fall 011 Exam Solutions - November 1, 011 NAME: STUDENT ID: This is a closed-book and closed-note examination. Calculators are not allowed. Please show all your work. Use only the paper provided.
More informationBayes stuff Red Cross and Blood Example
Bayes stuff Red Cross and Blood Example 42% of the workers at Motor Works are female, while 67% of the workers at City Bank are female. If one of these companies is selected at random (assume a 50-50 chance
More informationCHAPTER 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
More informationLEVEL 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
More informationMAT104: 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
More informationDiscrete 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
More informationelements in S. It can tricky counting up the numbers of
STAT-UB.003 Notes for Wednesday, 0.FEB.0. For many problems, we need to do a little counting. We try to construct a sample space S for which the elements are equally likely. Then for any event E, we will
More informationNOT FOR SALE. Objectives Develop and apply the Fundamental Principle of Counting Develop and evaluate factorials. 2.3 Introduction to Combinatorics
94 CHAPTER 2 Sets and Counting 47. Which of the following can be the group that attends a meeting on Wednesday at Betty s? a. Angela, Betty, Carmen, Ed, and Frank b. Angela, Betty, Ed, Frank, and Grant
More information5 Elementary Probability Theory
5 Elementary Probability Theory 5.1 What is Probability? The Basics We begin by defining some terms. Random Experiment: any activity with a random (unpredictable) result that can be measured. Trial: one
More informationWelcome! 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
More informationPERMUTATION 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
More informationMath141_Fall_2012 ( Business Mathematics 1) Week 7. Dr. Marco A. Roque Sol Department of Mathematics Texas A&M University
( Business Mathematics 1) Week 7 Dr. Marco A. Roque Department of Mathematics Texas A&M University In this sections we will consider two types of arrangements, namely, permutations and combinations a.
More informationCISC 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
More informationMath 14 Lecture Notes Ch. 3.6
Math Lecture Notes h... ounting Rules xample : Suppose a lottery game designer wants to list all possible outcomes of the following sequences of events: a. tossing a coin once and rolling a -sided die
More informationCounting (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
More information