STATA 273 CHAPTER 3 – PART ( 1 )

1|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

experiment ( observing / measuring ) outcomes = results sample space S = set of all outcomes events = subset of S

outcomes

If we collect all outcomes  we are forming a sample space

If we collect some of the outcomes  we are forming an event

EX # 01 Flip a balanced coin once. Write the sample space. How many outcomes do we have?

S = { H , T }

2 outcomes

EX # 02 Flip a balanced coin twice. Write the sample space. How many outcomes do we have?

S = { HH , HT , TH , TT }

4 outcomes

EX # 03 Flip a balanced coin three times.

(a) Write the sample space. How many outcomes do we have?

S = { HHH , THH , HTH , HHT , TTH , THT , HTT , TTT }

8 outcomes

(b) Write the outcomes of the events:

A = getting at least two heads. B = getting at most one head.

A = { HHH , THH , HTH , HHT } B = { TTH , THT , HTT , TTT }

EX # 04 How many possible outcomes can be obtained from flipping a balanced coin five times?

2#times = 25 = 32

2|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 05 A collection of cards numbered from 1 through 20. If one card is drawn randomly, then

( 1 ) What is the sample space?

S = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20 }

( 2 ) Write the outcomes of the following events:

A = the card with an even number

A = { 2, 4, 6, 8, 10, 12, 14, 16, 18, 20 }

B = the card with a number divisible by 3

B = { 3, 6, 9, 12, 15, 18 }

C = the card with a number divisible by 4

C = { 4, 8, 12, 16, 20 }

D = the card with a number divisible by 5

D = { 5, 10, 15, 20 }

A  B : A union B ( either A or B ) A  B : A intersection B ( both A and B ) ̅ : A complement ( not A )

𝐀
( 3 ) Find the following outside A

A  B C  D C  𝐃

= { 6, 12, 18 } = { 20 } = { 4, 8, 12, 16, 20, 5, 10, 15 }

̅
𝐃 D  𝐃
̅ D  𝐃
̅

= { 1, 2, 3, 4, 6, 7, 8, 9, = { } = { 5, 10, 15, 20, 1, 2, 3, 4, 6, 7,

11, 12, 13, 14, 16, 17, 18, 19 8, 9, 11, 12, 13, 14, 16, 17, 18, 19
= ∅
} }

mutually exclusive ( disjoint ) events

no intersection

‫اليوجد تقاطع‬

3|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

IN HOW MANY DIFFERENT WAYS CAN WE …? HOW MANY POSSIBILITIES WE HAVE …?

tree diagram multiplication rule

EXAMPLE

In a medical study, patients are classified according to whether they have blood type A, B, AB, and O and according to
whether their blood pressure is low, normal, or high. In how many ways can a patient thus be classified according to blood
type and blood pressure?

Tree diagram:
Following each path from left to right along the
branches of the tree, we have how many possibilities?
low
root branch
normal
branch
high
A
low

B normal

high

low
AB
normal
high
O
low

normal
high

Multiplication Rule: Fundamental Theorem of Counting  Multiplication Rule

𝟒 × 𝟑 = 𝟏𝟐 If a choice consists of K stages, of which the first stage can be made in N1 ways, the
second stage can be made by N2 ways,…., and the last stage can be made of Nk
ways then the whole choice can be made by 𝑵𝟏 × 𝑵𝟐 × … × 𝑵𝒌 ways.

4|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 06 If a test consists of 10 true-false questions, in how many ways can a student answer all questions?

2 2 2 2 2 2 2 2 2 2
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

#questions ‫عدد األسئلة‬

Answer = 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 × 𝟐 = 𝟐𝟏𝟎
Answer = 𝟏𝟎𝟐𝟒
#options ‫عدد اإلختيارات حسب نوع األسئلة‬

EX # 07 A short quiz consists of 7 MCQs, each has 4 options.

(1) In how many ways can a student answer all questions?

Answer = 𝟒𝟕 #questions ‫عدد األسئلة‬

#options ‫عدد اإلختيارات حسب نوع األسئلة‬

Answer = 𝟏𝟔𝟑𝟖𝟒

(2) In how many ways can a student answer all questions correctly?

Answer = 𝟏𝟕 #questions ‫عدد األسئلة‬

