6.3 Probabilities Using Counting TechniquesThis is a featured page

In a number of different situations, it is not easy to determine the outcomes of an event by counting them individually. Alternatively, counting techniques that involve permutations and combinations are helpful when calculating theoretical probabilities.

This section will examine methods for determining theoretical probabilities of successive or multiple events.

Permutation? or Combination?

The following flow chart will help determine which formula is suitable for any given question. By simply following a series of "yes" or "no" questions, the appropriate formula can be determined.
Flow

Ex. 1 - Using Permutations:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
The specific outcome of Mike starting in lane 1 and the other two starting in lane 2 and lane
3 can only happen one way, so n(A) = 1. Therefore,

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
The probability that Mike will start in the first lane next to his other brothers in lane 2 and 3 is
approximately 0.00101.

Ex. 1(a) - Using Permutations:

Exactly Three People form a line at a grocery store. What is the probability that they will line up in descending order of age? (I.e. oldest, middle and youngest)

Solution using the blank like method:

n(A): # of ways they will line up in descending order of age, thus:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG

n(S): # of ways all three can line up in any order, thus:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG

To calculate the probability that the three people will line up in descending order is:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG

Ex. 2 - Using Combinations:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
However, the group may consist of any 3 members from the group of 13. Thus, n(S) is the total
number of possible outcomes.

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
The probability of selecting a group consisting of runners only is:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
Therefore, the probability of selecting a committee with 3 runners is approximately 0.03497.

b) Either the committee is comprised of runners only, or it isn't. Therefore, the probability of the complement A, P(A'), gives the desired result.

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
So the probability of selecting a committee not comprised of runners is approximately 0.96503.

Ex. 2(b) – Using Combinations:

A group of 12 people is going out town on Saturday night. The group will take three cars with four people in each car. If they distribute themselves among the cars at random, what is the probability that Chantal and Rafael will be in the same car? (*note: f#: friend)

Solution using the blank line method:

n(A):# of ways Chantal and Rafael will be in the same car, thus:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
n(S):# of ways Chantal and Rafael will be in any one of the three cars, thus:

6.3 Probabilities Using Counting Techniques - MDM4U1@FMG


6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG

Ex. 3 - Using the Fundamental Counting Principle:
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
For the third employee, since there are 363 ways this person can have a different birthday from
the other two, the probability that all three employees have different birthdays is:
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
Now continue the process with the 12 people in the office:
6.3 Probabilities Using Counting Techniques - MDM4U1@FMG
The probability that at least two people in the office have the same birthday is approximately
0.167.

Key Concepts:

  • In probability experiments with many possible outcomes, you can apply the fundamental
counting principle and techniques using permutations and combinations.

  • Permutations are useful when order is important in the outcomes; combinations are
useful when order is not important.

References:

“Gliffy: BETA.” Gliffy. San Francisco, California, 2005. 18 Dec 2006.
<http://Gliffy.com/>.

Wgman, Diane. Mathematics of Data Management. Toronto: McGraw-Hill Ryerson, 2002.



Humza_89
Humza_89
Latest page update: made by Humza_89 , May 18 2007, 9:49 PM EDT (about this update About This Update Humza_89 Edited by Humza_89


view changes

- complete history)
More Info: links to this page
Started By Thread Subject Replies Last Post
Anonymous alia 0 Sunday, 8:17 AM EST by Anonymous
 
Thread started: Sunday, 8:17 AM EST  Watch
kusc dhang ka b rakha kro
1  out of 1 found this valuable. Do you?    
Anonymous :>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>))))))))))))))))) 1 Oct 22 2009, 10:34 PM EDT by Anonymous
 
Thread started: Oct 18 2009, 3:41 AM EDT  Watch
probability ki ma ki ankh
1  out of 2 found this valuable. Do you?    
Show Last Reply
Anonymous masteers 0 May 22 2009, 5:12 AM EDT by Anonymous
 
Thread started: May 22 2009, 5:12 AM EDT  Watch
keep up the good work in the field of business
2  out of 2 found this valuable. Do you?    
Keyword tags: wise (edit keyword tags)

Anonymous  (Get credit for your thread)


Showing 3 of 5 threads for this page - view all

Related Content

  (what's this?Related ContentThanks to keyword tags, links to related pages and threads are added to the bottom of your pages. Up to 15 links are shown, determined by matching tags and by how recently the content was updated; keeping the most current at the top. Share your feedback on Wetpaint Central.)