12.2 The Fundamental Counting Principle Understand the fundamental counting principle. Use slot diagrams to organize information in counting problems.

Slides:



Advertisements
Similar presentations
DM. 13. A method for counting outcomes of multi-stage processes If you want to perform a series of tasks and the first task can be done in (a) ways, the.
Advertisements

Chapter 8 Counting Principles: Further Probability Topics Section 8.1 The Multiplication Principle; Permutations.
The Fundamental Counting Principle
Counting Chapter 13 sec 1. Break up into groups One method of counting is using the tree diagram. ◦ It is useful to keep track of counting. ◦ Order of.
COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
MATHPOWER TM 12, WESTERN EDITION Chapter 7 Combinatorics.
Counting Methods Topic 7: Strategies for Solving Permutations and Combinations.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Warm Up Use an inequality symbol to make each expression true a x 10 4 ___________ 5, 430 b. 32 ÷ ¼ ___________ 32 ÷4 c. 0.72___________¾.
The Fundamental Counting Principle
A tree diagram is a segmented graph in the shape of a tree in which no branch leads from any vertex back to itself. Each path through it represents a mutually.
Mathematics. Permutation & Combination Session.
Warm-Up 4/29. Rigor: You will learn how to find the number of possible outcomes using the Fundamental Counting Principle, permutations and combinations.
9.6 Counting Principles Permutations Combinations.
Counting Unit Review Sheet. 1. There are five choices of ice cream AND three choices of cookies. a)How many different desserts are there if you have one.
Counting Methods Topic 1: Introduction to the Fundamental Counting Principle.
Advanced Math Topics 4.4 Permutations. You have six younger brothers, George 1, George 2, George 3, George 4, George 5, and George 6. They all want your.
Find the probability and odds of simple events.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Mathematics Probability: Counting Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
The Fundamental Counting Principle states that if there are x ways to choose a first item and y ways to choose a second item, then there are x(y) ways.
Transparency 2 Click the mouse button or press the Space Bar to display the answers.
15.2 Multiplication, Addition and Complement Principles
Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations.
Lesson  The numerator and denominator of a theoretical probability are numbers of possibilities.  Sometimes those possibilities follow regular.
Counting Methods Topic 4: Permutations with Restrictions.
16.1 Fundamental Counting Principle OBJ:  To find the number of possible arrangements of objects by using the Fundamental Counting Principle.
9-3 The Fundamental Counting Principle Pages Indicator(s)  D7.
Counting for Quest 2 Do Now Class Examples Suppose you take 4 different routes to Trenton, the 3 different routes to Philadelphia. How many different.
Algebra II 10.1: Apply the Counting Principle and Permutations HW: HW: p (6, 10, 14, 16, 26, 28, 34, all) Quiz : Friday, 12/13.
Quiz Plot the point: (-4, 2, -3) in the Cartesian space. Find the midpoint between the 2 points: P(1, 5, -7) and Q(-5, 3, -3) 3. Find the distance.
Lesson 1 Menu Five-Minute Check (over Chapter 7) Main Idea and Vocabulary Targeted TEKS Example 1: Use a Tree Diagram Key Concept: Fundamental Counting.
Happy 2014! Sit somewhere new to start the new year! The plan for this semester…
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
Counting The Fundamental Counting Principle. Fundamental Counting Principle If a series of “n” decisions must be made, and if the first decision can be.
Fundamental Counting Theorm. Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when.
12.3 Factorial & Fundamental Counting Principles.
Permutations, Combinations, and Counting Theory
Chapter 13 sec 2.  Form your groups, Please. What is the FCP?  Definition: b  If we want to perform a series of tasks and the first task can be done.
How Many is Too Many? A counting principle investigation.
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
DAY 6: FUNDAMENTAL COUNTING PRINCIPLE Classwork: pptx examples in class Discrete Pre- Test (not a grade in HAC) Unit 2 Project- Due day 13 Homework (day.
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.
2.1 Factorial Notation (Textbook Section 4.6). Warm – Up Question  How many four-digit numbers can be made using the numbers 1, 2, 3, & 4?  (all numbers.
 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.
Probability What are the chances of that happening?
Combinations of Outcomes How Many Possible Outcomes Are There???
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.
12.1 Counting Key Q-How many outcomes can an event have? Fundamental Counting Principle More than one event to take into account. Multiply all events.
Algebra II 10.1: Apply the Counting Principle and Permutations.
11.1 Factorial & Fundamental Counting Principles.
MAT 110 Workshop Created by Michael Brown, Haden McDonald & Myra Bentley for use by the Center for Academic Support.
Counting Techniques Prob & Stats.
Chapter 0.4 Counting Techniques.
Counting Principles and Tree Diagrams
Plimsouls "A Million Miles Away“ The Rolling Stones-Ruby Tuesday
Splash Screen.
At a math teacher. conference, 100. teachers lined
6.2 Fundamental Counting Principal
Counting Principle.
Counting Outcomes.
Splash Screen.
6.1 Counting Principles and Permutations
Fundamental Counting Theorm
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Presentation transcript:

12.2 The Fundamental Counting Principle Understand the fundamental counting principle. Use slot diagrams to organize information in counting problems. Know how to solve counting problems with special conditions.

The fundamental counting principle solves problems without listing elements or drawing tree diagrams. The Fundamental Counting Principle (FCP) – If we want to perform a series of tasks and the first task can be done in a ways, the second can be done in b ways, the third can be done in c ways, and so on, then all the tasks can be done in a x b x c x … ways.

How many different outfits can be formed with 3 coats, 5 pairs of pants, 7 shirts, and 4 ties? –3 x 5 x 7 x 4 = 420 outfits.

Slot diagrams help organize information before applying the fundamental counting principle. Sometimes special conditions affect the number of ways we can perform the various tasks. A useful technique for solving problems such as these is to draw a series of blank spaces to keep track of the number of ways to do each task. This is called a slot diagram. 1 st task 2 nd task3 rd task4 th task x x x Number of ways

To open personal locker you must enter 5 digits from the set 0, 1, 2, …, 9. How many different patterns are possible if a) Any digits can be used in any position and repetition is allowed? 100,000 possibilities x xx x any digitany digit any digit any digitany digit b) Any digits can be used in any position, but repetition is not allowed? 30,240 possibilities x xx x any digit can’t repeat can’t repeat can’t repeatcan’t repeat

In solving counting problems, consider special conditions first. Ten students are in a class. Joe and Mary must sit together in the front row. If there are six chairs in the first row of the classroom, how many different ways can the students be assigned to sit in this row? –To begin this problem, first consider the special condition.

Seat 1 Seat 2 Seat 3 Seat 4 Seat 5Seat 6 Joe Maryx x x x x Joe Mary x x x x x Joe Mary x x x xx Joe Mary x x xx x JoeMary There are 5 ways to choose the two seats for Joe and Mary and there are 2 ways of deciding how Joe and Mary will sit within these seat – Joe sits either on the right or on the left. There are eight students left; thus, we have 8 for the 1 st remaining seats, 7 for the 2 nd seat, 6 for the 3 rd seat, and 5 for the last seat. Therefore, the number of ways to seat the students in the first row is: 5 x 2 x 8 x 7 x 6 x 5 = 16,800

Classwork/Homework Classwork – Page 695 (5 – 21 odd, 37, 39) Homework – Page 695 (6 – 20 even, 38 skip #12)