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

Slides:



Advertisements
Similar presentations
Basic counting principles, day 1 To decide how many ways something can occur, you can draw a tree diagram. Note that this only shows half of the tree –
Advertisements

MATHPOWER TM 12, WESTERN EDITION Chapter 7 Combinatorics.
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 =
How many possible outcomes can you make with the accessories?
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
Combinations We should use permutation where order matters
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Permutations and Combinations. Random Things to Know.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Probability Lesson: PR-4 Fundamental Counting Principle Fundamental Counting Principle Learning.
15.1 Factorial & Fundamental Counting Principles.
Aim: What are the permutation and combination? Do Now: 2. If four students are scheduled to give a report in class, in how many ways can the students.
Permutations Lesson 10 – 4. Vocabulary Permutation – an arrangement or listing of objects in which order is important. Example: the first three classes.
Warm Up 1/31/11 1. If you were to throw a dart at the purple area, what would be the probability of hitting it? I I 5.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Counting, Permutations, & Combinations. A counting problem asks “how many ways” some event can occur. Ex. 1: How many three-letter codes are there using.
Section 10-3 Using Permutations and Combinations.
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
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.
16.1 Fundamental Counting Principle OBJ:  To find the number of possible arrangements of objects by using the Fundamental Counting Principle.
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.
There are 3 horses (labeled A, B and C) racing for different places. Draw tree diagram to show 1. In how many ways can the horses be placed as 1 st, 2.
Thinking Mathematically
Permutations and Combinations
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Permutations Review: (Counting Principle) 1.) Carol has 4 skirts, 3 blouses and 3 pairs of shoes. How many different outfits are possible? 2.) A bike license.
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.
12.3 Factorial & Fundamental Counting Principles.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Permutations, Combinations, and Counting Theory
9.6 The Fundamental Counting Principal & Permutations.
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
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.
Lesson 0.4 (Counting Techniques)
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations and Combinations
Chance of winning Unit 6 Probability. Multiplication Property of Counting  If one event can occur in m ways and another event can occur in n ways, then.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Probability and Counting Rules 4-4: Counting Rules.
Permutations With Repetitions By Mr Porter 9 Maths 8 Physics7 Biology8 Physics 7 Biology DEFIONTNII CLGEBRAAI.
Fri 4/29 Lesson 11 – 1 Learning Objective: To use permutations & combinations to count possibilities Hw: 11-1 Fundamental Counting WS.
Permutations and Combinations
Chapter 10 Counting Methods.
Counting Methods and Probability Theory
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
12.1 The Counting Principle (Crash Course in Probability)
12.1 The Fundamental Counting Principle & Permutations
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
How many possible outcomes can you make with the accessories?
Counting Methods and Probability Theory
Counting Principle.
Chapter 10 Counting Methods.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Permutations and Combinations
Permutations and Combinations
Lecture 7: Permutations and Combinations
Warm Up Melanie is choosing an outfit for a job interview. She has four dresses, three blouses, five pairs of pants and three pairs of shoes to choose.
Presentation transcript:

11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal 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... repeated elements where m is the number of choices for the first stage, and n is the number of choices for the second stage, p is the number of choices for the third stage, and so on. Fundamental Counting Principle 1

Math30-12 A permutation determines the number of ways to list or arrange items. 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.

1. Colleen has six different blouses, four unique skirts and four sweaters of different colours. How many different outfits can she choose from, assuming that she wears three items at once? _____ x ______ x ______ Blouses Skirts Sweaters 64 4 = 96 ways Colleen can select an outfit 96 different ways. 2. The final score in a soccer game is 5 to 4 for team A. How many different half-time scores are possible? _____ x ______ Team A (0 - 5) Team B (0 - 4) 65 There are 30 different possible half-time scores. Math

3. How many different arrangements can be made from the letters of the word CAT, if no letter can be used more than once. ____ x ____ x ____ 321 There are 6 three-letter arrangements. Applying the Fundamental Counting Principle 1st 2nd 3rd 4.If all the letters in the word FACETIOUS are used with no letters repeated, how many different arrangements can be made? ___ x ___ x ___ x ___ x ___ x ___ x ___ x ___ x ___ There are arrangements Math What if there were 26 letters?

