Counting Methods and Probability Theory

Slides:

Advertisements

Similar presentations

PERMUTATIONS AND COMBINATIONS Fundamental Counting Principle ○ If there are n(A) ways in which an event A can occur, and if there are n(B) ways in which.

Advertisements

Counting and Factorial. Factorial Written n!, the product of all positive integers less than and equal to n. Ex: Evaluate.

1 Learning Objectives for Section 7.4 Permutations and Combinations After today’s lesson you should be able to set up and compute factorials. apply and.

Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Counting Principles, Permutations, and Combinations.

Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.

6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.

6.7 – Permutations and Combinations

Counting Principles and Probability Digital Lesson.

Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

6.2 Find Probability Using Permutations. Vocabulary n factorial: product of integers from 1 to n, written as n! 0! = 1 Permutation: arrangement of objects.

Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 8 - Slide 1 P-8 Probability The Counting Principle and Permutations.

The Fundamental Counting Principle and Permutations

Chapter 12 Section 8 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.

Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Permutations and Combinations

Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.

Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.

Section 10-3 Using Permutations and Combinations.

© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.

Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

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

SECTION 10-2 Using the Fundamental Counting Principle Slide

Aim #10-7: How do we use the permutation formula? A permutation is an ordered arrangement of items that occurs when: No item is used more than once. The.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.

Methods of Counting By Dr. Carol A. Marinas Fundamental Counting Principle Event M can occur in m ways Event N can occur in n ways The event M followed.

Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.

You need to get a new cell phone. You jumped into the pool with your old one. There are 12 different models. Those models come in two different colors.

Thinking Mathematically

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 The Fundamental Counting Principle. Fundamental Counting Principle If a series of “n” decisions must be made, and if the first decision can be.

Thinking Mathematically Permutations. No item is used more than once. The order of arrangement makes a difference.

11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.

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.

Permutations 7.2 Chapter 7 Combinatorics 7.2.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.

Bell work Diagnostic Evaluation Please pick up a Pre-Assessment off the table as you come in to class, take a seat, and get started.

Chapter 10 Counting Methods.

Permutations and Combinations

Counting Methods and Probability Theory

Permutations 7.2 Chapter 7 Combinatorics 7.2.1

6.7 – Permutations and Combinations

Permutations and Combinations

Chapter 0.4 Counting Techniques.

4 Probability Lesson 4.8 Combinations and Probability.

Permutations and Combinations

Chapter 7 Logic, Sets, and Counting

Warm Up Permutations and Combinations Evaluate  4  3  2  1

Section 12.8 The Counting Principle and Permutations

Permutations and Combinations

Lesson 11-1 Permutations and Combinations

11.6 Conditional Probability

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

The Counting Principle and Permutations

6-7 Permutations and Combinations

Counting Methods and Probability Theory

Chapter 10 Counting Methods.

Bellwork Practice Packet 10.3 B side #3.

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.

Chapter 11: Further Topics in Algebra

Presentation transcript:

Counting Methods and Probability Theory CHAPTER 11 Counting Methods and Probability Theory

11.2 Permutations

Objectives Use the Fundamental Counting Principle to count permutations. Evaluate factorial expressions. Use the permutations formula. Find the number of permutations of duplicate items.

Permutations Permutation is an ordered arrangement of items that occurs when: No item is used more than once. The order of arrangement makes a difference.

Example: Counting Permutations You need to arrange seven of your favorite books along a small shelf. How many different ways can you arrange the books, assuming that the order of the books makes a difference to you? Solution: You can choose any one of the seven books for the first position on the shelf. This leave six choices for the second position. After the first two positions are filled, there are five books to choose and so on. 7  6  5  4  3  2  1 = 5040

Factorial Notation The product 7∙6∙5∙4∙3∙2∙1 is called 7 factorial and is written 7! Definition: If n is a positive integer, the notation n! (read “n factorial”) is the product of all positive integers from n down through 1. n! = n(n  1)(n  2)···(3)(2)(1) 0! (zero factorial), by definition, is 1. 0! = 1

Example: Using Factorial Notation Evaluate without using your calculator:

A Formula for Permutations The number of possible permutations of r items are taken from n items is:

Example: Using the Formula for Permutations You and 19 of your friends have decided to form a business. The group needs to choose three officers– a CEO, an operating manager, and a treasurer. In how many ways can those offices be filled? Solution: Your group is choosing r = 3 officers from a group of n = 20 people. The order matters because each officer has different responsibilities:

A Formula for Permutations of Duplicate Items The number of permutations of n items, where p items are identical, q items are identical, r items are identical, and so on, is given by:

Example: Using the Formula for Permutations of Duplicate Items In how many distinct ways can the letters of the word MISSISSIPPI be arranged? Solution: The word contains 11 letters (n = 11) where four Is are identical (p = 4), four Ss are identical (q = 4) and 2 Ps are identical (r = 2). The number of distinct permutations are: