Scribd
Upload
269 views5 pages

Chapter 6 Statistics

- There are three main counting techniques: fundamental principle of counting, permutation, and combination. - The fundamental principle of counting uses multiplication to calculate the total number of outcomes when completing multiple independent tasks. Permutation considers order, while combination does not. - Examples show how to use each technique to count outcomes like arranging books on a shelf or forming student committees. Factorials and restrictions like subject groups are also covered.

Uploaded by

hyarojasguli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
269 views5 pages

Chapter 6 Statistics

- There are three main counting techniques: fundamental principle of counting, permutation, and combination. - The fundamental principle of counting uses multiplication to calculate the total number of outcomes when completing multiple independent tasks. Permutation considers order, while combination does not. - Examples show how to use each technique to count outcomes like arranging books on a shelf or forming student committees. Factorials and restrictions like subject groups are also covered.

Uploaded by

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

INTRODUCTION

- 3 counting techniques that will provide us


with the basic foundation in the study of
probability.

Note: The total outcomes could also be


generate with the Fundamental Counting
Principle: 2 2 2 = 8.

- A working knowledge of probability is


fundamental in inferential statistics.
- The most popular methods of counting
techniques are the fundamental principle of
counting, the permutation and the
combination
THE FUNDAMENTAL PRINCIPLE OF
COUNTING
- the multiplication rule
Tree diagram -a diagram used to illustrate
the number of ways several related tasks can
be performed.
*But it is too taxing, laborious and time
consuming. While it may be easier to use the
enumeration method for fewer possible
outcomes, it is of course non manageable
for a larger number of possibilities.
TO AVOID THIS APPLY A COUNTING
TECHNIQUE KNOWN AS THE
FUNDAMENTAL PRINCIPLE OF COUNTING
EXAMPLE:
A tree diagram can be created to show there
are 8 three letter outcomes using the letters
B and C. The tree below could be shows that
6 outcomes contain a C in the first 2
positions.

- States that :
If the first event can be done in any of n 1
ways, and if this event has happened, the
second event can be done in n2 ways, then
the total number of ways in which both
events can be done in n1 x n2 different ways

Thus in symbols, we have:


No. of ways = n1 x n2
The above formula for fundamental principle
of counting also applies to cases with more
than 2 events . Thus, the formula for multiple
events shall be:
No. of ways = n1 x n2 x n3. x nk
EXAMPLE The task of choosing essay topics
has two stages: choosing an essay from
topics A, B, and C and choosing an essay
from topics 1, 2, 3, and 4.
The total number of ways of selecting the
two essays is the product of the choices
available at each of the two stages.
Number of ways = 3 4
= 12
The student can select the two essays 12
ways.
FACTORIAL
The factorial of ay integer n is denoted by n!
and is defined as:
n! = n(n-1)(n-2)., 1
O! is defined = 1

The value of n! which may be read factorial n


or the factorial of n, is obtained by
multiplying all the integers from 1 to n
EXAMPLE:
6! = 6x5x4x3x2x1 = 720
*Note that the value of the factorial of any
integer can be obtained through the use of a
scientific calculator. Press the key
corresponding to the integer then the shift
key for the factorial.

- is another counting technique that is used


in solving statistical problems, not only those
related to counting, but also those pertaining
to probability and inferential statistics.
- arrangement of n different objects with
consideration given to the order of the
objects.
The number of permutations of n different
objects taken r at a time is denoted and
defined as follows

nPr=

n!
n ! n!
= = =n !
( nn ) ! 0 ! 1

The value of a permutation can also be found


by using a scientific calculator, as follows:
Press the integer for n, the shift nPr key and
then the integer for r.
EXAMPLE1: Alexa has 3 different math
books and 4 different geography books.
Determine the number of ways all 7 books
can be arranged on the shelf if

the books in the same subject must be


kept together

P7 = 7!

P7 = 7x6x5x4x3x2x1 = 5040

All seven books can be arranged 5040 ways.


