http://www.ck12.orgCHAPTER
2 Conditional Probability
Chapter Outline
2.1 Tree Diagrams
2.2 PERMUTATIONS ANDCOMBINATIONSCOMPARED
2.3 PERMUTATIONPROBLEMS
2.4 PERMUTATIONS WITHREPETITION
2.5 COMBINATIONS
2.6 COMBINATIONPROBLEMS
2.7 CONDITIONALPROBABILITY
Introduction
This chapter builds on the concepts learned in the previous chapter on probability. Starting with tree diagrams as a
means of displaying outcomes for various trials, we will learn how to read the diagrams and find probabilities. We
will also find that order does not matter unless working with permutations. Permutations, such as the combination
of your lock at the gym, require their own special formula. When outcomes for permutations have repetitions, these
repetitions must also be included in the calculations in order to account for the multiple entries. Combinations,
like permutations, also have their own special formula. Combinations, such as the number of teams of 4 that can be
arranged in a class of 15 students, are different from permutations, because the order in combinations is insignificant.
In this chapter, we will also learn about conditional probability. Conditional probability comes into play when the
probability of the second event occurring is dependent on the probability of the first event.