1.3. Definitions of Probability: Mathematical (Or Classical or A Priori) Definition of Probability
1.3. Definitions of Probability: Mathematical (Or Classical or A Priori) Definition of Probability
Definitions of Probability
The probability of a given event is an expression of likelihood or chance of
occurrence of an event. How the number is assigned would depend on the
interpretation of the term probability. There is no general agreement about its
interpretation. However, broadly speaking, there are four different schools of
thought on the concept of probability.
Mathematical (or classical or A priori) definition of probability
Let be a sample space associated with a random experiment. Let
in . We make the following assumptions on :
(i)
(ii)
be an event
is defined by
Note:
i) The probability of non-happening (or non-occurrence) of
is given by
That is
ii) If
, then
event is zero.
iii) If
, then
.
.
and
are
are
, then
, then
.
.
trials an event
is given by
happens
(1.3.1)
Note:
i) Since the probability is obtained objectively by repetitive empirical
observations, it is known as Empirical Probability.
ii) The empirical probability approaches the classical probability as the number of
trials becomes indefinitely large.
Limitations of Empirical Probability
(i)
(ii)
, for every
(Non-negativity)
,
is normed (Normality)
are mutually exclusive events in , then
P Ai P Ai ( - additive or countably additive)
i 1 i 1
are events in .
(ii)
(iii)
(iv)
The number of favourable cases to the event of getting even and multiple
of 3 is 1, viz., 6.
Required probability
(v)
Example 2: Four cards are drawn at random from a pack of 52 cards. Find the
probability that
(i)
(ii)
(iii)
(iv)
(v)
(vi)
Solution: Four cards can be drawn from a well shuffled pack of 52 cards in 52C4
ways, which gives the exhaustive number of cases.
(i) 1 king can be drawn out of the 4 kings is 4C1 4 ways. Similarly, 1 queen, 1 jack
and an ace can each be drawn in 4C1 4 ways. Since any one of the ways of
drawing a king can be associated with any one of the ways of drawing a queen,
a jack and an ace, the favourable number of cases are 4C1 4C1 4C1 4C1 .
Hence, required probability
C2 4C2
52
C4
(iii) Since 4 cards can be drawn out of 13 cards (since there are 13 cards of
diamond in a pack of cards) in 13C4 ways,
Required probability
13
C4
C4
52
(iv) Since there are 26 red cards (of diamonds and hearts) and 26 black cards (of
spades and clubs) in a pack of cards,
Required probability
C2 26C2
52
C4
26
13
C2 13C2
52
C4
13
Example 3: What is the chance that a non-leap year should have fifty-three
Sundays?
Solution: A non-leap year consists of 365 days,
day. A non-leap year will consist of 53 Sundays if this over-day is Sunday. This
over-day can be anyone of the possible outcomes:
(i) Sunday (ii) Monday (iii) Tuesday (iv) Wednesday (v) Thursday (vi) Friday (vii)
Saturday, ., 7 outcomes in all. Of these, the number of ways favourable to the
required event viz., the over-day being Sunday is 1.
Required probability
Example 4: Find the probability that in 5 tossings, a perfect coin turns up head at
least 3 times in succession.
Solution: In 5 tossings of a coin, the sample space is:
The favourable cases for getting at least three heads in succession are :
Starting with 1st toss:
Starting with 2nd toss:
Starting with 3rd toss:
Hence, the total number of favourable cases for getting at least 3 heads in
succession are 8.
Required probability
Example 5: A bag contains 20 tickets marked with numbers 1 to 20. One ticket is
drawn at random. Find the probability that it will be a multiple of (i)2 or 5, (ii)3 or 5
Solution: One ticket can be drawn out of 20 tickets in 20C1 20 ways, which
determine the exhaustive number of cases.
(i) The number of cases favourable to getting the ticket number which is:
(a) a multiple of 2 are 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, ., 10 cases.
(b) a multiple of 5 are 5, 10, 15, 20 i.e., 4 cases
Of these, two cases viz., 10 and 20 are duplicated.
Hence the number of distinct cases favourable to getting a number which is a
multiple of 2 or 5 are:
.
Required probability
(ii) The cases favourable to getting a multiple of 3 are 3, 6, 9, 12, 15, 18 i.e., 6
cases in all and getting a multiple of 5 are 5, 10, 15, 20 i.e., 4 cases in all. Of
these, one case viz., 15 is duplicated.
Hence, the number of distinct cases favourable to getting a multiple of 3 or 5 is
.
Required probability
Example 6: An urn contains 8 white and 3 red balls. If two balls are drawn at
random, find the probability that
(i) both are white,
1110
55
2
(i) If both the drawn balls are white, they must be selected out of the 8 white
balls and this can be done in 8C2
8 7
28 ways.
2
(iii) The number of favourable cases for drawing one white ball and one red ball is
C1 3C1 8 3 24
Example 7: The letters of the word article are arranged at random. Find the
probability that the vowels may occupy the even places.
Solution: The word article contains 7 distinct letters which can be arranged
among themselves in ways. Hence exhaustive number of cases is .
In the word article there are 3 vowels, viz.,
and and these are to be placed
in, three even places, viz., 2nd, 4th and 6th place. This can be done in , ways. For
each arrangement, the remaining 4 consonants can be arranged in ways.
Hence, associating these two operations, the number of favourable cases for the
vowels to occupy even places is
.
Required probability
Example 8: Twenty books are placed at random in a shelf. Find the probability
that a particular pair of books shall be:
(i) Always together
ways, the
(i) Let us now regard that the two particular books are tagged together so that
we shall regard them as a single book. Thus, now we have
books which can be arranged among themselves in
ways. But the two
books which are fastened together can be arranged among themselves in
ways.
Hence, associating these two operations, the number of favourable cases for
getting a particular pair of books always together is
.
Required probability is
Required probability
Aliter:
is 2 (since
Solution: Since any person can tell the rumour to any one of the remaining
people in
ways, the exhaustive number of cases that the rumour
will be told 10 times is
.
are
Required probability
Example 11: If 10 men, among whom are and , stand in a row, what is the
probability that there will be exactly 3 men between and ?
Solution: If 10 men stand in a row, then can occupy any one of the 10 positions
and can occupy any one of the remaining 9 positions. Hence, the exhaustive
number of cases for the positions of two men and are
.
The cases favourable to the event that there are exactly 3 men between
are given below:
and
(i)
(ii)
(vi)
Required probability
Example12: A five digit number is formed by the digits 0, 1, 2, 3, 4 (without
repetition). Find the probability that the number formed is divisible by 4.
Solution: The total number of ways in which the five digits 0, 1, 2, 3, 4 can be
arranged among themselves is . Out of these, the number of arrangements
which begin with 0 (and therefore will give only 4-digited numbers) is .
Hence the total number of five digited numbers that can be formed from digits 0,
1, 2, 3, 4 is
The number formed will be divisible by 4 if the number formed by the two digits
on extreme right (i.e., the digits in the unit and tens places) is divisible by 4. Such
numbers are:
and
If the numbers end in 04, the remaining three digits viz., 1, 2 and 3 can be
arranged among themselves in in each case.
If the numbers end with 12, the remaining three digits 0, 2, 3 can be arranged in
ways. Out of these we shall reject those numbers which start with 0 (i.e., have
0 as the first digit). There are
such cases. Hence, the number of five
digited numbers ending with 12 is :
Similarly the number of 5 digited numbers ending with 24 and 32 each is 4. Hence
the total number of favourable cases is:
Hence, required probability
Example13: There are four hotels in a certain town. If 3 men check into hotels in
a day, what is the probability that each checks into a different hotel?
Solution: Since each man can check into any one of the four hotels in 4C1 4 ways,
the 3 men can check into 4 hotels in
exhaustive number of cases.
If three men are to check into different hotels, then first man can check into any
one of the 4 hotels in 4C1 4 ways; the second man can check into any one of the
remaining 3 hotels in 3C1 3 ways; and the third man can check into any one of
the remaining two hotels in 2C1 2 ways. Hence, favourable number of cases for
each man checking into a different hotel is: 4C1 3C1 2C1 4 3 2 24
Required probability