Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.

Slides:



Advertisements
Similar presentations
Counting Principles Probability.
Advertisements

Permutations and Combinations
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
Combinations We should use permutation where order matters
College Algebra Fifth Edition
Chapter 5 Section 5 Counting Techniques.
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Notes 9.1 – Basic Combinatorics. I. Types of Data 1.) Discrete Data – “Countable”; how many? 2.) Continuous Data – “uncountable”; measurements; you can.
Permutations and Combinations
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
13-1 Permutations and Combinations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Advanced Precalculus Advanced Precalculus Notes 12.2 Permutations and Combinations.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
October 13, 2009 Combinations and Permutations.
Section 5.5 Counting Techniques. An airport shuttle bus driver needs to pick up 4 separate passengers: a,b,c,d. How many different ways can the.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations.
Probability Counting Methods. Do Now: Find the probablity of: Rolling a 4 on a die Rolling a “hard eight” (2 - 4’s) on a pair of dice.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
SECTION 10-2 Using the Fundamental Counting Principle Slide
Section 11.2 Combinations Math in Our World Learning Objectives  Distinguish between combinations and permutations.  Find the number of combinations.
CSNB143 – Discrete Structure
1 If a task is made up of multiple operations (activities or stages that are independent of each other) the total number of possibilities for the multi-step.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Counting Principles Multiplication rule Permutations Combinations.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
3.2 Combinations.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
Probability and Counting Rules 4-4: Counting Rules.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
MATH 2311 Section 2.1.
Permutations and Combinations
Counting Methods and Probability Theory
12.2 Permutations and Combinations
Copyright © Cengage Learning. All rights reserved.
Chapter 5 Probability 5.5 Counting Techniques.
Chapter 0.4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
Copyright © Cengage Learning. All rights reserved.
8.3 Counting Apply the fundamental counting principle
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Counting, Permutations, & Combinations
6-7 Permutations and Combinations
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Combinations & Permutations (4.3.1)
Counting Methods and Probability Theory
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
PERMUTATIONS.
Permutations and Combinations
9.1 Basic Combinatorics.
Presentation transcript:

Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems Using Permutations Solve Counting Problems Using Combinations Solve Counting Problems Using Permutations Involving n Non-Distinct Objects

Multiplication Principle of Counting If a task consists of a sequence of choices in which there are p selections for the first choice, q selections for the second choice, r selections for the third choice, and so on, then the task of making these selections can be done in different ways.

If a license plate consists of a letter, then 5 numbers, how many different types of license plates are possible?

A permutation is an ordered arrangement of n distinct objects without repetitions. The symbol P(n, r) represents the number of permutations of n distinct objects, taken r at a time, where r < n. Example: How many ways can you arrange 7 books on a shelf? There are 7 choices for the first book, six choices for the second book (since the first was already picked), etc... So: (7)(6)(5)(4)(3)(2)(1) = 7! = 5040 ways

Number of Permutations of n Distinct Objects Taken r at a Time The number of different arrangements from selecting r objects from a set of n objects (r < n), in which 1. the n objects are distinct 2. once an object is used, it cannot be repeated 3. order is important is given by the formula

Suppose you were in charge of selecting four performers from a group of twelve to perform at a talent show. How many ordered arrangements of performers do you have to choose from? Since you are selecting 4 from 12, find P(12,4)

A combination is an arrangement, without regard to order, of n distinct objects without repetitions. The symbol C(n, r) represents the number of combinations of n distinct objects taken r at a time, where r < n.

Number of Combinations of n Distinct Objects Taken r at a Time The number of different arrangements from selecting r objects from a set of n objects (r < n), in which 1. the n objects are distinct 2. once an object is used, it cannot be repeated 3. order is not important is given by the formula

How many ways can you form a committee of three people from a group of 25? Since you are selecting 3 from 25 and order does not matter, we find: