Probability:

P ( A 1 ∪ A 2 ∪ A k )=P( A ¿¿ 1)+ P ( A2 ) + …+ P ( A k ) ¿
'
P ( A )=1−P( A )
P ( A ∪ B )=P ( A ) + P ( B ) −P ( A ∩ B )
P ( A ∪ B ∪C )=P ( A ) + P ( B )+ P ( C )−P ( A ∩ B )−P ( A ∩C )−P ( B ∩C )+ P( A ∩ B∩C )

Multiplication principle:
total outcomes=n1 ¿ n2

Permutation:
n!
P¿
n r :(ordered , no repalcement ) Alphabet∧4 letters .
( n−r ) !
P ¿ nr :(ordered , with replacement ) Alphabet ∧4 letters .
n r

Combination:
(r )
n n!
C¿ =
n r :(Unordered , no replacement)
r ! ( n−r ) !

C ¿ nr :(unordered , withreplacement )
n r

5 cards all spades=

( 5 0)(
13 39
) =
13 ! ( )
5!8!
∗1

( 5 ) ( 552! 47! ! )
52

(Deck of cards = 52, 13 of each symbol)

Distinguishable permutation:
n!
Differnet ¿:
n1 ! n2 ! n3 !

Conditional Probability:
P(A∩B)
P ( A|B )=
P ( B)

P ( A '|B )=1−P ( A|B )

P ( A ∩B )=P ( A|B )∗P(B)
∩=multiply
∪=addition

Independent events:
P ( A ∩B )=P ( A )∗P (B)

P ( A ∩B ' )=P ( A )∗P ( B' )=P ( A )∗(1−P ( B ) )

Bayes Theorem:
P ( B| A )∗P ( A )
P ( A|B )=
P (B)

Mean, µ:
set
µ=E ( X )=∑ x∗f (x )
xi

set
µ=E ( X 2 )=∑ x 2∗f (x )
xi

set set
µ=E ( X (5−x ) )=¿ 5 E ( x )−E ( x 2 )=∑ x∗f ( x )−∑ x 2∗f (x )
xi xi

Moment:
first moment=∑ ( x−µ )∗f (x)aka mean
xεS

Second moment=∑ ( x−µ ) ∗f (x) aka variance

2

xεS

r moment=∑ ( x−µ ) ∗f ( x )
th r

xεS

Variance, Var(x), σ : 2

Var ( X )=σ =∑ ( x−µ ) ∗f ( x )

2 2

xεS

σ =[ E ( X ) ]−µ =Second moment −( first moment )

2 2 2 2

Standard deviation, σ:
σ =√ σ = √ Var ( X)=√ Second moment−( first moment )
2 2

Uniform distribution mean 1st M positive integer:

1
Ex : f ( x ) =
m
1
∗m ( m+1 )
( )
m m
1 1 m m+1
µ=E ( X )=∑ x = ∑ x= =
x=1 m m x=1 2 2
2
m −1
σ =E ( X ) =
2 2
12

Moment generating function of x:

M ( t )=∑ x e ∗f (x)=first moment
' xt

xεS

m (t)= sum from {xεS} {{x} ^ {2} {e} ^ {xt} *f left (x right ) =second moment

Quadratic formula:
2
−b ± √ (b −4 ac)
x=
2a

Bernoulli Trial: independent, mutually exclusive event. (p (success), q(failure))

n=total attempt , p=success probability , 1− p=fail probability
x n− x
F ( X )= p ∗( 1− p ) ∨x=0(fail ), 1(success)
Bernoulli Distribution: If n = 1, x = 0, 1
1 1
µ=E ( X )=∑ x∗f ( x )=∑ x∗¿ px ( 1− p )
n− x
=np ¿
x=0 x=0

1 1
σ 2=Var ( X )=∑ ( x−µ ) ∗f ( x )=∑ ( x−µ ) ∗¿ p x ( 1− p )
2 2 n−x
= p ( 1− p ) =npq ¿
x=0 x=0

σ =√ σ 2= √Var ( x )=√ Var ( x ) =√ p(1− p)=√ pq

Bernoulli Distribution: If n = 1, x = -1, 1
xf
µ=E ( X )=∑ x∗p( x)first moment
xi
 xf
¿ E ( X 2) =∑ x 2∗p ( x ) second moment
xi

2
σ =second moment −¿
Total # of successes (non-ordered). The # of ways of selecting x positions for the x successes in the n
trials:

Denotation: Distribution of x, b(n, p). b = binomial distribution, n = # of independent trial, p =

success probability.

( nx)= x ! ( n−x ) !
n!

x () x
()
P ( X=x ) =f ( x )= n ( p ) ( q ) = n ( p ) ( 1− p )
n −x

x
x n− x

While x=1 , 2 ,3 … 10. , n=10 trial

P ( x ≤ 8 )=1−¿
8

x=0 x
()
P ( x ≤ 8 )=∑ n ( p ) ( q )
x n− x