THE MATH BOOKS ARE ON THE LEFT AND
THE GEOGRAPHY BOOKS ARE ON THE RIGHT
There are two stages in this problem. You
must arrange the math books first, then
arrange the geography books on the right.
The number of ways of arranging the math
books is 3!.
The number of ways of arranging the
geography books is 4!.
Using the Fundamental Counting Principle,

n!
( nr ) !

Similarly, the number of permutations of n


objects taken n at a time is:

nPn=

the math books are on the left and the


geography books are on the right

THERE ARE NO RESTRICTIONS


Use the formula for nPn.
Because all 7 books are being arranged, n =
7.
nPn = n!

PERMUTATION

there are no restrictions

There are 144 ways to arrange the math


books followed by the geography books.
THE BOOKS IN THE SAME SUBJECT MUST BE
KEPT TOGETHER
This problem is the same as the previous,
except that either the math books or the
geography books can be on the left.
Therefore, you must multiply the answer to
question b. by 2!.

There are 288 ways to arrange the seven


books so the subjects are kept together.

Where r1, r2,..rk stand for the number of


alike objects

EXAMPLE2:
In a beauty contest 3 special prizes are at
staked to 5 contestants. If each of the
contestants is qualified to win all the 3
special prizes, in how many ways can this be
done?
P = nr
= 5 3 = 125 ways

EXAMPLE: Determine the number of


distinguishable arrangements for each of the
following words.

CIRCULAR PERMUTATION
- when objects are arranged in a circle, the
counting technique used to find the number
of permutations is called circular
permutation.

In the word SASKATOON, there are two Ss,


two As, and two Os. There are nine letters
altogether.

To determine the number of circular


permutations, we shall consider one object
fixed and calculate the number of
arrangements based on the remaining
number of objects left.
The number of circular permutations of n
different objects is defined in symbols by:
P = (n-1)!
EXAMPLE:

a. SASKATOON
b. MISSISSIPPI

In the word MISSISSIPPI, there are four Is,


four Ss, and two Ps. There are 11 letters
altogether.

Calculate the circular


permutations of 7 elements.
PC 7 = (7 1)! = 6! =
6 5 4 3 2 1 = 720
How many ways can eight people
sit around a round table?

COMBINATION
- we defined permutation as an arrangement
of objects with reference to order. The next
counting technique now that we will study
does not consider the order in the
arrangement of the objects. Such counting
technique is known as combination
- arrangement of objects taken from n
different objects with no reference to order.
Hence, the number of combinations of n
objects taken r at a time is defined as :

nCr=
PERMUTATION OF n WITH ALIKE
OBJECTS
- another type of permutation wherein the n,
some of the r objects are alike, is known as
permutation with alike things. This type of
permutation is defined as :

P=

n!
r1 ! x r2 ! x rk !

n!
r ! ( nr ) !

EXAMPLE 1 :

There are 1140 different committees that


can be selected
EXAMPLE 2: How many 5 card hands can be made

from a deck of 52 cards?

Without restrictions, there are 1540


committees possible.
b. There are no boys on the committee
Solution
Because there are no boys on the
committee, you must select committee
members from the 12 girls.

There are 2 598 960 different five-card


hands.
EXAMPLE 3:
A Pure Mathematics 30 class has 10 boys
and 12 girls. The teacher wants to form a
committee of 3 students to plan the year-end
picnic. Determine the number of committees
possible if
a. There are no restrictions
Solution

There are 220 possible committees of only


girls.
c. There must be at least one boy on the
committee
Solution
Method 1: Considering All Possible
Cases
Case 1: 1 Boy and 2 Girls
Because there are 10 boys and 12 girls to
choose from, apply the Fundamental
Counting Principle.

Case 2: 2 Boys and 1 Girl


Applying the Fundamental Counting
Principle,

Case 3: 3 Boys

There are 1320 possible committees with at


least one boy.
Method 2: Using an Indirect Approach
From the answer to question a., you know
there are 1540 committees possible when
there are no restrictions. Some of these
committees will be all boys, others will be all
girls, and the rest will be boys and girls. From
the answer to question b., you know there
are 220 committees that consist of only girls.

There are 1320 possible committees with at


least one boy.

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