.
3
2 Counting
Multiplication Rule Permutation &)
Combinations Ttl
↓ :gi0g(955 *
↓:: 199 *
&
.
3 !94 ,
1)
-58mb)
&S
n >
- Shift r
Jan
*
: 55. 30915 /
=>
·=5 *
-, 00
2 1
=
50400
(n 1) =
! Law
22 !
2242 = = 462
(22 -
2) !
(5 -
1) ! = 4 !
492 =
c = 12
uP =
cy") = 24
(4) = C
n = 9
un
+
4) !
= 126
-
() gildin
R = 2 ,
B = 3 , G = 3
n = 4
(h)(2) = 2 + 3 = 6
V= 3
Y !
(3) =
3 ! (4 3) !
+
=
2 2
. Events
Complement A? intersection AlB Union AUB
A :95
.
Sample) !5 5 95
. , ,
*
disjoint/:g39 *
AnB =
0
I
.4
2 Prop of .
Event
0 P(A) PCA)
n =s PCS) 1 P(0) 0
= =
1
= =
=
,
0.
1 %.55 -y58/j). S *
:
- , 41
H 4 c 191
S < ,,,,*3 n(s) 9
①
=
=
,
E = & ,3
② B =
55 ,*, A S ***
=
AUB =
S***3 =
PCAUB) =
7
AlB =
S **3 = P(AnB) =
E
(E)
=
I
or
-
Additive
given- ifA nd
.5
2 rules
OR 11 -jg And intersection
Complement
·
S, +108) stig *
P(A) = 1 P(A)
-
-j)
·
PCARB) P(B) PCANB) - 5)
= -
· P(AMB) P(A) PCARB) =
-
-ess
Ja P(AB)
o
·
= 1 -
P(AUB)
P(A1B) P(AUB)
0
Disjoint/ 1. 1 P(AnB)
= - ·
=
-
P(AR) = P(A)-PCAMBS
P(A1P) P(A) P(B)
= -
=-
independent 1
=>
PCAUB) P(B)
=
= Subset 11 .
PCAMB) PCA)
=
PCAUB) =
P(A) + P(B) P(A1B) - = 0 3 + 0 32
. . - 0 . 16 = 0 .
97
↓ 154981515456
·
(1 -
P(AB) = 1 - 0 .5
A E (1 6) (6 , 1) (2 , 5) (5 , 2) 3)3
A
· = , ,
, , ,
(3 , 4) , (4 ,
0 .
15 = 0 .
65
3
32-0 15 = 0 17
P(A)
P(AB)
. .
0
P(B)
= .
>
=
- =
=
C = P(B) - P(AnB) =
11 ,4 5951
,
· B =
[ (5 , 6) , (6 , 5)3
>
- P(B) = 5
·
AlB 0 = = P(AnB) = o
·
PCAUB) =
P(A) + PCB) -
P(A1B) =
55 5 0 =+
2 .
6 Conditional Probability
↑ · - X independent jjg *
Mid &
-
I w
PCfRE) =
2
-0 28
.
0 5
PCMIE)
PCM 77
.
· = = 0 .
0 .
66
·
PCfIE) = C I
0
0 .
.
28
33
= 0 . 848
*
PCARB) PCA) PCB) =
P (AIB) =
0 3
. =
P(A) =
0 3
. => independent
·
PCA1B) =
PCA) P(B) = **
·
=> PCAnB) +PCA) PCB)
Not independent
& 38 P(A1B) = 0 26
.
- & S
= 100 :
0 25
.
P (H) 0 3
PCC)
0 25
=
PCH1C) 0 1
.
= .
-03 ·
65 0 26 0 39
P(A) P(A1B) 0 =
.
-
= .
=
- .
= 1 -
P(AUB) = 1 - 0 . 79 = 0 . 21
- = = 0 .
33
N = 20
T D = E
PCAB) =
.7
2
Baye's Rule
if jb !
>
-
-51s)
201