0% found this document useful (0 votes)
6 views56 pages

Probability and Counting Rules

The document provides an overview of probability and counting rules, including fundamental counting principles, permutations, and combinations. It explains how to determine outcomes in sequences of events, applies multiplication and addition rules, and discusses conditional probability. Examples and problems illustrate the concepts, emphasizing the importance of understanding arrangements and selections in probability calculations.

Uploaded by

dailyarchive959
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)
6 views56 pages

Probability and Counting Rules

The document provides an overview of probability and counting rules, including fundamental counting principles, permutations, and combinations. It explains how to determine outcomes in sequences of events, applies multiplication and addition rules, and discusses conditional probability. Examples and problems illustrate the concepts, emphasizing the importance of understanding arrangements and selections in probability calculations.

Uploaded by

dailyarchive959
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/ 56

PROBABILITY

AND

COUNTING
RULES
Domingo, Angel M.
AC3A-STATSOFT
TABLE OF CONTENTS

OUTCOMES IN A SEQUENCE COMBINATION

PROCESS OF PROBABILITY TYPES

COUNTING RULES DIFFERENCES

PERMUTATION EXAMPLES

Presentation by Angel Domingo 01


LEARNING OBJECTIVES
> Determine the number of outcomes in a sequence of events using
fundamental counting rules.

> Identify the process of probability and counting rules.

> Define permutation and combination.

> Enumerate the types of permutation and combination with


examples.

Presentation by Angel Domingo 02


NUMBER OF OUTCOMES IN A
SEQUENCE OF EVENTS

To determine the number of outcomes in a sequence of events using


the fundamental counting rule, multiply the number of outcomes for
each individual event together. For example, if event A has 2 outcomes,
event B has 3 outcomes, and event C has 2 outcomes, the total number
of outcomes in the sequence is 2 * 3 * 2 = 12.

Presentation by Angel Domingo 03


NUMBER OF OUTCOMES IN A
SEQUENCE OF EVENTS

If you have a series of choices, and each choice has a certain


number of options, you multiply the number of options for each
choice to find the total number of possible combinations.

Presentation by Angel Domingo 04


NUMBER OF OUTCOMES IN A
SEQUENCE OF EVENTS
The fundamental counting rule only applies to independent events,
meaning the outcome of one event doesn't affect the outcome of the
other.
The order in which the events occur matters when using this rule, as
different orders will be considered distinct outcomes.

Presentation by Angel Domingo 05


COUNTING RULES

Probability is primarily concerned with predicting


chances especially the occurrence of an event, before
the predictions can be made, you should first know,
how to determine

Presentation by Angel Domingo 06


COUNTING TECHNIQUE

In some cases, the number of outcomes is very small


that you can determine it by systematic listening.
However, there are also cases when the situation
becomes complex and you need to employ more
organized strategy to determine the number of possible
outcomes

Presentation by Angel Domingo 07


COUNTING RULES

Any probability activity is called an EXPERIMENT


that gives result which are known as OUTCOMES.

Presentation by Angel Domingo 08


TREE DIAGRAM

It is a graphic organizer that makes use of branching


connecting lines to represent a certain relationship
between events.

Presentation by Angel Domingo 09


TREE DIAGRAM

Presentation by Angel Domingo 10


FUNDAMENTAL COUNTING PRINCIPLE

While the tree diagram could be a helpful way to


organize the counting of the possible outcomes in an
experiment, it might prove to inconvenient especially
when many variables are considered in the process.

Presentation by Angel Domingo 11


FUNDAMENTAL COUNTING PRINCIPLE

Connectives provide clues in determining the operation


utilized in solving word problems involving counting
techniques. The connective “ and “ indicates a
multiplication operation while the connective “ or “
indicates an addition operation.

Presentation by Angel Domingo 12


MULTIPLICATION RULE

If an action can be done in m ways, and for each


way, a second action can be done in n ways,
then the two ways can be done in mn ways. It
can be extended to cover actions performed in
more than two ways

Presentation by Angel Domingo 13


EXAMPLE
Multiplication Rule

When three dices are thrown, how many


different outcomes are possible?

Presentation by Angel Domingo 14


EXAMPLES
Multiplication Rule

Solution:

Since there 6 possible outcomes for each


dice, then thrown 3 dice the total number
of outcomes, as given by the general
counting principle is 6 x 6 x 6 =216
Presentation by Angel Domingo 15
PROBLEM
Multiplication Rule

A four-digit number can be formed using the


digits 2, 4, 5, 6, and 9 such that no digit can be
used more than once. How many distinct four-
digit numbers can be formed?

Presentation by Angel Domingo 16


PROBLEM
Multiplication Rule

