Scribd
Upload
16 views

Lec 8

This document contains a statistics and probability lecture on counting techniques including multiplication, permutations, and combinations. It begins with examples of using multiplication to count outcomes of multi-stage experiments. It then discusses permutations as arrangements that consider order, and gives examples of counting permutations of objects and positions. Finally, it discusses combinations as selections where order does not matter, and provides examples of counting combinations of objects picked from a larger set.

Uploaded by

medo2012aldulaimi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Lec 8

This document contains a statistics and probability lecture on counting techniques including multiplication, permutations, and combinations. It begins with examples of using multiplication to count outcomes of multi-stage experiments. It then discusses permutations as arrangements that consider order, and gives examples of counting permutations of objects and positions. Finally, it discusses combinations as selections where order does not matter, and provides examples of counting combinations of objects picked from a larger set.

Uploaded by

medo2012aldulaimi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Statistics & Probability ALMUSTAQBAL UNIVERSITY

st
Dept. of Cyber Security 1 Class 2023-2024
M.SC. Suha Alhussieny LEC .8

Counting techniques
In the previous lesson, we learned that the classical approach to assigning
probability to an event involves determining the number of elements in the
event and the sample space. There are many situations in which it would be
too difficult and/or too tedious to list all of the possible outcomes in a sample
space. when the sample space or event space are very large, that it isn’t
feasible to write it out. In that case, it helps to have mathematical tools for
counting the size of the sample space and event space. These tools are known
as counting techniques.

1-The multiplication
If an experiment takes place in k stages with ni possible outcomes at stage i,
the total number of possible outcomes is n1⋅n2⋅⋯⋅nk

Example 1: Suppose a password had to be chosen according to strict rules: a


lower-case letter first, a digit second, an upper-case letter third. How many
ways are there to do this?
solution:
There are 26 lower-case letters, 10 digits, and 26 upper-case letters so the
number of such passwords would be 26*10*26 = 6760.

Example 2: A restaurant offers 3 choices for appetizer, 2 for main course, and
5 for dessert. How many meal variations are possible if a diner chooses 1 of
each?

1
solution:
There are 3 × 2 × 5 = 30 different meal variations.

Example 3: How many ways are there to create a 4 digit PIN?


solution:
This is an experiment in 4 stages. At each stage there are 10 possible
outcomes (the digits 0, 1, ..., 9) thus there are
10⋅10⋅10⋅10=10,000 possible outcomes for the entire experiment.

Example 4:

2
2- Permutations
The word ‘permutations’ means ‘arrangements’. We use it to refer to the
number of ways of arranging a set of objects. In other words, we use
permutations when we are concerned about ‘order’.

 Permutation of n objects
an ordered arrangement of the n objects

3
We often call such a permutation a “permutation of n objects
taken n at a time,” .

Factorial, written n!
n!=n⋅(n−1)⋅(n−2)⋯2⋅1
 Permutation of n objects taken r at a time
ordered arrangement of different objects in positions. The
number of such permutations is:

Example 1: Permutation for Orchestra Programs


The school orchestra is planning to play six pieces of music at their next
concert. How many different programs are possible?
Solution:

6! = 6*5*4*3*2*1= 720

4
Example 2: Permutation for Race Cars
Assume that 10 cars are in a race. In how many ways can three cars finish in
first, second and third place?

Solution

Example 3: Permutation for Club Officers


The Volunteer Club has 18 members. An election is held to choose a
president, vice-president and secretary. In how many ways can the three
officers be chosen?

Solution
The order in which the officers are chosen matters so this is a permutation.

3- Combinations
Combinations is a technical term meaning ‘selections’. We use it to refer to
the number of different sets of a certain size that can be selected from a larger
collection of object where order does not matter.

A combination is a selection of objects in which the order of selection


does not matter. The number of combinations of n items taking r at a time is:

5
Example 1 : Combination for Picking Books
A student has a summer reading list of eight books. The student must read five
of the books before the end of the summer. In how many ways can the student
read five of the eight books?

Solution
The order of the books is not important, only which books are read. This is a
combination of eight items taking five at a time.

Example 2 : Combination for Halloween Candy


A child wants to pick three pieces of Halloween candy to take in her school
lunch box. If there are 13 pieces of candy to choose from, how many ways can
she pick the three pieces?
Solution
This is a combination because it does not matter in what order the candy is
chosen.

6
Example 3: Permutation or Combination for Choosing Men and Women
A class consists of 15 men and 12 women. In how many ways can two men
and two women be chosen to participate in an in-class activity?
Solution
This is a combination since the order in which the people is chosen is not
important.
Choose two men:

Choose two women:

We want 2 men and 2 women so multiply these results.


105(66)=6930

7
Example 4: Twelve (12) patients are available for use in a research study.
Only seven (7) should be assigned to receive the study treatment. How many
different subsets of seven patients can be selected?

You might also like