The product of consecutive natural numbers, in decreasing order down to the number one, can be represented using factorial notation: 3 x 2 x 1 = 3! Read as “three factorial”. 1! = 1 2! = 2 x 1= 2 3! = 3 x 2 x 1= 6 4! = 4 x 3 x 2 x 1= 24 5! = 5 x 4 x 3 x 2 x 1= 120 6! = 6 x 5 x 4 x 3 x 2 x 1= 720 7! = 7 x 6 x 5 x 4 x 3 x 2 x 1= ! = 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1= Why does factorial notation stop at 1 not 0? Math30-15 What is the value of 0! ? All objects must be chosen until the set is completely exhausted.

Math30-16 By definition, for a natural number n: n! = n(n - 1)(n - 2)(n - 3) x... x 3 x 2 x 1 3! = 3 x (3 - 1) x (3 - 2) = 3 x 2 x 1 5! = 5 x (5 – 1) x (5 – 2) x (5 - 3) x (5 - 4) = 5 x 4 x 3 x 2 x 1

5. How many different ways can 5 friends line up to board a bus? 5! Applying the Fundamental Counting Principle 6. a) How many ways can 9 different books be placed on a single shelf? 9! Math b) How many ways can any three of 9 different books be placed on a single shelf? ____ x ____ x ____ 987 1st 2nd 3rd 1

7. How many three-letter arrangements can be made from the letters of the word CERTAIN, if no letter can be used more than once and each is made up of a vowel between two consonants. ____ x ____ x ____ 433 There are 36 three-letter arrangements. Applying the Fundamental Counting Principle with Restrictions 1st 2nd 3rd Must be a consonant: C, R, T, and N Must be a vowel: E, A, and I Must be a consonant and can not be the same as the first letter 8. If all the letters in the word PHONE are used, how many different 5-letter arrangements can be made beginning with a vowel? ____ x ____ x ____ x ____ x ____ 243 Must be a vowel 21 There are 48 arrangements. Math

9. You are given a multiple choice test with 10 questions. There are four answers to each question. How many ways can you complete the test? ____ x ____ x ____ x ____ x ____ x ____ x ____ x ____ x ____ x ____ You can complete the test 4 10 or ways. 10. How many different 3-letter arrangements begin with the letter D and end with the letter G if repetition is not allowed? ____ x ____ x ____ 1241 There are 24 arrangements. Math

Calculations with Factorial Notation = n Math

Math Page 524 1, 9, 12, 13, 14,

7. How many four-digit numerals are there with no repeated digits? _____ x ______ x ______ x _____ 7998 = 4536 The number of four-digits numerals would be st 2nd3rd4th can not be a zero can be a zero, but can not be the same as the first two digits have been used three digits have been used Math30-112

8. How many odd four-digit numerals have no repeated digits. _____ x ______ x ______ x _____ 5887 = 2240 The number of odd four-digit numerals would be must be odd: 1,3,5,7, or 9 1st 2nd3rd4th can not be a zero or the same as the last digit two digits have been used three digits have been used 9. Using any letter from the alphabet, how many four-letter arrangements are possible if repeats are allowed? _____ x ______ x ______ x _____ 26 = The number of four-letter arrangements would be st 2nd3rd4th use any of the 26 letters of the alphabet repetition is allowed Math30-113

12. How many even four-digit numerals have no repeated digits. _____ x ______ x ______ x _____ must be even: 2, 4, 6, or 8 _____ x ______ x ______ x _____ must be a zero OR = 1792 = 504 The number of even four-digit would be = st 2nd3rd4th can not be a zero or the same as the last digit two digits have been used three digits have been used There are two cases which must be considered when solving this problem: zero as the last digit and zero not the last digit. 1st 2nd3rd4th can not be a zero two digits have been used three digits have been used Math30-114