Lovely tossed a coin three times, how many


outcomes are possible?

Presentation by Angel Domingo 17


PROBLEM
Multiplication Rule

Emily plans to have pasta and pizza for a main


course. If there are 7 different pizzas available
and 5 different pastas available, how many
meal choices does Emily have?

Presentation by Angel Domingo 18


ADDITION RULE
The addition rule in probability is used to
calculate the probability of two or more
events happening, either individually or
in combination.

Presentation by Angel Domingo 19


ADDITION RULE

If you are drawing a card from a


standard deck of 52 cards, what is the
probability of drawing either a heart or
a queen?

Presentation by Angel Domingo 20


ADDITION RULE

P(Heart): 13/52 = 1/4 (13 hearts in a


deck)
P(Queen): 4/52 = 1/13 (4 queens in a
deck)
P(Heart and Queen): 1/52 (one card is
both a heart and a queen, the Queen
of Hearts)
Presentation by Angel Domingo 21
ADDITION RULE

Applying the addition rule:


P(Heart or Queen) = P(Heart) + P(Queen)
- P(Heart and Queen)
P(Heart or Queen) = 1/4 + 1/13 - 1/52
P(Heart or Queen) = 13/52 + 4/52 - 1/52 =
16/52 = 4/13

Presentation by Angel Domingo 22


EXAMPLE
Addition Rule

At a local language school, 40% of the students


are learning Spanish, 20% of the students are
learning German, and 8% of the students are
learning both Spanish and German. What is the
probability that a randomly selected student is
learning Spanish or German?

Presentation by Angel Domingo 23


EXAMPLES
Addition Rule

P(Spanish or German) = P(S) + P(G) - P(S and G)

= 0.4 + 0.2 - 0.08

= 0.52

Presentation by Angel Domingo 24


PROBLEM
Addition Rule

There are 50 students enrolled in the second year of a


business degree program. During this semester, the students
have to take some elective courses. 18 students decide to take
an elective in psychology, 27 students decide to take an
elective in philosophy, and 10 students decide to take an
elective in both psychology and philosophy. What is the
probability that a student takes an elective in psychology or
philosophy?
Presentation by Angel Domingo 25
PROBLEM
Addition Rule

At a local basketball game, 70% of the fans are cheering for the
home team, 25% of the fans are wearing blue, and 12% of the
fans are cheering for the home team and wearing blue. What
is the probability that a randomly selected fan is cheering for
the home team or wearing blue?

Presentation by Angel Domingo 26


PROBABILITY

Probability is a numerical expression of the


likelihood of an event occurring, ranging from 0
(impossible) to 1 (certain). It's calculated by
dividing the number of favorable outcomes by the
total number of possible outcomes.

Presentation by Angel Domingo 27


PROBABILITY

The process of calculating probability involves


identifying the sample space (all possible
outcomes), defining the event of interest, and
then determining the probability based on the
number of outcomes within that event.

Presentation by Angel Domingo 28


PROBABILITY

Sample Space:

This involves listing all possible outcomes of an


event or experiment. For example, when flipping a
coin, the sample space is {Heads, Tails}.

Presentation by Angel Domingo 29


PROBABILITY

Event of Interest:

Identify the specific outcome or set of outcomes


you're interested in. For instance, when flipping a
coin, the event of interest could be getting
"Heads".

Presentation by Angel Domingo 30


PROBABILITY

Basic Probability:

Probability is calculated as the ratio of the number


of favorable outcomes to the total number of
possible outcomes. For the coin flip example, the
probability of getting Heads is 1 (favorable
outcome) / 2 (total outcomes) = 0.5.

Presentation by Angel Domingo 31


PROBABILITY

Conditional Probability:

If the outcome of one event influences the


outcome of another, conditional probability
accounts for that influence. The probability of
event A given that event B has occurred is
denoted as P(A|B).

Presentation by Angel Domingo 32


PROBABILITY

Interpret the Result:

A probability value of 0 indicates the event is


impossible, while a value of 1 indicates the event is
certain. Values between 0 and 1 represent the
likelihood of the event occurring.

Presentation by Angel Domingo 33


PERMUTATION

A permutation is an arrangement of objects in a


definite order. The members or elements of sets
are arranged here in a sequence or linear order.
For example, the permutation of set A={1,6} is 2,
such as {1,6}, {6,1}. As you can see, there are no
other ways to arrange the elements of set A.

Presentation by Angel Domingo 34


PERMUTATION

Permutations with Repetition:

In this type, elements can be repeated in the


arrangement. For example, in the word "AAAB," the
letter "A" can appear multiple times.

Presentation by Angel Domingo 35


PERMUTATION

Permutations without Repetition:

