FORMULAS (ASASI SAINS SEM 2)
MATHS 3
1. Permutation & Combination
Permutation
n
Pn = n! = n × (n − 1) × (n − 2) × … × 3 × 2 × 1
n n!
Pr = (n−r)! = n × (n − 1) × (n − 2) ×.…× (n − r + 1)
If arrangements are considered the same,
(n−1)!
then arrangement of circle:
2
Combination
n
Pr n! n
= = nCr = ( )
r! (n − r)! r! r
n×(n−1)×(n−2)×…×(n−r+1)
=
1×2×3×…×r
2. Probability
number of successful outcomes
Probability =
total number of possible outcomes
𝑛(𝐸)
P(E) =
𝑛(𝑆)
Addition Rules for Combined Events
P (A or B) = P (A) + P (B) −P (A ∩ B)
n (A ∪ B) = n (A) + n (B) − n (A ∩ B)
n (A∪B) n (A) n (B) n (A ∩ B)
= = −
n (S) n (S) n (S) n (S)
FORMULAS (ASASI SAINS SEM 2)
→ P (A ∪ B) = P (A) + P (B) − P (A ∩ B)
Mutually Exclusive
∴ P (A ∩ B) = 0 (2 events cannot occur at the same time)
P (A or B) = P (A) + P (B)
P (A ∪ B) = P (A) + P (B)
Conditional Probability
P (B given A) → P (B | A)
P (A ∩ B)
P (B | A) = , P (A) ≠ 0
P (A)
P (A ∩ B) = P (A) × P (B | A)
P (A ∩ B′ ) P (A) − P (A ∩ B)
P (A | B') = =
P (B′ ) 1 − P (B)
Independent Events
If A and B are independent events
P (B | A) = P (B)
P (A | B) = P (A)
P (A ∩ B) = P (A) × P (B)
Bayes Theorem
→ formula which allows to find probability of event occured as a result of a
particular previous event
P (A) = P (A ∩ B) + P (A ∩ B′)
P (E | Ai ) P (Ai )
P (Ai | E) =
P (E | A1 ) P (A1 ) +P (E | A2 ) P (A2 ) +⋯+ P (E | An ) P (An )
FORMULAS (ASASI SAINS SEM 2)
3. Discrete Random Variable
Probability Distribution
Eg : Throwing a fair dice.
x 1 2 3 4 5 6
1 1 1 1 1 1
P (X = x)
6 6 6 6 6 6
1
, x = 1, 2, 3, 4, 5, 6
P (X = x) = f (x) = {6 (probability distribution function)
0, otherwise
i) 0 ≤ 𝑃 (𝑋) ≤ 1
ii) sum of probabilities is 1.
Cumulative Distribution
F (t) = P (x ≤ t)
t
= ∑ P (X = x)
x1
x 1 2 3 4 5 6
F(x) P (X ≤ 1) P (X ≤ 2) P (X ≤ 3) P (X ≤ 4) P (X ≤ 5) P (X ≤ 6)
1 = P (X = 1) 2 1 3 1 4 1 5 1
= + P (X = 2)
= + = + = + = +
6 6 6 6 6 6 6 6 6
1 1 3
= + 4 5
6 6 = = = =1
6 6 6
2
=
6
FORMULAS (ASASI SAINS SEM 2)
0, 𝑥<1
1⁄ , 1≤𝑥<2
6
2⁄ , 2≤𝑥<3
6
𝐹(𝑥) = 3⁄6 , 3≤𝑥<4
4⁄ , 4≤𝑥<5
6
5⁄ , 5≤𝑥<6
6
{ 1, 𝑥≥6
P (a < X ≤ b)
= P (X ≤ b) − P (X ≤ a)
= F (b) − F (a)
P (X = b) = F(b) − F (a)
Expected Value
E(x) = μ = ∑ x P (X = x)
Eg: Throwing a fair dice
1 1 1 1 1 1
E(x) = μ = 1 × +2× +3× +4× +5× + 6 × = 3.5
6 6 6 6 6 6
E[g(x)] = ∑ g(x) P (X = x)
E(X 2 ) = ∑ x 2 P (X = x)
Median
P (X ≤ m) = 0.5
F (m) = 0.5
Variance
E(X 2 ) = ∑ x 2 P (X = x)
Var(X) = σ2 = E(X 2 ) − [E(X)]2
= E(X)2 − μ2
FORMULAS (ASASI SAINS SEM 2)
Standard Deviation
σ = √Var(X)
4. Continuous Random Variable
P (a ≤ X ≤ b) = P (a ≤ X < b) = P (a < X ≤ b) = P (a < X < b)
P (X = a) = P (X = b) = 0
Probability Density Function
x
P (x1 ≤ X ≤ x2 ) = ∫x 2 f(x)dx
1
b
∫ f(x) dx = ∫ f(x) dx = 1
all x a
i) f(x) ≥ 0 for all x
ii) total area under graph = 1
x
iii) P (x1 ≤ X ≤ x2 ) = ∫x 2 f(x)dx
1
Cumulative Distribution Function
t
F(t) = P (X ≤ t) = ∫−∞ f(x) dx
Domain → xo ≤ x ≤ x1 → F(xo ) = 0 and F(x1 ) = 1
P (a ≤ X ≤ b) = P (a ≤ X < b) = P (a < X ≤ b) = P (a < X < b)
b b a
= ∫ f(x) dx = ∫ f(x)dx − ∫ f(x)dx
a −∞ −∞
= F (b) −F (a)
m x 1
F (m) = ∫x f(x) dx = ∫m1 f(x)dx =
o 2
FORMULAS (ASASI SAINS SEM 2)
Expected Value
E(X) = μ = ∫all x x f(x) dx
∞
E[g(x)] = ∫−∞ g(x) f(x) dx
∞
E[X 2 ] = ∫−∞ x 2 f(x)dx
i) E(a) = a
ii) E(aX) = aE(X)
iii) E(aX + b) = aE(X) + b
Variance
Var(X) = σ2 = E(X 2 ) − [E(X)]2
i) Var (a) = 0
ii) Var (aX) = a2 Var(X)
iii) Var (aX + b) = a2 Var(X)
5. Special Probability Distribution
Binomial Distribution
Denoted by X~ B(n, p)
(nx) px qn−x x = 0, 1, 2, 3, … , n
P (X = x) = {
0 otherwise
μ = np
σ2 = npq
Value in the Binomial Table uses ‘more than or equal’:
n
∑ P (X = x) = P (X ≥ x)
x=r
FORMULAS (ASASI SAINS SEM 2)
Poisson Distribution
Denoted by X~Po(λ)
x
λ e−λ
P (X = x) =
x!
x = number of occurrences
λ = average/mean number of occurrences
μ=λ
σ2 = λ
Value in the Poisson Table uses ‘more than or equal’:
∞
−𝑚
𝑚𝑥
∑𝑒
𝑥!
x=r
Normal Distribution
Denoted by X~N(μ, σ2 )
Standardize to a standard normal distribution:
X− μ
Z=
σ
Value in the Normal Table uses ‘greater than’:
P (X = x) = 0
Approximation
Poisson Approximation to Binomial: When n > 50 and np < 5
Normal Approximation to Binomial: When np > 5 and 0.1 < p < 0.9
Normal Approximation to Poisson: When λ > 30
FORMULAS (ASASI SAINS SEM 2)
6. Matrices
Operations on Matrices
a b e f a+e b+f
( )+( )= ( )
c d g h c+g d+h
a b 2a 2b
2( )=( )
c d 2c 2d
a b
1 a b
( ) = (2 2)
2 d d c d
2 2
Matrices can be multiplied if:
number of columns of 1st matrix = number of rows of 2nd matrix
c
(a b) ( ) = (a × c + b × d)
d
a a×c a×d
( ) (c d) = ( )
b b×c b×d
Transpose
a b c
A=( )
d e f
a d
T
A = (b e)
c f
Properties
→ (A ± B)T = AT ± B T
→ (AT )T = A
→ (AB)T = B T AT
→ (kA)T = kAT
FORMULAS (ASASI SAINS SEM 2)
Symmetric Matrix
A = AT
1
A = (A + AT )
2
Skew-Symmetric Matrix
A = −AT or AT = −A
1
Av = (A − AT )
2
Determinant
• 2 × 2 Matrix
a b
|D| = ( ) is (a)(d) − (b)(c)
c d
• 3 × 3 Matrix
Minor, Mij
a b c
A = (d e f )
g h i
Eg:
a b c
M11 = (d e f)
g h i
e f
= ( )
h i
= (e)(i) − (f)(h)
FORMULAS (ASASI SAINS SEM 2)
Cofactor, K ij
Eg: K11 = (−1)1+1 M11
= M11
p q r p −q r
Minor = ( s t u) Cofactor = (−s t −u )
v w x v −w x
Adjoint, adj(A)
adj(A) = K T
p −q r p −s v
Cofactor = (−s t −u ) Adjoint = (−q t −w )
v −w x r −u x
Method 1
a b c
|D|= (d e f ) is
g h i
(a × K11 ) + (b × K12 ) + (c × K13 )
= (a × p) + (b × −q) + (c × r)
or
(a × K11 ) + (d × K 21 ) + (g × K 31 )
= (a × p) + (b × −s) + (c × v)
Method 2
a b c a b a b c a b
|D| = (d e f | d e = (d e f | d e
g h i g h g h i g h
= (a)(e)(i) + (b)(f)(g) + (c)(d)(h) − (c)(e)(g) − (a)(f)(h) − (b)(d)(i)
FORMULAS (ASASI SAINS SEM 2)
Properties
→ |A| = |A|T
→ |AB| = |A||B|
Inverse Matrices
A−1 A = I
1
A−1 ≠
A
1
A−1 = adj(A)
|A|
AB = C → B = A−1 C
BA = C → B = CA−1
Elementary Row Operation
(A | I) reduced to (I | A−1 )
a b c 1 0 0 1 0 0 p q r
(d e f |0 1 0) → (0 1 0| s t u)
g h i 0 0 1 0 0 1 v w x
Liner Equations with 3 variables
i) Inverse Matrix
AX = B → X = A−1 B
a b c
D = (d e f )
g h i
a b c x k1
(d e f ) (y) = (k 2 )
g h i z k3
FORMULAS (ASASI SAINS SEM 2)
x 1 k1
(y) = [ adj(D)] × (k 2 )
z |D|
k3
ii) Cramer's Rule
ax + by + cz = k1
dx + ey + fz = k 2
gx + hy + iz = k 3
a b c
D = (d e f )
g h i
k1 b c a k1 c a b k1
| k2 e f| | d k2 f| | d e k2 |
k3 h i g k3 i g h k3
x= y= z=
|D| |D| |D|
iii) Gauss-Jordan Elimination
a b c x k1
(d e f ) (y) = (k 2 )
g h i z k3
a b c 𝑘1 1 0 0 𝑥
(d e f | 𝑘2 ) → (0 1 0 | 𝑦)
g h i 𝑘3 0 0 1 𝑧
