![]() |
|
![]() |
|||||||||||||||||||||||||
![]() |
![]() |
![]() |
|||||||||||||||||||||||||
![]() |
![]() |
![]() |
![]() |
||||||||||||||||||||||||
Counting Principle
|
![]() |
![]() |
![]() |
![]() |
|||||||||||||||||||||||
![]() |
If one event can occur in m
ways and a second can occur in n ways, the pair of events can occur in mn
ways. Example 1: There are 4 roads from Carleton to Answer: Each
of the 4 roads from Carleton to Example
2: Answer: For
each of the 6 pitchers there are 3 catchers; so there are 18 combinations. Example 3: Answer: If
all questions were answered then there are 10 x 4 = 40 ways; if 2 questions were
unanswered then there are 8 x 4 = 32 ways. Next : Permutation Previous : Probability Scale |
![]() |
![]() |
||||||||||||||||||||||||
![]() |
![]() |
![]() |
|||||||||||||||||||||||||
![]() |
![]() |
![]() |
|||||||||||||||||||||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|||||||||||||||||||||
![]() |
![]() |
||||||||||||||||||||||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|||||||||||||||||||||
![]() |
![]() |
![]() |
![]() |
||||||||||||||||||||||||
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
||||||||||||||||||||||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |