Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.
Here’s a structured summary of core topics, concepts, principles, and equations for the exam, followed by Mermaid knowledge graphs to visualize relationships.
Core Topics & Concepts
1. Probability & Statistics
A. Random Variables (Discrete & Continuous)
Distribution
PMF/PDF
CDF
Mean (E[X])
Variance (Var(X))
Uniform (Discrete)
fX(k)=n1,k=a,a+1,…,b
FX(x)=nk−a+1,a≤x<b
2a+b
12n2−1
Bernoulli
fX(k)=pk(1−p)1−k,k∈{0,1}
FX(x)=1−p,0≤x<1
p
p(1−p)
Binomial
fX(k)=nCkpk(1−p)n−k,k=0,…,n
FX(x)=∑i=0knCipi(1−p)n−i
np
np(1−p)
Geometric
fX(k)=(1−p)k−1p,k=1,2,…
FX(x)=1−(1−p)k,k≤x<k+1
p1
p21−p
Poisson
fX(k)=k!e−λλk,k=0,1,…
FX(x)=e−λ∑i=0ki!λi
λ
λ
Uniform (Continuous)
fX(x)=b−a1,a≤x≤b
FX(x)=b−ax−a,a≤x≤b
2a+b
12(b−a)2
Exponential
fX(x)=λe−λx,x≥0
FX(x)=1−e−λx,x≥0
λ1
λ21
Normal
fX(x)=σ2π1e−2σ2(x−μ)2
No closed form
μ
σ2
Gamma
fX(x)=Γ(α)βαxα−1e−βx,x>0
FX(x)=Γ(α)Γ(α,βx)
βα
β2α
Beta
fX(x)=Γ(α)Γ(β)Γ(α+β)xα−1(1−x)β−1
No closed form
α+βα
(α+β)2(α+β+1)αβ
B. Theorems & Inequalities
Markov’s Inequality:
P(X≥c)≤cE[X],X≥0
Chebyshev’s Inequality:
P(∣X−μ∣≥kσ)≤k21
Weak Law of Large Numbers (WLLN):
P(∣Xˉ−μ∣>δ)≤nδ2σ2
Central Limit Theorem (CLT):
nσY−nμ≈Normal(0,1)
where Y=X1+…+Xn.
Maximum Likelihood Estimation (MLE):
θ^=argθmaxi=1∏nfX(xi;θ)
For Exponential Distribution:
λ^=∑i=1nUin
C. Joint & Conditional Distributions
Joint PDF/PMF: fX,Y(x,y)
Marginal PDF/PMF: fX(x)=∫fX,Y(x,y)dy
Conditional Expectation:
E[X∣Y=y]=∫xfX∣Y(x∣y)dx
2. Linear Algebra
A. Matrix Properties
Positive Definite Matrix:
A is positive definite if xTAx>0 for all x=0.
Properties:
All eigenvalues >0.
Ak is positive definite for k≥1.
A−1 is positive definite.
Diagonal entries >0.
Eigenvalues & Eigenvectors:
Av=λv
If A has n linearly independent eigenvectors, it is diagonalizable.