# correct options ‫عدد اإلختيارات الصحيحة حسب نوع األسئلة‬

Answer = 𝟏

(3) In how many ways can a student answer all questions wrongly?

Answer = 𝟑𝟕 #questions ‫عدد األسئلة‬

# wrong options ‫عدد اإلختيارات الخاطئة حسب نوع األسئلة‬

Answer = 𝟐𝟏𝟖𝟕

5|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

The factorial is defined for whole number only. Its notation is ( ! )

𝟓! = 𝟓 × 𝟒 × 𝟑 × 𝟐 × 𝟏 = 𝟏𝟐𝟎

𝟒! = 𝟒 × 𝟑 × 𝟐 × 𝟏 = 𝟐𝟒

𝟑! = 𝟑 × 𝟐 × 𝟏 = 𝟔

𝟐! = 𝟐 × 𝟏 = 𝟐

𝟏! = 𝟏 = 𝟏

𝟎! = 𝟏

In how many ways can we select r objects from n different (distinct) objects?

If the order of the selected r objects is important If the order of the selected r objects is not important

permutation combination

𝒏! 𝒏 𝒏!
𝒏𝑷𝒓= 𝒏𝑪𝒓= ( ) = (𝒏−𝒓)! 𝒓!
(𝒏−𝒓)! 𝒓
total selection total selection

permutation combination
𝒏! 𝒏!
𝒏𝑷𝒓 = 𝒏𝑪𝒓 =
(𝒏 − 𝒓)! (𝒏 − 𝒓)! 𝒓!
𝟓! 𝟏𝟐𝟎 𝟓! 𝟏𝟐𝟎 𝟏𝟐𝟎
𝟓𝑷𝟑 = = = 𝟔𝟎 𝟓𝑪𝟑 = = = = 𝟏𝟎
(𝟐)! 𝟐 (𝟑)! 𝟐! 𝟔 × 𝟐 𝟏𝟐

Example: A travel brochure lists 10 museums in London. In how many ways can a tourist visit four museums

(a) If the order in which the museums are visited does not matter?  𝟏𝟎C𝟒 = 𝟐𝟏𝟎

(b) If the order in which the museums are visited does matter?  𝟏𝟎P𝟒 = 𝟓𝟎𝟒𝟎
IMPORTANT

permutation combination
 race  Selecting objects from a box / carton / jar
𝑛𝑃𝑛 = 𝑛!
 winner  Forming a group / committee
 schedule  Selecting courses
 arrangement
 letter sequences
𝑛 𝑛
𝑛𝐶𝑛 = 1 and ( ) = ( )
 first, second, third, … 𝑟 𝑛−𝑟

6|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 0 8 Find the number of ways of selecting two courses from eight courses listed in the mathematics department.

𝟖C𝟐 = 𝟐𝟖

EX # 0 9 A student committee must consist of 3 juniors and 4 seniors. If 7 juniors and 8 seniors are willing to serve on the
committee, then in how many ways can the committee be selected?

𝟕C𝟑 and 𝟖C𝟒

𝟕C𝟑 × 𝟖C𝟒
𝟑𝟓 × 𝟕𝟎
2450

EX # 10 To fill a number of vacancies, the personnel manager of a company has to choose 3 secretaries from among 10
applicants and 2 bookkeepers from among 4 applicants. In how many ways can he fill the five vacancies?

𝟏𝟎C𝟑 and 𝟒C𝟐

𝟏𝟎C𝟑 × 𝟒C𝟐
𝟏𝟐𝟎 × 𝟔
720

EX # 11 In how many ways can we choose the first and second winners from 10 participants in a car race?

𝟏𝟎P𝟐 = 𝟗𝟎

EX # 12 Five different books, of which three are in English and two in Arabic.
 In how many different ways the five books can be arranged on a shelf in a row?

𝟓P𝟓 = 𝟓! = 𝟏𝟐𝟎

 In how many different ways the five books can be arranged on a shelf in a row
such that the Arabic books are put together and the English books are put together?

OR

𝟑! × 𝟐! OR 𝟐! × 𝟑!

𝟏𝟐 + 𝟏𝟐
𝟐𝟒

7|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 13 How many circular permutation are there of five persons playing

bridge?
We arbitrary fix the position of one player and then arrange the other players

