Skip to main content
← Choose a different target

Unlock: De Moivre-Laplace Theorem

The first central limit theorem, historically. Bin(n,p) approximates N(np, np(1-p)) for large n, with explicit continuity correction. Stirling-based proof, Berry-Esseen rate, and where the approximation breaks down (small p, small n, skewed binomials).

20 Prerequisites0 Mastered0 Working20 Gaps
Prerequisite mastery0%
Recommended probe

Borel-Cantelli Lemmas is your weakest prerequisite with available questions. You haven't been assessed on this topic yet.

De Moivre-Laplace TheoremTARGET
Borel-Cantelli LemmasInfrastructureWEAKEST
Not assessed6 questions
Joint, Marginal, and Conditional DistributionsAxioms
Not assessed30 questions
Kolmogorov Probability AxiomsAxioms
Not assessed29 questions
Metric Spaces, Convergence, and CompletenessAxioms
Not assessed16 questions
Basic Logic and Proof TechniquesAxioms
Not assessed18 questions
Cardinality and CountabilityAxioms
Not assessed16 questions
Triangular DistributionAxioms
Not assessed4 questions
Zermelo-Fraenkel Set TheoryAxioms
Not assessed5 questions
Central Limit TheoremInfrastructure
Not assessed19 questions
Common Probability DistributionsAxioms
Not assessed42 questions
Moment Generating FunctionsAxioms
Not assessed6 questions

Sign in to track your mastery and see personalized gap analysis.