Scribd
Upload
145 views9 pages

Probability Lecture Notes (MSD) 2

These class notes are prepared for the paper: Probability Theory(Paper:5.5) of the 5th semester students according to the Gauhati University Non CBCS syllabus.

Uploaded by

Mriganka
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
145 views9 pages

Probability Lecture Notes (MSD) 2

These class notes are prepared for the paper: Probability Theory(Paper:5.5) of the 5th semester students according to the Gauhati University Non CBCS syllabus.

Uploaded by

Mriganka
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/ 9

LECTURE NOTES

ON PROBABILITY THEORY

Dr. Mriganka Sekhar Dutta


Assistant Professor
Nalbari College
Axio ms of P ro b ab ility

A probability function P assigns a real number (the probability of E )


to every event E in a sample space S.

P (·) must satisfy the following basic properties :

• 0 ≤ P (E) ≤ 1 ,

• P (S) = 1 ,

• For any disjoint events E i , i = 1, 2, · · · , n, we have

P (E 1 ∪ E 2 ∪ · · · ∪ E n ) = P (E 1 ) + P (E 2 ) + · · · P (E n ) .

9
F u r t h e r P ro p e r t i e s

P R O P E RT Y 1 :
c c
P (E ∪ E ) = P ( E) + P (E ) = 1 . ( Why ? )

T hus
P (E c ) = 1 − P ( E) .

EXAMPLE :
What is the probability of at least one ”H” in four tosses of a coin?

S O L U T I O N : The sample space S will have 16 outcomes. (Which?)

1 15 .
P (at least one H) = 1 − P (no H) = 1 − =
16 16

10
P R O P E RT Y 2 :
P (E ∪ F ) = P ( E) + P (F ) − P (EF ) .

PROOF (using the third axiom) :

P (E ∪ F ) = P (EF ) + P (EF c ) + P (E c F )

= [P(EF ) + P (EF c )] + [P (EF ) + P (E c F )] − P (EF )

= P(E) + P(F) - P(EF) . ( Why ? )

NOTE :
• Draw a Venn diagram with E and F to see this !

• The formula is similar to the one for the number of elements :


n(E ∪ F ) = n ( E) + n(F ) − n(EF ) .

11
So far our sample spaces S have been finite.
S can also be countably infinite, e.g., the set Z of all integers.
S can also be uncountable, e.g., the set R of all real numbers.

E X A M P L E : Record the low temperature in Montreal on January


8 in each of a large number of years.
We can take S to be the set of all real numbers, i.e., S = R.
(Are there are other choices of S ?)
What probability would you expect for the following events to have?

(a) P ({π}) (b) P ({x : − π < x < π})

(How does this differ from finite sample spaces?)

We will encounter such infinite sample spaces many times · · ·

12
C o u n t i n g O u t c o me s

We have seen examples where the outcomes in a finite sample space


S are equally likely , i.e., they have the same probability .

Such sample spaces occur quite often.

Computing probabilities then requires counting all outcomes and


counting certain types of outcomes .

The counting has to be done carefully!

We will discuss a number of representative examples in detail.

Concepts that arise include permutations and combinations.

13
Pe r m u t at i o n s

• Here we count of the number of ”words ” that can be formed


from a collection of items (e.g., letters).

• (Also called sequences , vectors , ordered sets .)

• The order of the items in the word is important;


e.g., the word acb is different from the word bac .

• The word length is the number of characters in the word.

NOTE :
For sets the order is not important. For example, t he set {a,c,b} is
the same as the set {b,a,c} .

14
E X A M P L E : Suppose that four-letter words of lower case alpha-
betic characters are generated randomly with equally likely outcomes.
(Assume that letters may appear repeatedly.)

(a) How many four-letter words are there in the sample space S ?
SOLUTION : 264 = 456, 976 .

(b) How many four-letter words are there are there in S that start
with the letter ”s ” ?
SOLUTION : 263 .

(c) What is the probability of generating a four-letter word that


starts with an ”s ” ?
SOLUTION :
263 1
= ∼= 0.038 .
264 26
Could this have been computed more easily?

15
E X A M P L E : How many re-orderings (permutations) are there of
the string abc ? (Here letters may appear only once.)
S O L U T I O N : Six, namely, abc , acb , bac , bca , cab , cba .

If these permutations are generated randomly with equal probability


then what is the probability the word starts with the letter ”a ” ?
SOLUTION :
2 1
= .
6 3

E X A M P L E : In general, if the word length is n and all characters


are distinct then there are n! permutations of the word. ( Why ? )

If these permutations are generated randomly with equal probability


then what is the probability the word starts with a particular letter ?

SOLUTION :
(n − 1)! 1
= . ( Why ? )
n! n

16

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