Here, each element can appear only once in the


arrangement. For instance, arranging the letters
"ABC" without repetition would result in
arrangements like "ABC", "BAC", etc., but not "AAB".

Presentation by Angel Domingo 36


PERMUTATION
Permutations of Multisets:

These involve arrangements where elements are


not necessarily distinct, and some elements may
appear more than once. For example, arranging
the letters in "MISSISSIPPI" would involve dealing
with the repeated occurrences of "I", "S", and "P".

Presentation by Angel Domingo 37


PERMUTATION

Circular Permutations:

These involve arranging elements in a circular


order, where the starting point is not fixed. For
example, arranging people around a circular table.

Presentation by Angel Domingo 38


PERMUTATION

Alternating Permutations:

These are permutations where the elements are


arranged in an alternating sequence of increasing
and decreasing order. For example, 132 and 231 are
alternating permutations of {1, 2, 3}.

Presentation by Angel Domingo 39


PERMUTATION
FORMULA:

nPr = n!
( n - r)!

or

P(n,r) = n! ÷ (n-r)!
Presentation by Angel Domingo 40
PERMUTATION
Examples:

1.)In how many ways can seven books be arranged


on a shelf?
2.)In how many different ways can the letters of
the word THOUGHTS be arranged so that the
vowels always come together?

Presentation by Angel Domingo 41


PERMUTATION
Solution:
Number of ways in which the first book can be
placed = 7
Number of ways in which the second book can be
placed = 6
Similarly,
The total number of ways in which seven books
can be arranged on a shelf = 7 × 6 × 5 × 4 × 3 × 2 × 1
(i.e., 7!)
= 5040
Presentation by Angel Domingo 42
PERMUTATION
Solution: 2
Given word: THOUGHTS
Number of letters = 8
T’s = 2
H’s = 2
Number of vowels = 2 (O, U)
Vowels should come together.
So, the number of letters for arrangement = 7
i.e., (OU)THGHTS

Presentation by Angel Domingo 43


PERMUTATION

Number of arrangements = 7!
And two vowels can be arranged in 2! ways.
Therefore, the total number of ways of
arrangements = (7! × 2!)/(2! 2!)
= 7!/2!
= (7 × 6 × 5 × 4 × 3 × 2!)/2!

= 2520

Presentation by Angel Domingo 44


COMBINATION

In mathematics, a combination is a way of


selecting items from a set where the order of
selection does not matter. It's a selection or
grouping of objects without regard to the order in
which they are chosen.

Presentation by Angel Domingo 45


COMBINATION
Combinations With Repetition:

This type allows an object to be chosen multiple


times within a selection. For instance, choosing 3
balls from a bag containing 1 red, 1 blue, and 1
green ball, where you can choose the same color
multiple times (e.g., 2 red balls and 1 green ball).
Presentation by Angel Domingo 46
COMBINATION
Combinations Without Repetition:

This type involves selecting objects from a set


where each object can be chosen only once. For
example, choosing 3 students from a class of 10 to
form a team, where the order of selection doesn't
matter (student A, B, and C is the same as student
B, A, and C).
Presentation by Angel Domingo 47
COMBINATION

Selection, not Arrangement:

Combinations focus on the selection of a certain


number of items from a set, without considering
the order in which those items are selected.

Presentation by Angel Domingo 48


COMBINATION

Formula:

The number of combinations of choosing r items


from a set of n items is often denoted as "nCr" or
"n choose r" and can be calculated using the
formula: nCr = n! / (r! * (n-r)!).
Presentation by Angel Domingo 49
COMBINATION

Examples:

If there are 10 multiple-choice questions on an


exam, each having 3 possible answers, how many
different possibilities are there for sequences
ofcorrect answers?
Presentation by Angel Domingo 50
COMBINATION

Solution:

3 to the 10 power or
th

3x3x3x3x3x3x3x3x3x3
= 59, 049

Presentation by Angel Domingo 51


COMBINATION

Problem:

A brand of women’s jeans can be ordered in seven different


sizes, 3 different colors and 3 different styles. How many jeans
have to be ordered ifthe store wants to have one pair of each
type?

Presentation by Angel Domingo 52


COMBINATION

Problem:

A gardener has 6 rows in his garden available for 6 different


vegetables.If each vegetable gets one row, how many different
ways are there to position the vegetables in the garden?

Presentation by Angel Domingo 53


COMBINATION

Problem:

The Quinella consists of picking the horses that will place first
or secondregardless of order. If 8 horses are entered in a race,
how many winningcombinations are there?

Presentation by Angel Domingo 54


THANK YOU
PROBABILITY AND COUNTING RULES

Angel Domingo
domingoangelmea@icloud.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy