Intuition What this page is for
The parent note told you what the CLT says and why it is true. This page drills the doing . We build one example for every kind of situation the CLT can throw at you — different starting shapes, discrete vs continuous, the case where it works beautifully , and the case where it breaks completely . By the end you should be able to look at any new problem and say "ah, that's cell such-and-such, here's the recipe."
Before anything, three symbols we will lean on the whole page — each defined in plain words:
Definition The three quantities we standardize with
μ ("mew") — the true mean of one single X i : the long-run average value if you sampled that one variable forever.
σ ("sigma") — the standard deviation of one single X i : the typical distance of a single value from μ . Its square σ 2 is the variance .
σ / n — the standard error : the standard deviation of the average of n of them. See Standard Error . This is the number that shrinks as you collect more data.
Definition The two functions on the answer side
Φ ( z ) ("big Phi") — the standard normal CDF : it answers "what fraction of a standard bell curve lies to the left of the point z ?" So Φ ( − ∞ ) = 0 , Φ ( 0 ) = 0.5 , Φ ( + ∞ ) = 1 .
z — the standard score : how many standard errors your cutoff sits away from the mean. Positive z = to the right of the mean, negative z = to the left. This is the only bridge between your specific problem and the universal table Φ .
The one move every example makes:
z = ( SD of the thing ) ( your cutoff ) − ( mean of the thing ) , P ( thing ≤ cutoff ) ≈ Φ ( z ) .
Every CLT problem falls into one of these cells. The examples below are tagged with the cell they cover.
Cell
What makes it distinct
Covered by
A — Symmetric discrete, sum
flat/symmetric start, sum of many
Ex 1
B — Skewed continuous, mean
heavy right-skew start, average
Ex 2
C — Discrete count, needs continuity correction
Bernoulli sum, half-shifts
Ex 3
D — Two-sided ("between") probability
need Φ ( z 2 ) − Φ ( z 1 )
Ex 4
E — Inverse problem (solve for n )
given error target, find sample size
Ex 5
F — Real-world word problem
translate English → μ , σ , n
Ex 6
G — Degenerate: σ = 0
zero variance, no bell at all
Ex 7
H — Limiting / failure: infinite variance
Cauchy Distribution , CLT breaks
Ex 8
I — Exam twist: difference of two means
combine two independent averages
Ex 9
We cover signs (positive and negative z ), both tails, the "between" case, the zero-input case, and the limiting case where the theorem stops working. Nothing is left unshown.
Worked example Sum of 100 fair dice
A fair die shows 1 –6 each with probability 6 1 . Roll it n = 100 times, let S = ∑ X i . Find P ( S > 380 ) .
Forecast: 380 is above the mean 350 — is it a little above or a lot ? Guess whether the answer is closer to 0.4 or 0.04 .
Find μ and σ 2 of one die. μ = 6 1 + 2 + ⋯ + 6 = 3.5 . Variance = E [ X 2 ] − μ 2 = 6 91 − 3. 5 2 = 12 35 ≈ 2.9167 , so σ ≈ 1.708 .
Why this step? The CLT only uses these two numbers; the flat shape of the die is irrelevant to the limit.
Scale up to the sum. E [ S ] = 100 ⋅ 3.5 = 350 ; Var ( S ) = 100 ⋅ 2.9167 = 291.67 ; SD ( S ) = 291.67 = 17.078 .
Why this step? Means add and — because the rolls are independent — variances add. SDs do not add ; you must add variances first, then square-root.
Standardize the cutoff. z = 17.078 380 − 350 = 1.756 .
Why this step? This converts "380 on the dice scale" into "1.756 standard errors above the mean," which is the language the table Φ speaks.
Read the tail. P ( S > 380 ) ≈ 1 − Φ ( 1.756 ) = 1 − 0.9605 = 0.0395 .
Why this step? Φ gives the left area; we want the right tail, so subtract from 1 .
Verify: z = 1.756 > 0 means the cutoff is above the mean, so the probability of exceeding it should be below 0.5 — and 0.0395 is. Units cancel (dice minus dice over dice = pure number). Forecast: it was the small one, ≈ 0.04 . ✓
Worked example Average of 50 exponential waiting times
X i ∼ Exp ( λ = 2 ) (a very right-skewed distribution). For it, μ = 1/ λ = 0.5 and σ = 1/ λ = 0.5 . Take n = 50 measurements and average them into X ˉ . Find P ( X ˉ > 0.6 ) .
Forecast: the raw exponential is lopsided — will its average still be roughly bell-shaped after only 50 terms? Guess yes or no.
Get the standard error. n σ = 50 0.5 = 0.0707 .
Why this step? We are averaging, not summing, so the spread shrinks like 1/ n . This is the SD of X ˉ .
Standardize. z = 0.0707 0.6 − 0.5 = 1.414 .
Why this step? Same bridge as before: express 0.6 in standard-error units.
Right tail. P ( X ˉ > 0.6 ) ≈ 1 − Φ ( 1.414 ) = 1 − 0.9214 = 0.0786 .
Verify: the raw variable is skewed, yet the CLT still applies because its variance is finite . The answer 0.0786 < 0.5 is consistent with 0.6 being above the mean. Forecast: yes — averaging tames the skew. ✓ (This is Cell B: skewness is allowed, it just would need larger n if the answer had to be super accurate deep in the tail.)
Intuition Reading figure s01
The figure overlays the discrete binomial bars (each a hollow rectangle of width 1 centred on an integer count) against the smooth normal curve. The one red bar is k = 50 ; the red dashed line at 50.5 is the correction boundary. Notice the red bar physically spans from 49.5 to 50.5 — the smooth curve's cutoff must sit at its right edge to swallow the whole bar. That visual is the entire reason for the + 0.5 shift below.
Worked example Binomial via the normal (de Moivre–Laplace)
X ∼ Bin ( n = 200 , p = 0.3 ) — a sum of 200 independent Bernoulli trials. Find P ( X ≤ 50 ) .
Forecast: 50 is below the expected count n p = 60 . Left tail or right tail? Above or below 0.5 ?
Mean and SD of the count. μ = n p = 200 ⋅ 0.3 = 60 ; σ = n p ( 1 − p ) = 200 ⋅ 0.3 ⋅ 0.7 = 42 = 6.4807 .
Why this step? A Bernoulli( p ) has variance p ( 1 − p ) ; add 200 of them.
Apply the continuity correction. For P ( X ≤ 50 ) use the cutoff 50.5 , not 50 .
Why this step? Look at the red bar in figure s01: each integer count is a bar of width 1 centred on the integer. The bar for "50 " stretches from 49.5 to 50.5 . To capture all of it under the smooth curve, the boundary sits at its right edge, 50.5 . Missing this is the single most common CLT error.
Standardize. z = 6.4807 50.5 − 60 = − 1.4659 .
Why this step? Note the negative sign — the cutoff is below the mean, so z < 0 . Signs matter: they place you on the correct side of the bell.
Read the left tail directly. P ( X ≤ 50 ) ≈ Φ ( − 1.4659 ) = 0.0713 .
Why this step? Φ already gives the left area, so no subtraction here. Use the symmetry Φ ( − a ) = 1 − Φ ( a ) : 1 − Φ ( 1.466 ) = 1 − 0.9287 = 0.0713 .
Verify: below-mean cutoff ⇒ probability below 0.5 ⇒ 0.0713 ✓. Without the correction we'd have used 50 , giving z = − 1.543 and Φ = 0.0614 — a noticeable error from ignoring the bar width.
Worked example Sample mean landing in a window
Reuse the 100 dice from Example 1 but ask for the average X ˉ = S /100 . Find P ( 3.4 < X ˉ < 3.6 ) .
Forecast: this window is centred on the mean 3.5 . Should the answer be big (most of the bell) or tiny?
Standard error of the mean. n σ = 10 1.708 = 0.1708 .
Why this step? We switched from the sum to the mean, so divide the single-die σ by 100 = 10 .
Standardize both ends.
z 1 = 0.1708 3.4 − 3.5 = − 0.5855 , z 2 = 0.1708 3.6 − 3.5 = + 0.5855.
Why this step? A "between" question needs two boundaries; note they are symmetric (± ) because the window is symmetric about the mean.
Subtract the two left-areas. P = Φ ( 0.5855 ) − Φ ( − 0.5855 ) .
Why this step? Φ ( z 2 ) is everything left of the right wall; remove Φ ( z 1 ) (everything left of the left wall); what remains is the strip between.
Evaluate. Φ ( 0.5855 ) = 0.7209 , Φ ( − 0.5855 ) = 0.2791 , so P = 0.7209 − 0.2791 = 0.4418 .
Verify: the window is roughly ± 0.59 SE wide, a bit more than half a standard deviation each side — capturing near 44% of the bell is sensible (recall ± 1 SE captures ≈ 68% ). Symmetric window ⇒ z 1 = − z 2 ✓. Forecast: moderately big, not tiny. ✓
Worked example How much data to hit an error target?
You are estimating a mean with σ = 2 . You want a 95% confidence interval whose half-width (margin of error) is at most 0.25 . How large must n be?
Forecast: you want a tighter interval than one SE — will n be in the tens, hundreds, or thousands?
Write the margin of error. For 95% we use z 0.025 = 1.96 (the point with 2.5% in each tail). Margin = z 0.025 ⋅ n σ = 1.96 ⋅ n 2 .
Why this step? The CLT says X ˉ is normal with spread σ / n ; the interval reaches 1.96 SEs each side.
Set it ≤ 0.25 and solve.
1.96 ⋅ n 2 ≤ 0.25 ⇒ n ≥ 0.25 1.96 ⋅ 2 = 15.68 ⇒ n ≥ 15.6 8 2 = 245.86.
Why this step? Isolate n , then square. Squaring is exactly why halving your error costs 4× the data.
Round up. n = 246 (you can never round down a sample-size requirement).
Why this step? n = 245 would give a margin slightly over 0.25 ; you must clear the bar.
Verify: plug n = 246 back: margin = 1.96 ⋅ 2/ 246 = 0.2499 ≤ 0.25 ✓. Plug n = 245 : margin = 0.2504 > 0.25 ✗ — confirms 246 is the smallest that works.
Worked example Elevator weight limit
An elevator is rated for 1200 kg. Adult passenger weights are independent with mean μ = 75 kg and SD σ = 15 kg (shape unknown). If n = 15 adults board, what is the probability the total weight exceeds the rating?
Forecast: 15 × 75 = 1125 kg is the expected load, just under the limit. Risky or safe?
Translate to a sum. Total load S = ∑ i = 1 15 X i . E [ S ] = 15 ⋅ 75 = 1125 ; Var ( S ) = 15 ⋅ 1 5 2 = 3375 ; SD ( S ) = 3375 = 58.095 .
Why this step? "Total weight exceeds" is a statement about the sum ; means and variances add over the 15 independent people.
Standardize the limit. z = 58.095 1200 − 1125 = 1.291 .
Why this step? Express the 1200 kg rating in standard-error units of the total.
Right tail. P ( S > 1200 ) ≈ 1 − Φ ( 1.291 ) = 1 − 0.9017 = 0.0983 .
Verify: units check — kg minus kg over kg gives a pure z . The mean load sits just ≈ 1.29 SDs below the cap, so a roughly 10% overload risk is plausible and worth worrying about. Forecast: risky-ish, about 1 in 10 . ✓ (Note: with only n = 15 , this normal approximation is decent but not exact — the CLT is asymptotic.)
Worked example What if every value is identical?
Suppose X i = 7 always — a "random" variable with no randomness. So μ = 7 and σ 2 = 0 . What does the CLT say about X ˉ n ?
Forecast: can you even form the standard score? Look at the denominator.
Compute the sample mean. Every term is 7 , so X ˉ n = 7 exactly, for every n . No spread ever.
Why this step? Averaging identical numbers returns that number; there is nothing to fluctuate.
Try to standardize. Z n = σ / n X ˉ n − μ = 0/ n 7 − 7 = 0 0 — undefined .
Why this step? This shows why the parent definition demands σ 2 > 0 . With zero variance there is no bell to converge to; you'd be dividing zero spread by zero spread.
State the correct conclusion. There is no Gaussian limit. The distribution of X ˉ n is a single spike at 7 (a "degenerate" distribution) — this is exactly what the Law of Large Numbers gives you, with the CLT layer collapsing to nothing.
Verify: the hypothesis "σ 2 > 0 " in the theorem statement is not decoration — this case is precisely what it excludes. X ˉ n ≡ 7 has variance 0 , matching "spike, no bell." ✓
Intuition Reading figure s02
The figure plots the running average X ˉ n as n grows for two inputs. The black curve (normal input, finite variance) glides toward 0 and locks in — that is the CLT/Law of Large Numbers working. The red curve (Cauchy input, infinite variance) keeps leaping wildly no matter how large n gets: one freakishly large sample can yank the whole average sideways. The picture is the failure — no amount of extra data buys you a stable estimate.
Worked example When the CLT breaks: the Cauchy distribution
Let X i be i.i.d. standard Cauchy (a bell-looking curve with fat tails). It has no finite mean and infinite variance . What happens to X ˉ n as n → ∞ ?
Forecast: more data usually helps — will the average of a million Cauchy samples settle near a value?
Check the CLT hypothesis. The theorem requires finite variance σ 2 . For Cauchy, σ 2 = ∞ (the fat tails make ∫ x 2 f ( x ) d x diverge). So the CLT does not apply .
Why this step? Every hypothesis of a theorem is a promise you must honour; break one and the conclusion is void. We check hypotheses before computing so we don't blindly plug into a formula that isn't licensed here.
Write the characteristic function of one term. For the standard Cauchy, the characteristic function is φ ( t ) = E [ e i tX ] = e − ∣ t ∣ .
Why this step? The Cauchy has no usable mean or variance, so the standardize-and-Taylor recipe of the parent proof is unavailable. The CF is the one fingerprint that still exists and behaves cleanly under sums, so we track it instead.
Build the CF of the average. By independence, CFs multiply, and scaling X by 1/ n scales the argument of the CF:
φ X ˉ n ( t ) = [ φ ( n t ) ] n = [ e − ∣ t / n ∣ ] n = e − n ⋅ ∣ t ∣/ n = e − ∣ t ∣ .
Why this step? This is the exact same move as Step 2 of the parent proof (independence ⇒ product ⇒ n -th power), but with the average X ˉ n = n 1 ∑ X i the scaling is 1/ n , not 1/ n . The two powers of n cancel perfectly.
Recognize the limit — it never changed. φ X ˉ n ( t ) = e − ∣ t ∣ is identical to the CF of a single term. So X ˉ n has exactly the same standard-Cauchy distribution as one X 1 , for every n . It is not converging to e − t 2 /2 (the normal's CF); it converges to nothing new at all.
Why this step? Because the CF is a unique fingerprint, equal CFs ⇒ equal distributions. Averaging a billion Cauchy samples is no more accurate than looking at one — exactly the wild red curve in figure s02.
Verify: the self-reproducing CF e − ∣ t ∣ → e − ∣ t ∣ (not e − t 2 /2 ) proves the limit is Cauchy, not normal. The theorem's finite-variance clause is exactly what fails, and the Lindeberg–Feller Condition is the general test that formally rules such cases out. ✓
Worked example Comparing two independent samples
Machine A produces parts with mean length μ A = 50 mm, SD σ A = 4 mm; you sample n A = 64 . Machine B has μ B = 48 mm, SD σ B = 3 mm; you sample n B = 36 . The two samples are independent. Find P ( X ˉ A − X ˉ B > 3 ) .
Forecast: the true difference of means is 50 − 48 = 2 mm. Is exceeding 3 mm common or rare?
Mean of the difference. E [ X ˉ A − X ˉ B ] = μ A − μ B = 50 − 48 = 2 .
Why this step? Expectation is linear: the mean of a difference is the difference of means.
Variance of the difference. Each sample mean is ≈ normal by the CLT with variance σ 2 / n :
Var ( X ˉ A ) = 64 16 = 0.25 , Var ( X ˉ B ) = 36 9 = 0.25.
Because the samples are independent, variances of a difference add : Var ( X ˉ A − X ˉ B ) = 0.25 + 0.25 = 0.5 . SD = 0.5 = 0.7071 .
Why this step? Var ( U − V ) = Var ( U ) + Var ( V ) for independent U , V — the minus sign does not subtract variances (variance can never shrink from adding independent noise).
Standardize. z = 0.7071 3 − 2 = 1.4142 .
Why this step? The difference of two normals is itself normal, so one last standardization finishes it.
Right tail. P > 1 − Φ ( 1.4142 ) = 1 − 0.9214 = 0.0786 .
Verify: cutoff 3 sits one true-difference-plus-a-bit above the mean 2 , ≈ 1.41 SDs out ⇒ answer well below 0.5 . Notice 0.0786 matches Example 2's tail because both had z = 1.414 — a nice internal consistency check. ✓
Recall Which cell was which? (quick self-test)
Symmetric discrete sum ::: Cell A (Ex 1 — dice)
Skewed continuous mean ::: Cell B (Ex 2 — exponential)
Discrete count needing + 0.5 shift ::: Cell C (Ex 3 — binomial)
"Between" two bounds ::: Cell D (Ex 4 — Φ ( z 2 ) − Φ ( z 1 ) )
Solve for sample size n ::: Cell E (Ex 5 — square to get n )
English word problem ::: Cell F (Ex 6 — elevator sum)
Zero variance, no bell ::: Cell G (Ex 7 — 0/0 , degenerate)
Infinite variance, CLT fails ::: Cell H (Ex 8 — Cauchy)
Difference of two means ::: Cell I (Ex 9 — variances still add)
Mnemonic The universal 4-beat for every cell
Beat 1 find μ and σ of one thing. Beat 2 scale to your sum or mean (n μ / μ , and σ n / σ / n ). Beat 3 standardize (z = SD cut − mean , mind the sign, add 0.5 if discrete). Beat 4 read Φ (left tail direct, right tail 1 − Φ , between = subtract). Just check first that σ 2 is finite and positive .