Lecture 3

B.
TECH SECOND YEAR

ACADEMIC YEAR: 2020-2021
COURSE NAME: ENGINEERING MATHEMATICS-IV

COURSE CODE : MA 2201
LECTURE SERIES NO : 03 (THREE)
CREDITS : 03
MODE OF DELIVERY : ONLINE (POWER POINT PRESENTATION)
FACULTY : DR ANAMIKA JAIN
EMAIL-ID : anamika.jain@Jaipur.manipal.edu
PROPOSED DATE OF DELIVERY: 15 February 2021
SESSION OUTCOME LEARN ABOUT THE
CONCEPT OF PROBABILITY
BASIC
ASSIGNMENT
QUIZ
MID TERM EXAMINATION –I
& II ASSESSMENT CRITERIA'S
END TERM EXAMINATION
PROGRAM
OUTCOMES
MAPPING WITH
CO1
 Engineering Knowledge: Apply the knowledge of

mathematics, science, engineering fundamentals,
and an engineering specialization to the solution of
complex engineering problems.
PROBABILITY THEORY
Basics
Probability theory deals with the study of random phenomena, which under
repeated experiments yield different outcomes that have certain underlying
patterns about them. The notion of an experiment assumes a set of repeatable
conditions that allow any number of identical repetitions. When an experiment
is performed under these conditions, certain elementary events occur in
different but completely uncertain ways. We can assign nonnegative number as
the probability of the event in various ways:
Laplace’s Classical Definition: The Probability of an event A is defined a-
priori without actual experimentation as
(1-1)
provided all these outcomes are equally likely.

Consider a box with n white and m red balls. In this case, there are two
elementary outcomes: white ball or red ball. Probability of “selecting a white
ball”
We can use above classical definition to determine the probability that a
given number is divisible by a prime p.
If p is a prime number, then every pth number (starting with p) is divisible by
p. Thus among p consecutive integers there is one favorable outcome, and
hence
(1-2)
Relative Frequency Definition: The probability of an event A is defined as

(1-3)
where nA is the number of occurrences of A and n is the total number of trials.

We can use the relative frequency definition to derive (1-2) as well. To do this
we argue that among the integers
the numbers are divisible by p.
Thus there are n/p such numbers between 1 and n. Hence
(1-4)
In a similar manner, it follows that
(1-5)
and
(1-6)
The axiomatic approach to probability, due to Kolmogorov, developed

through a set of axioms (below) is generally recognized as superior to the
above definitions, (1-1) and (1-3), as it provides a solid foundation for
complicated applications.
The totality of all known a priori, constitutes a set , the set of all
experimental outcomes.
(1-7)
W has subsets Recall that if A is a subset of , then

implies From A and B, we can generate other related subsets
etc.
and (1-8)
A B A B A
• If the empty set, then A and B are said to be mutually

exclusive (M.E).
• A partition of  is a collection of mutually exclusive subsets of  such
that their union is .
(1-9)
A B
De-Morgan’s Laws:
(1-10)
A B A B A B A B
• Often it is meaningful to talk about at least some of the subsets of  as

events, for which we must have mechanism to compute their
probabilities.
Example 1.1: Consider the experiment where two coins are
simultaneously tossed. The various elementary events are
and
The subset is the same as “Head has occurred at

least once” and qualifies as an event.
Suppose two subsets A and B are both events, then consider
“Does an outcome belong to A or B”
“Does an outcome belong to A and B”
“Does an outcome fall outside A”?
Axioms of Probability
For any event A, we assign a number P(A), called the probability of the
event A. This number satisfies the following three conditions that act the
axioms of probability.
(1-12)
(Note that (iii) states that if A and B are mutually exclusive (M.E.)
events, the probability of their union is the sum of their probabilities.)
The following conclusions follow from these axioms:
a. Since we have using (ii)
But and using (iii),

(1-13)
b. Similarly, for any A,

Hence it follows that
But and thus (1-14)
c. Suppose A and B are not mutually exclusive (M.E.)?
How does one compute
To compute the above probability, we should re-express in terms of
M.E. sets so that we can make use of the probability axioms. From Fig. we
have (1-15)
where A and are clearly M.E. events. A
Thus using axiom (1-12-iii)
(1-16)
(1-17)
To compute we can express B as

Thus (1-18)
since and are M.E. events.
(1-19)
From (1-19), (1-20)
and using (1-19) in (1-16)

17
18
19
20
21
22
23
24
25
26
27

Lecture 3

Uploaded by

Copyright:

Available Formats

Lecture 3

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture 3

Uploaded by

Copyright:

Available Formats

B.

TECH SECOND YEAR

COURSE NAME: ENGINEERING MATHEMATICS-IV

 Engineering Knowledge: Apply the knowledge of

provided all these outcomes are equally likely.

Relative Frequency Definition: The probability of an event A is defined as

where nA is the number of occurrences of A and n is the total number of trials.

In a similar manner, it follows that

The axiomatic approach to probability, due to Kolmogorov, developed

W has subsets Recall that if A is a subset of , then

• If the empty set, then A and B are said to be mutually

• Often it is meaningful to talk about at least some of the subsets of  as

The subset is the same as “Head has occurred at

But and using (iii),

b. Similarly, for any A,

where A and are clearly M.E. events. A

Thus using axiom (1-12-iii)

To compute we can express B as

From (1-19), (1-20)

and using (1-19) in (1-16)

You might also like

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