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.

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
Combinations, Permutations, and the Fundamental Counting Principle.
MATHPOWER TM 12, WESTERN EDITION Chapter 7 Combinatorics.
Probability & Statistics Section 3.4.  The letters a, b, can c can be arranged in six different orders: abcbaccab acbbcacba  Each of these arrangements.
Aim: Permutations Course: Math Lit.. Aim: Is Spiderman a permutation or what? A = {a, b, c, d, e} What could be a two element subset of A? {a, b} Is =
5.4 Counting Methods Objectives: By the end of this section, I will be able to… 1) Apply the Multiplication Rule for Counting to solve certain counting.
Combinations We should use permutation where order matters
6.7 – Permutations and Combinations
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Permutations and Combinations. Random Things to Know.
Mathematics. Permutation & Combination Session.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Probability Lesson: PR-4 Fundamental Counting Principle Fundamental Counting Principle Learning.
9.6 Counting Principles Permutations Combinations.
Aim: What is a permutation? Do Now: Evaluate n(n -1)(n-2)(n-3). 1. n = 52. n = 10.
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
Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Section 10-3 Using Permutations and Combinations.
Lesson 9-4 Pages Permutations Lesson Check 9-3.
Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
March 10,  Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound.
Counting Methods Review General Guidelines. Fundamental Counting Principle Each category outcome is independent of any other category outcome OR Items.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Counting Methods Topic 4: Permutations with Restrictions.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 M ARIO F. T RIOLA E IGHTH E DITION E LEMENTARY S TATISTICS Section 3-6 Counting.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
CSNB143 – Discrete Structure
Warm Up Which of the following are combinations?
Thinking Mathematically
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Algebra 2/TrigonometryName: __________________________ 12.1, 12.2 Counting Principles NotesDate: ___________________________ Example 1: You are buying.
11.1C Finding the Number of Permutations….. with Repeats
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
Counting Principle 1.Suppose you have three shirts (red, black, and yellow) and two pair of pants (jeans and khakis). Make a tree diagram to find the number.
7.3 Combinations Math A combination is a selection of a group of objects taken from a larger pool for which the kinds of objects selected is of.
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.
 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Chapter 7: Probability Lesson 4: Permutations Mrs. Parziale.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
Copyright © Peter Cappello 2011 Simple Arrangements & Selections.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,
Section 6-7 Permutations and Combinations. Permutation Permutation – is an arrangement of items in a particular order.
Chapter 10 Counting Methods.
MATH 2311 Section 2.1.
Permutations and Combinations
Counting Methods and Probability Theory
Section 8.3 PROBABILITY.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
6.7 – Permutations and Combinations
Permutations and Combinations
Chapter 0.4 Counting Techniques.
12.1 The Counting Principle (Crash Course in Probability)
How to Count Things “There are three kinds of people in the world: those who can count and those who cannot.” 11/21/2018.
8.3 Counting Apply the fundamental counting principle
Permutations and Combinations
Section 12.8 The Counting Principle and Permutations
The Counting Principle and Permutations
6-7 Permutations and Combinations
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
Presentation transcript:

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 task is given by m x n x p x... arrangements of repeats Fundamental Counting Principle A permutation determines the number of ways to list or arrange items. A permutation is a linear arrangement of a set of objects for which the order of the objects is important. Items may be identical or may repeat. A combination determines the number of ways to group items. Items must be unique and may not be repeated. Many permutations question may be computed by using FCP. 11.1B Permutations

Math Select the appropriate strategy for calculating each situation choosing 3 friends to go out to lunch determine arrangements of letters arranging vases on a shelf picking your favourite books to make a Top 10 List picking and ranking your favourite books on a Top 10 List

In how many ways can the letters of the word HARMONY be arranged? 7! = 5040 In how many ways can the letters of the word HARMONY be arranged if the arrangement must start with H? 1 x 6! = 720 In how many ways can the letters of the word HARMONY be arranged if the letters H and A must be together (adjacent)? = ! x 6! Math The number of permutations of n different objects taken all at a time is n!

How many three-letter arrangements can be formed from the letters of the word DINOSAUR? ____ x ____ x ____ 1 st 2 nd 3 rd 8 76 There would be 336 ways. 336 represents the number of permutations of eight objects taken three at a time. 8P38P3 is read as “eight permute three”. In general, if we have n objects but only want to select r objects at a time, the number of different linear arrangements is: Finding the Number of Permutations Write 8 x 7 x 6 in factorial notation. What restrictions are on n and r? 4

Finding the Number of Permutations The number of permutations of n objects taken n at a time is: n P n = n! 3P33P3 From these two results, we see that 0! = 1. To have meaning when r = n, we define 0! = 1. = 3! Math 30-15

1. Using the letters of the word PRODUCT, how many four-letter arrangements can be made? 7P47P4 = 840 There would be 840 arrangements. Finding the Number of Permutations 2. Determine the number of different arrangements of four or more letters that can be formed with the letters of the word LOGARITHM if each letter is not used more than once. 9P49P4 + 9 P P P P P 9 = There would be arrangements. Math True or False

4. How many six-letter words can be formed from the letters of TRAVEL? (Note that letters cannot be repeated) a) If any of the six letters can be used. 6 P 6 = 6! = 720 b) If the first letter must be “L”: 1 x 5 P 5 = 1 x 5! = 120 c) If the second and fourth letters are vowels: ___ ___ ___ V V 21 2 x 1 x 4! = 48 d) If the “A” and the “V” must be adjacent: (Treat the AV as one group - this grouping can be arranged 2! ways.) 5! x 2! = 240 Finding the Number of Permutations Math 30-17

Finding the Number of Permutations….. with Repeats How many arrangements are there of four letters from the word PREACHING? 9P49P4 How many distinct arrangements of BRAINS are there keeping the vowels together? 5! x 2! = 240 Math = 3024

A bookshelf contains five different algebra books and seven different physics books. How many different ways can these books be arranged if the algebra books are to be kept together? Total number of arrangements = 8! x 5! = Finding the Number of Permutations (Grouping) A student has 4 different biology books, 5 different chemistry books, and 6 different math books. In how many ways can the books be arranged so that the biology books stand together, the chemistry books stand together and the math books stand together. 4! x 5! x 6! x 3!= There are ways of arranging the books. Math 30-19

10 Determine the number of different arrangements using all the letters of the word ACCESSES that begin with at least two S’s

Two objects are selected from a group and arranged in order. If there are 90 possible arrangements, how many objects are there? n P 2 = 90 n(n - 1) = 90 n 2 - n = 90 n 2 - n - 90 = 0 (n - 10)(n + 9) = 0 n - 10 = 0 n = 10 OR n + 9 = 0 n = -9 n  N Therefore n = 10. Permutations 11

Solving Equations Involving Permutations. Solve n P 2 = 30 algebraically. n(n - 1) = 30 n 2 - n = 30 n 2 - n - 30 = 0 (n - 6)(n + 5) = 0 n = 6 or n = -5 Therefore, n = 6. 12

Solving Equations Involving Permutations. Solve n P 4 = 8( n-1 P 3 ) algebraically. n = 8 Math

Page 524 2, 3, 4, 5, 6, 7, 8, 10, 11, 15, 16, 17, 20, 22c, 24, 25, 26, C1 Math