Combinatorics: Combinations

Slides:



Advertisements
Similar presentations
© 2010 Pearson Education, Inc. All rights reserved Chapter 9 9 Probability.
Advertisements

Combinations We should use permutation where order matters
Copyright © Ed2Net Learning Inc.1. 2 Warm Up 1.List all combinations of Roshanda, Shelli, Toshi, and Hector, taken three at a time 2. In how many ways.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
CHAPTER 4 Fraction Notation: Addition, Subtraction, and Mixed Numerals Slide 2Copyright 2012, 2008, 2004, 2000 Pearson Education, Inc. 4.1Least Common.
Chapter 7 Section 2. Objectives 1 Copyright © 2012, 2008, 2004 Pearson Education, Inc. Multiplying and Dividing Rational Expressions Multiply rational.
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Section 10-3 Using Permutations and Combinations.
THE NATURE OF COUNTING Copyright © Cengage Learning. All rights reserved. 12.
Copyright © 2011 Pearson Education, Inc. Combinations, Labeling, and the Binomial Theorem Section 8.5 Sequences, Series, and Probability.
SECTION 10-2 Using the Fundamental Counting Principle Slide
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Slide 2- 1 Copyright © 2012 Pearson Education, Inc. Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
 SOLVE EQUATIONS WITH ABSOLUTE VALUE.  SOLVE INEQUALITIES WITH ABSOLUTE VALUE. Copyright © 2012 Pearson Education, Inc. Publishing as Addison Wesley.
Copyright © 2015, 2012, and 2009 Pearson Education, Inc. 1 Section 6.4 Fundamental Theorem of Calculus Applications of Derivatives Chapter 6.
Copyright © 2015, 2011, 2007 Pearson Education, Inc. 1 1 Chapter 7 Rational Expressions and Equations.
Slide 7- 1 Copyright © 2012 Pearson Education, Inc.
Copyright © 2010 Pearson Education, Inc. All rights reserved Sec
Copyright © 2015, 2011, 2007 Pearson Education, Inc. 1 1 Chapter 8 Rational Exponents, Radicals, and Complex Numbers.
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.
1 Section 5.3 Permutations and Combinations Permutations (order counts) A permutation of a set is an arrangement of the objects from a set. There are n!
Section 6.4. Powers of Binomial Expressions Definition: A binomial expression is the sum of two terms, such as x + y. (More generally, these terms can.
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.
Rationalizing Numerators and Denominators of Radical Expressions Rationalize denominators. 2.Rationalize denominators that have a sum or difference.
Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 2.2, Slide 1 CHAPTER 2 Set Theory.
Copyright © 2012 Pearson Education, Inc. Publishing as Addison Wesley CHAPTER 8: Sequences, Series, and Combinatorics 8.1 Sequences and Series 8.2 Arithmetic.
Section 6.3. Section Summary Permutations Combinations.
Section 1.2 Functions and Graphs.
Chapter 10 Counting Methods.
MATH 2311 Section 2.1.
Permutations and Combinations
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Sequences, Series, and Probability
Differential Equations
12.2 Permutations and Combinations
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Lial/Hungerford/Holcomb: Mathematics with Applications 10e
Exponents, Polynomials, and Polynomial Functions
Copyright 2012, 2008, 2004, 2000 Pearson Education, Inc.
Section 11.1 Sequences and Series
Permutations and Combinations
Permutations and Combinations
Introduction to Polynomials
Applications of Matrices
Solving Equations and Inequalities with Absolute Value
Nonlinear Functions, Conic Sections, and Nonlinear Systems
Differential Equations
Combinations.
Chapter 10 Counting Methods.
Lial/Hungerford/Holcomb: Mathematics with Applications 10e Finite Mathematics with Applications 10e Copyright ©2011 Pearson Education, Inc. All right.
Chapter 16 Random Variables Copyright © 2009 Pearson Education, Inc.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
9.6 Counting Theory Example If there are 3 roads from Albany to Baker
Techniques of Integration
Applied Combinatorics, 4th Ed. Alan Tucker
Section 10.5 The Dot Product
Basic Matrix Operations
Copyright ©2015 Pearson Education, Inc. All right reserved.
Chapter 11: Further Topics in Algebra
Permutations and Combinations
Section 11.7 The Binomial Theorem
9.1 Basic Combinatorics.
2.2 Simplifying Expressions
Presentation transcript:

Combinatorics: Combinations Section 11.6 Combinatorics: Combinations Copyright ©2013, 2009, 2006, 2005 Pearson Education, Inc.

Objectives Evaluate combination notation and solve related applied problems.

Combinations We sometimes make a selection from a set without regard to order. Such a selection is called a combination.

Example Find all the combinations of 2 letters taken from a set of 3 letters {A, B, C}. Solution: The combinations are {A, B}, {A, C}, and {B, C}. There are 3 combinations of the 3 letters taken 2 at a time.

Definitions Subset: Set A is a subset of set B, denoted A  B, if every element of A is an element of B. Combination: A combination containing k objects is a subset containing k objects. Combination Notation: The number of combinations of n objects taken k at a time is denoted nCk.

Combinations of n Objects Taken k at a Time The total number of combinations of n objects taken k at a time, denoted nCk , is given by

Binomial Coefficient Notation Another kind of notation for nCk is binomial coefficient notation.

Example Evaluate , using forms (1) and (2). Solution: a) By form (1), b) By form (2), The 8 tells where to start. The 3 tells how many factors there are in both the numerator and the denominator and where to start in the denominator.

Subsets of Size k and of Size n  k The number of subsets of size k of a set with n objects is the same as the number of subsets of size n  k. The number of combinations of n objects taken k at a time is the same as the number of combinations of n objects taken n  k at a time.

Example A team manager has 11 students who are qualified to play basketball. How many different 5-person teams can be chosen? Solution: There are 462 different 5-person teams that could be chosen.

Example How many committees can be formed from a group of 8 seniors and 10 juniors if each committee consists of 5 seniors and 6 juniors? Solution: The 5 seniors can be selected in 8C5 ways and the 6 juniors can be selected in 10C6 ways. If we use the fundamental counting principle, it follows that the number of possible committees is