12.2 Combinations and Binomial Theorem

Slides:



Advertisements
Similar presentations
6.1 Use Combinations and Binomial Theorem 378 What is a combination? How is it different from a permutation? What is the formula for n C r ?
Advertisements

10.2 Combinations and Binomial Theorem What you should learn: Goal1 Goal2 Use Combinations to count the number of ways an event can happen. Use the Binomial.
12.2 Combinations and Binomial Thm p In the last section we learned counting problems where order was important For other counting problems where.
6.8 – Pascal’s Triangle and the Binomial Theorem.
Permutations and Combinations Rosen 4.3. Permutations A permutation of a set of distinct objects is an ordered arrangement these objects. An ordered arrangement.
Counting Chapter 6 With Question/Answer Animations.
CSE115/ENGR160 Discrete Mathematics 04/17/12
More Probability and Counting Friday, April 9, 2004.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Counting principle and permutations
Chapter 11: Counting Methods
12.2 Combinations and Binomial Theorem p In the last section we learned counting problems where order was important For other counting problems.
Chapter 10: Counting Methods
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Notes 9.2 – The Binomial Theorem. I. Alternate Notation A.) Permutations – None B.) Combinations -
The Binomial Theorem. Powers of Binomials Pascal’s Triangle The Binomial Theorem Factorial Identities … and why The Binomial Theorem is a marvelous.
Chapter  Determine how many different possibilities are possible:  1. There are 3 different ice cream flavors and 5 different toppings. You.
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
The Binomial Theorem 9-5. Combinations How many combinations can be created choosing r items from n choices. 4! = (4)(3)(2)(1) = 24 0! = 1 Copyright ©
12.2 Combinations and The Binomial Theorem
11.1 – Pascal’s Triangle and the Binomial Theorem
Section 3 – Permutations & Combinations. Learning Objectives Differentiate between: – Permutations: Ordering “r” of “n” objects (no replacement) Special.
Lesson 6.8A: The Binomial Theorem OBJECTIVES:  To evaluate a binomial coefficient  To expand a binomial raised to a power.
Copyright © Cengage Learning. All rights reserved. 8.4 The Binomial Theorem.
Section 10.2 A Combinations. 2,598,960 How are combinations different from permutations? From a group of 5 students (Kyle, Joanne, Mary, Charlie, and.
Pg. 606 Homework Pg. 606 #11 – 20, 34 #1 1, 8, 28, 56, 70, 56, 28, 8, 1 #2 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1 #3 a5 + 5a4b + 10a3b2 + 10a2b3.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Section 6.3. Section Summary Permutations Combinations.
Chapter 10 Counting Methods.
L14: Permutations, Combinations and Some Review
Adding, Subtracting, and Multiplying Polynomials
Developing Your Counting Muscles
Sequences, Series, and Probability
Today’s topics Counting Reading: Sections , 4.4 Upcoming
Using Combinations You have already learned that order is important for some counting problems. For other counting problems, order is not important. For.
WARMUP Lesson 10.2, For use with pages b
Sequences, Series, and Probability
Pascal’s Triangle and the Binomial Theorem
Copyright © Cengage Learning. All rights reserved.
Section 9-5 The Binomial Theorem.
Use Combinations and the Binomial Theorem
Adding, Subtracting, and Multiplying Polynomials
Permutations and Combinations
The Binomial Theorem Objectives: Evaluate a Binomial Coefficient
Binomial Expansion.
Chapter 10: Counting Methods
Digital Lesson The Binomial Theorem.
Use Combinations and the Binomial Theorem
8.4 – Pascal’s Triangle and the Binomial Theorem
10.2A Combinations What you should learn: Goal 1
Digital Lesson The Binomial Theorem.
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Permutations and Combinations
The Binomial Theorem.
Evaluate the expression.
Combinations.
Determining the Number of Possible Outcomes
The Binomial Theorem OBJECTIVES: Evaluate a Binomial Coefficient
Chapter 12 Section 4.
The Binomial Theorem.
Use Combinations and the Binomial Theorem
Applied Combinatorics, 4th Ed. Alan Tucker
Chapter 11: Further Topics in Algebra
10.5 Permutations and Combinations.
The Binomial Theorem.
10.4 – Pascal’s Triangle and the Binomial Theorem
Two hungry Math 160 students are waiting in line at Chipotle
Warm Up 1. 10C P4 12C P3 10C P3 8C P5.
pencil, red pen, highlighter, GP notebook, calculator
Presentation transcript:

12.2 Combinations and Binomial Theorem p. 708 What is a combination? How is it different from a permutation? What is the formula for nCr? What is Pascal’s Triangle? What is the Binomial Theorem? How is Pascal’s Triangle connected to the binomial theorem?

In the last section we learned counting problems where order was important For other counting problems where order is NOT important like cards, (the order you’re dealt is not important, after you get them, reordering them doesn’t change your hand) These unordered groupings are called Combinations

A Combination is a selection of “r” objects from a group of “n” objects where order is not important

Combination of n objects taken r at a time The number of combinations of r objects taken from a group of n distinct objects is denoted by nCr and is:

For instance, the number of combinations of 2 objects taken from a group of 5 objects is

Finding Combinations In a standard deck of 52 cards there are 4 suits with 13 of each suit. If the order isn’t important how many different 5-card hands are possible? The number of ways to draw 5 cards from 52 is = 2,598,960

In how many of these hands are all 5 cards the same suit? You need to choose 1 of the 4 suits and then 5 of the 13 cards in the suit. The number of possible hands are:

How many 7 card hands are possible? How many of these hands have all 7 cards the same suit?

When finding the number of ways both an event A and an event B can occur, you multiply. When finding the number of ways that an event A OR B can occur, you +.

Deciding to + or * A restaurant serves omelets. They offer 6 vegetarian ingredients and 4 meat ingredients. You want exactly 2 veg. ingredients and 1 meat. How many kinds of omelets can you order?

Suppose you can afford at most 3 ingredients How many different types can you order? You can order an omelet with 0, or 1, or 2, or 3 items and there are 10 items to choose from.

Counting problems that involve ‘at least’ or ‘at most’ sometimes are easier to solve by subtracting possibilities you don’t want from the total number of possibilities.

Subtracting instead of adding: A theatre is having 12 plays. You want to attend at least 3. How many combinations of plays can you attend? You want to attend 3 or 4 or 5 or … or 12. From this section you would solve the problem using: Or……

For each play you can attend you can go or not go. So, like section 12.1 it would be 2*2*2*2*2*2*2*2*2*2*2*2 =212 And you will not attend 0, or 1, or 2. So:

The Binomial Theorem 0C0 1C0 1C1 2C0 2C1 2C2 3C0 3C1 3C2 3C3 Etc…

Pascal's Triangle! 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 Etc… This describes the coefficients in the expansion of the binomial (a+b)n

(a+b)2 = a2 + 2ab + b2 (1 2 1) (a+b)3 = a3(b0)+3a2b1+3a1b2+b3(a0) (1 3 3 1) (a+b)4 = a4+4a3b+6a2b2+4ab3+b4 (1 4 6 4 1) In general…

(a+b)n (n is a positive integer)= nC0anb0 + nC1an-1b1 + nC2an-2b2 + …+ nCna0bn =

(a+3)5 = 5C0a530+5C1a431+5C2a332+5C3a233+5C4a134+5C5a035= 1a5 + 15a4 + 90a3 + 270a2 + 405a + 243

(a+3)5 = 1a530+5a431+10a332+10a233+5a134+1a035 1a5 + 15a4 + 90a3 + 270a2 + 405a + 243 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1

What is a combination? A selection of objects where order is not important. How is it different from a permutation? In other counting problems, order is not important. What is the formula for nCr? What is Pascal’s Triangle? An arrangement of the values of nCr in a triangular pattern. What is the Binomial Theorem? A formula that gives the coefficients in the raising of (a+b) to a power. How is Pascal’s Triangle connected to the binomial theorem? Pascal’s Triangle gives the same coefficients as the Binomial Theorem.

Assignment 12.2 P. 712 19-39 odd, 45-57 odd, skip 51