(𝟓 − 𝟏)! = 𝟒! = 𝟐𝟒

EX # 14 How many four-letter sequences can be formed using the letters of the word HARMONY?

4 letters  r = 4
7 letters  n = 7

(a) With no repetition of letters?

𝟕P𝟒 = 𝟖𝟒𝟎

(b) With repetition of letters? ‫تكرار األحرف مسموح‬

7 7 7 7
first second third fourth
letter letter letter letter

𝟕 × 7 × 7 × 7 = 𝟕𝟒 = 𝟐𝟒𝟎𝟏

EX # 15 How many permutations can be formed from the letters of the given words?

(a) NICE

𝟒! = 𝟐𝟒
(b) SWEET

SWEET

𝟓! 𝟏𝟐𝟎
= = 𝟔𝟎 Previous Test Question
𝟐! 𝟐

(c) FANTASTIC How many permutations can be formed from the letters of the word
SAWSAN such that two S come together?
FANTASTIC
𝟓! 𝟏𝟐𝟎
𝟗! 𝟑𝟔𝟐𝟖𝟖𝟎 S A W S A N  S S A W A N  = = 𝟔𝟎
= = 𝟗𝟎𝟕𝟐𝟎 𝟐! 𝟐
𝟐! 𝟐! (𝟐)(𝟐)

8|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 16 A box contains 6 red balls and 4 white balls. In how many ways can we choose:

(a) three balls from the box?

10 balls
𝟏𝟎C𝟑 = 𝟏𝟐𝟎

(b) three red balls OR three white balls?

𝟔C𝟑 + 𝟒𝐂𝟑
6 red 4 white
𝟐𝟎 + 𝟑 balls balls
𝟐𝟑

(c) one red ball AND two white balls?

𝟔C𝟏 × 𝟒𝐂𝟐

𝟔 × 𝟔

𝟑𝟔

EX # 17 A carton of 12 transistor batteries contains 4 that are defective. In how many ways can one choose 3 of these
batteries randomly such that:

(a) None of the defective batteries is included. 12 batteries

𝟖C𝟑 = 𝟓𝟔

(b) Exactly one of the defective batteries is included.

8 red 4
one defective and two non-defective non-defective defective
good bad
𝟒C𝟏 × 𝟖𝐂𝟐

𝟒 × 𝟐𝟖

𝟏𝟏𝟐

(c) At most one of the defective batteries is included. ‫ العدد الموجود بالسؤال أو أقل‬ at most

one defective OR zero defective

𝟒C𝟏 × 𝟖𝐂𝟐 OR 𝟒C𝟎 × 𝟖𝐂𝟑

𝟒 × 𝟐𝟖 OR 𝟏 × 𝟓𝟔

𝟏𝟏𝟐 OR 𝟓𝟔
𝟏𝟏𝟐 + 𝟓𝟔

𝟏𝟔𝟖

9|P a g e
STATA 273 CHAPTER 3 – PART ( 1 )

EX # 18 In how many different ways can three tosses of a balanced coin yields two heads?

all possible outcomes are 𝐇𝐇𝐇, 𝐓𝐇𝐇, 𝐇𝐓𝐇, 𝐇𝐇𝐓, 𝐇𝐇𝐇, 𝐓𝐓𝐇, 𝐓𝐇𝐓, 𝐇𝐓𝐓, 𝐓𝐓𝐓
  
 There are 3 ways to get two heads.

number of tosses
3
alternative solution ( )
2
number of heads we want

EX # 19 In how many different ways can a sum < 10 be obtained from rolling two dice once?

6 7 8 9 10 11 12
5 6 7 8 9 10 11
4 5 6 7 8 9 10
3 4 5 6 7 8 9
2 3 4 5 6 7 8
1 2 3 4 5 6 7
1 2 3 4 5 6

EX # 20 In how many different ways can a set of five objects be partitioned

into three subsets containing, respectively, two, two, and one of the objects?

𝟓 𝟓! 𝟏𝟐𝟎
( )= = = 𝟑𝟎
𝟐 𝟐 𝟏 𝟐! ∙ 𝟐! ∙ 𝟏! 𝟐 ∙ 𝟐 ∙ 𝟏

2 1
objects 2 object
objects

10 | P a g e