[go: up one dir, main page]

0% found this document useful (0 votes)
67 views19 pages

Counting Techniques: MODULE 1 - Part 1

Uploaded by

Miteigi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
67 views19 pages

Counting Techniques: MODULE 1 - Part 1

Uploaded by

Miteigi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

COUNTING TECHNIQUES

MODULE 1 – Part 1
Probability

 Probability is primarily concerned


with predicting chances, especially
the occurrence of an event.
 Before predictions can be made, you

should first know how to determine


the outcomes of an event.
Experiment

 Any activity of probability


Outcomes

 Results of the experiment


Events

 Subsets of an experiment
 Defined (or desired) set of

outcomes
Example – Tossing a coin

 Experiment – Coin toss

 Outcomes – {Head , Tail}

 Event – The coin shows a


“Head”.
Example – Rolling a die

 Experiment – Roll a die

 Outcomes – {1, 2 , 3 , 4 , 5 , 6}

 Event – The die shows a “2” or a


“5”.
I. Tree Diagram

 Graphic organizer that makes use


of branching connecting lines to
represent a certain relationship
between events.
Example

 You are driving down McArthur Highway


where you encounter two intersections. In
each intersection, there are traffic lights
installed displaying green, red and
yellow lights. How many different
sequences of lights could you encounter
after passing through the two
intersections? Draw a tree diagram.
1st intersection 2nd intersection Outcomes
R RR
R
G RG
There are 9
Y RY sequences of
lights.
R GR
G G GG
Y GY
R YR
Y G YG
Y YY
II. Fundamental Counting Principle
A. Multiplication Rule
If k choices are made in which there are m1
ways for the first choice, m2 for the second choice,
m3 for the third choice and so on, there are

m1 x m2 x m3 x … x mk

number of possible outcomes.


Example

1. When three dice are thrown,


how many different outcomes
are possible?
6 • 6 • 6 = 216 outcomes
Example

2. A four-digit number is
formed using the digits 2, 4, 5, 6
and 9 such that no digit can be
used more than once.
a. How many distinct four-digit
numbers are possible?
5 ∙ 4 ∙ 3 ∙ 2 = 240 distinct 4-digit numbers
Example

2. A four-digit number is
formed using the digits 2, 4, 5, 6
and 9 such that no digit can be
used more than once.
b. How many four-digit numbers
formed are even?
2 ∙ 3 ∙ 4 ∙ 3 = 72 even 4-digit numbers
II. Fundamental Counting Principle
B. Addition Rule
If a choice can be done in m1 and another in m2
ways such that the two choices cannot be made or
do not occur at the same time, then the total number
of possible outcomes is
m1 + m2

These events are known as mutually exclusive events


or disjoint sets.
Example

3. A student, either a junior or senior is to be


chosen as the school’s representative for an
extemporaneous speech contest. If there are
50 juniors and 70 seniors, in how many ways
can the selection be done?
50 + 70 = 120 ways
Semper Gratus

You might also like