Counting Principle part 2 I. Math symbols and formulas for Counting Principles. A) Basic Counting Principle = m x n where you have m things and n things.

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.

Permutations and Combinations

How many possible outcomes can you make with the accessories?

Permutations and Combinations With Beanie Babies.

6.7 – Permutations and Combinations

Permutations and Combinations. Random Things to Know.

Statistics Probabilities

5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.

40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Probability Lesson: PR-4 Fundamental Counting Principle Fundamental Counting Principle Learning.

Conditional Probabilities Multiplication Rule Independence.

Section 4.3 Basic Counting Rules HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2008 by Hawkes Learning Systems/Quant Systems, Inc. All.

P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.

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.

Chapter 4 Lecture 4 Section: 4.7. Counting Fundamental Rule of Counting: If an event occurs m ways and if a different event occurs n ways, then the events.

Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?

Permutations Chapter 12 Section 7. Your mom has an iTunes account. You know iTunes requires her to enter a 7- letter password. If her password is random,

Dr. Fowler AFM Unit 7-7 Permutations and Combinations.

PROBABILITY. FACTORIALS, PERMUTATIONS AND COMBINATIONS.

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

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 Techniques. Multiplication Rule of Counting If a task consists of a sequence of choices in which there are p selections for the first choice,

Chapter  Determine how many different possibilities are possible:  1. There are 3 different ice cream flavors and 5 different toppings. You.

Section 10-3 Using Permutations and Combinations.

Warm Up 2/1/11 1.What is the probability of drawing three queens in a row without replacement? (Set up only) 2.How many 3 letter permutations can be made.

Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.

6.3Find Probabilities Using Combinations

Lesson # 65 Notes Combinations. Lesson # 65 Combinations.

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.

2.2 Permutations (Textbook Section 4.6). Recall Factorial Notation  The number of ways to arrange n objects into n spots is n! (read “!” a “factorial”)

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

Honors Analysis.  Independent Events: Events that do not affect each other  Sample Space: List of all possible outcomes  Fundamental Counting Principle:

Objective: To calculate mean, median, mode and Range. Class Notes Sec The odds for an event are 4:11. What is the probability the event WON’T occur?

3.2 Combinations.

© 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.

Honors Analysis.  Fundamental Counting Principle  Factorial Calculations (No Calculator!)  Permutation Calculation (No Calculator!)  Arrangement Problems.

Permutations and Combinations

Do Now A password must contain 4 characters. 1. How many passwords are possible if you just use digits in the password? 2. How many are possible with just.

The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.

Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.

EXAMPLE 1 Count permutations

Chapter 10 Counting Methods.

Counting Methods and Probability Theory

Happy Pi Day! Find x. 15 If you still have x

6.7 – Permutations and Combinations

Permutations and Combinations

Unit 9: Probability Final Exam Review.

6.2 Find Probability Using Permutations

How to Count Things “There are three kinds of people in the world: those who can count and those who cannot.” 11/21/2018.

Permutations and Combinations

Permutations and Combinations

Section 12.8 The Counting Principle and Permutations

Lesson 11-1 Permutations and Combinations

Permutations and Combinations

Advanced Combinations and Permutations

6-7 Permutations and Combinations

How many possible outcomes can you make with the accessories?

MATH 2311 Section 2.1.

Counting Methods and Probability Theory

Counting Principle.

Permutations, Combinations & Counting Principle

Permutations and Combinations

Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.

Permutations and Combinations

pencil, highlighter, GP notebook, calculator, red pen

Section 0.4 Day 1 – Counting Techniques

MATH 2311 Section 2.1.

Presentation transcript:

Counting Principle part 2 I. Math symbols and formulas for Counting Principles. A) Basic Counting Principle = m x n where you have m things and n things and want them arranged every possible way. B) Combinations (counting principle) where order does NOT matter. It comes from the Permutations formula. 1) If repeating is NOT allowed (like a lottery ticket) 2) If repeating IS allowed (like a combination lock) n = number of objects in the set r = how many objects we are selecting/arranging. ! = factorial MENU  5 Probability  1 Factorial

Counting Principle part 2 Examples: Combinations without repeating 1) How many ways can you create a password that uses 5 different lower case letters in a row. 2) If a lottery ticket has 59 numbers and you have to pick 5 of them, how many different ways can you fill out a lottery ticket? This does not include picking the powerball (1 number out of 36).

Counting Principle part 2 C) If the objects are NOT allowed to be repeated, then you can use a button on the calculator to find how many combinations (counting principle) there are. ( nCr ) 1) MENU  5 Probability  3 Combinations nCr(n,r) n = number of objects r = how many are being selected. Examples: 1b) A 5 letter lower case password (no repeating). n = 26 & r = 5 type MENU  5  3 type 26,5 in the ( ) Screen shows nCr(26,5) the answer is b) A 59 number lottery ticket, pick 5 numbers. n = 59 & r = 5 nCr(59,5) = 5,006,386

Counting Principle part 2 Examples: Combinations with repeating. 3) How many ways can you create a password that uses any 5 lower case letters? (repeating is allowed) Note: There is NOT a button to do repeating combinations. You have to use the formula.