This page is the case-crunching drill room for the parent topic . The definitions live there. Here we hunt down every scenario a problem can throw at you — small and large degrees of freedom, degenerate inputs, limiting behaviour, a real-world word problem, and an exam-style trap — and work each one from zero.
Before we start, some plain-word groundwork so no symbol is unearned:
Definition The symbols and abbreviations used on this page
Z = a standard normal random variable: bell-shaped, centred at 0 , with spread (standard deviation) 1 . Written Z ∼ N ( 0 , 1 ) . See Standard Normal Distribution .
df = degrees of freedom : the number of independent pieces of information free to vary. We abbreviate "degrees of freedom" as df everywhere below.
V = a chi-squared random variable, i.e. a sum of squared independent Z 's. We write V ∼ χ k 2 when it has k df.
U , W = further independent chi-squared variables, used when a problem needs more than one.
Recall What the three distributions mean (one line each)
χ k 2 ::: add up k independent squared standard normals Z i 2 ; measures total squared wobble.
t k ::: a standard normal Z divided by an estimated standard deviation built from k df; a bell with fatter tails.
F d 1 , d 2 ::: a ratio of two chi-squareds, each first divided by its own df; asks "how many times bigger is one wobble than the other?"
Every question this topic can ask falls into one of these case classes . Read the whole table first — the examples below are labelled with the cell they hit, and together they fill every cell.
Cell
Case class
What makes it tricky
Example
A
χ 2 mean/variance, small k
just apply E = k , Var = 2 k
Ex 1
B
df from a constraint (n vs n − 1 )
remembering estimating x ˉ costs one df
Ex 2
C
building a t statistic (unknown σ )
why t not Z
Ex 3
D
t 2 = F 1 , k identity
recognising Z 2 is χ 1 2
Ex 4
E
F for two variances + reciprocal swap
which df is numerator; 1/ F symmetry
Ex 5
F
Degenerate / boundary inputs (k = 1 , k = 2 , s 2 = 0 )
formulas that give ∞ or undefined
Ex 6
G
Limiting behaviour (k → ∞ )
t k → Z , F → narrow, why
Ex 7
H
Real-world word problem (must extract n , s , df)
translating English into x ˉ , s , n
Ex 8
I
Additivity of independent χ 2
χ a 2 + χ b 2 = χ a + b 2
Ex 9
J
Exam twist : variance of t , F mean, when they don't exist
the ( k − 2 ) and ( d 2 − 2 ) traps
Ex 10
Notice there are no "quadrant/sign" cells here as there are for angles — these distributions live on [ 0 , ∞ ) (χ 2 , F ) or all of R (t ). The "sign" analogue for us is the boundary values of the df (k = 1 , 2 ; d 2 ≤ 2 ), where means and variances stop existing. Cell F and J guard those.
The figure below draws that geography: the black curves are χ 5 2 and F 5 , 8 , both pinned to the left edge 0 (they can never go negative — they are built from sums of squares), while the red curve is t 5 , symmetric about 0 and spreading to both sides. Keep this picture in mind: χ 2 and F are one-sided; t is two-sided. Every example below sits somewhere on this map.
Worked example Example 1 — Cell A: mean & variance of
χ 7 2
Find E [ χ 7 2 ] and Var ( χ 7 2 ) .
Forecast: guess the two numbers before reading on. (Mean should equal the df; variance twice it.)
Step 1. E [ χ 7 2 ] = k = 7 .
Why this step? χ 7 2 = Z 1 2 + ⋯ + Z 7 2 and each Z i 2 has mean 1 ; expectation adds, so 7 × 1 = 7 .
Step 2. Var ( χ 7 2 ) = 2 k = 14 .
Why this step? Each Z i 2 has variance 2 , and the Z i are independent , so variances add: 7 × 2 = 14 .
Verify: mean = df is the fastest sanity check — 7 squared normals, each averaging 1 , must average to 7 . Spread bigger than the mean (14 > 7 ) is expected because χ 2 is right-skewed. ✓
Worked example Example 2 — Cell B: sample variance to
χ 2 , and why df = n − 1
A sample of n = 12 from N ( μ , σ 2 ) gives s 2 = 5 ; the true σ 2 = 4 . Give the test statistic's value and distribution .
Forecast: will the df be 12 or 11 ?
Step 1. Statistic σ 2 ( n − 1 ) s 2 = 4 11 ⋅ 5 = 4 55 = 13.75 .
Why this step? This is the standard result σ 2 ( n − 1 ) s 2 ∼ χ n − 1 2 from Sample Variance and Bessel's Correction — the only combination of s 2 and σ 2 that is a clean chi-squared.
Step 2. Distribution is χ n − 1 2 = χ 11 2 .
Why this step? Computing x ˉ forces ∑ ( x i − x ˉ ) = 0 : one deviation is determined by the other eleven, so only 11 are free . Df = data − estimated parameters = 12 − 1 .
Verify: the observed 13.75 sits near the mean of χ 11 2 (which is 11 ) — plausible, not extreme, so s 2 = 5 against σ 2 = 4 is unremarkable. ✓
Worked example Example 3 — Cell C: build a
t statistic with unknown σ
n = 25 , sample mean x ˉ = 103 , sample sd s = 10 . Test whether μ = 100 .
Forecast: Z or t ? And what df?
Step 1. Standard error = s / n = 10/ 25 = 10/5 = 2 .
Why this step? x ˉ has spread σ / n ; since σ is unknown we use its estimate s / n .
Step 2. t = s / n x ˉ − μ = 2 103 − 100 = 1.5 .
Why this step? We standardise the mean, but the denominator is now random (built from s ), which is exactly what makes this a t , not a Z .
Step 3. Reference distribution: t 24 , since k = n − 1 = 24 .
Why this step? The chi-squared hidden in the denominator, σ 2 ( n − 1 ) s 2 , carries n − 1 df — see Hypothesis Testing for how this t becomes a p -value.
Verify: with 24 df, t 24 is almost indistinguishable from Z ; a value of 1.5 is well inside the usual ± 2 band, so we would not reject μ = 100 . ✓
Worked example Example 4 — Cell D:
t 2 is an F
t ∼ t 20 . Identify the distribution of t 2 .
Forecast: it becomes an F — but with which two df?
Step 1. Write t = V / k Z with Z ∼ N ( 0 , 1 ) and V ∼ χ 20 2 (its df is k = 20 ), so t 2 = V /20 Z 2 .
Why this step? Squaring kills the sign and turns the numerator into Z 2 .
Step 2. Z 2 ∼ χ 1 2 , so t 2 = V /20 Z 2 /1 = F 1 , 20 .
Why this step? One squared standard normal is a chi-squared with one df; matching the F definition gives numerator df = 1 , denominator df = 20 .
Verify: cross-check via means. E [ F 1 , 20 ] = d 2 − 2 d 2 = 18 20 ≈ 1.111 . And E [ t 20 2 ] = Var ( t 20 ) = k − 2 k = 18 20 ≈ 1.111 (since E [ t ] = 0 ). The two agree. ✓
Worked example Example 5 — Cell E:
F for two variances + reciprocal swap
Sample 1: s 1 2 = 12 , n 1 = 8 . Sample 2: s 2 2 = 3 , n 2 = 6 . Assume equal true variances. Give F and its df, then the value if you had put sample 2 on top.
Forecast: guess F and guess whether swapping gives 1/ F .
Step 1. F = s 2 2 s 1 2 = 3 12 = 4 .
Why this step? Under equal true variances, s 2 2 / σ 2 s 1 2 / σ 2 = s 2 2 s 1 2 , and each s 2 / σ 2 is a χ 2 /df — exactly the F recipe.
Step 2. Df: numerator d 1 = n 1 − 1 = 7 , denominator d 2 = n 2 − 1 = 5 . So F ∼ F 7 , 5 .
Why this step? Each sample variance carries its own n − 1 ; the top variance's df is the numerator df.
Step 3. Swap: s 1 2 s 2 2 = 12 3 = 0.25 = 4 1 , distributed as F 5 , 7 .
Why this step? Reciprocal symmetry: 1/ F d 1 , d 2 ∼ F d 2 , d 1 — inverting the ratio swaps the df.
Verify: 0.25 × 4 = 1 , confirming the two statistics are exact reciprocals, and the df have indeed swapped from ( 7 , 5 ) to ( 5 , 7 ) . This F machinery is what ANOVA runs internally. ✓
Worked example Example 6 — Cell F: degenerate & boundary inputs
(a) A sample gives s 2 = 0 . What is the χ 2 statistic σ 2 ( n − 1 ) s 2 ? (b) Does Var ( t 2 ) exist? (c) Does E [ F 4 , 2 ] exist?
Forecast: which of these blow up or vanish?
Step 1 (a). s 2 = 0 means every data point equals x ˉ ; the statistic is σ 2 ( n − 1 ) ⋅ 0 = 0 .
Why this step? Zero spread means zero total squared deviation — the smallest a χ 2 can be, sitting exactly at the left edge 0 of its support.
Step 2 (b). Var ( t k ) = k − 2 k requires k > 2 . At k = 2 the denominator is 0 : the variance is infinite / undefined .
Why this step? With so few df the fat tails are so heavy that the squared values don't have a finite average — the mean E [ t 2 ] = 0 still exists (needs only k > 1 ), but the spread does not.
Step 3 (c). E [ F d 1 , d 2 ] = d 2 − 2 d 2 needs d 2 > 2 . Here d 2 = 2 gives 0 2 : the mean is undefined .
Why this step? Only the denominator df controls whether the mean exists (a small χ 2 on the bottom can be near zero, sending the ratio to ∞ ).
Verify: the three edges line up with the parenthetical conditions in the parent's formula boxes: E [ t ] needs k > 1 , Var ( t ) needs k > 2 , E [ F ] needs d 2 > 2 . ✓
Worked example Example 7 — Cell G: limiting behaviour as df
→ ∞
As the df grows without bound, what happens to (a) t k , (b) Var ( t k ) , (c) k χ k 2 , and (d) F d 1 , d 2 ?
Forecast: which of these converge to a bell, which to the number 1 , and which collapse to a spike?
Step 1 (a). t k = V / k Z with V ∼ χ k 2 . As k → ∞ , V / k → 1 , so t k → Z ∼ N ( 0 , 1 ) .
Why this step? V / k is an average of k independent Z i 2 's, each mean 1 ; by the law of large numbers this average locks onto 1 , so the random denominator stops being random. (This is the "average settling to its mean" law, distinct from the Central Limit Theorem which describes the shape of that average's fluctuations.)
Step 2 (b). Var ( t k ) = k − 2 k → 1 as k → ∞ .
Why this step? k − 2 k = 1 − 2/ k 1 → 1 − 0 1 = 1 , matching Var ( Z ) = 1 . The fat tails shrink to normal tails.
Step 3 (c). k χ k 2 → 1 (in probability).
Why this step? Same law of large numbers — the mean of k terms each averaging 1 .
Step 4 (d). F d 1 , d 2 = V / d 2 U / d 1 → 1 as both d 1 , d 2 → ∞ : numerator U / d 1 → 1 and denominator V / d 2 → 1 , so the ratio collapses onto the single value 1 (its spread → 0 ).
Why this step? Each χ 2 divided by its own df is exactly the object from Step 3, which pins to 1 ; a ratio of two things both pinned to 1 is pinned to 1 . Its mean E [ F d 1 , d 2 ] = d 2 − 2 d 2 → 1 confirms the centre, and the density narrows to a spike at 1 — this is why an F near 1 means "equal variances."
Verify: check the trend numerically. Var ( t 10 ) = 8 10 = 1.25 , Var ( t 100 ) = 98 100 ≈ 1.0204 — marching toward 1 . And E [ F 10 , 10 ] = 8 10 = 1.25 while E [ F 100 , 100 ] = 98 100 ≈ 1.0204 — also marching to 1 . ✓
The figure shows all three limits at once: the black t curves lose their heavy tails and sink onto the red normal curve as k climbs (t k → N ( 0 , 1 ) ), while the inset dashed curves for χ k 2 / k and F k , k narrow onto the value 1 — the visual meaning of "everything settles to 1 ."
Worked example Example 8 — Cell H: real-world word problem
A coffee machine is supposed to pour 250 mL. An inspector pulls n = 16 cups, finds an average of x ˉ = 246 mL and a sample standard deviation s = 8 mL. Set up and evaluate the appropriate test statistic and name its reference distribution.
Forecast: which quantities map to n , x ˉ , s , μ ? Is σ known?
Step 1. Extract: μ = 250 (the claimed mean), x ˉ = 246 , s = 8 , n = 16 . True σ is not given.
Why this step? "Supposed to pour 250 " is the hypothesised mean; the sd we have is a sample sd, so σ is unknown → this is a t situation, not Z .
Step 2. Standard error = s / n = 8/ 16 = 8/4 = 2 mL.
Why this step? The mean of 16 cups wobbles 16 = 4 times less than a single cup.
Step 3. t = s / n x ˉ − μ = 2 246 − 250 = 2 − 4 = − 2 .
Why this step? Negative because the machine underfills; magnitude 2 measures how many standard errors below target.
Step 4. Reference distribution t 15 (k = n − 1 = 15 ).
Why this step? The estimated standard deviation s hides a χ n − 1 2 (we computed x ˉ from the same data, spending one df on the constraint ∑ ( x i − x ˉ ) = 0 ), so with n = 16 the t carries 16 − 1 = 15 df — never n .
Verify: units cancel correctly — mL / mL leaves t dimensionless, as any test statistic must be. A value of − 2 against t 15 is near the 5% two-sided boundary, so the underfill is borderline-significant. ✓
Worked example Example 9 — Cell I: additivity of independent chi-squareds
U ∼ χ 4 2 and W ∼ χ 9 2 are independent. What is the distribution of U + W , and its mean and variance?
Forecast: guess the combined df.
Step 1. U + W ∼ χ 4 + 9 2 = χ 13 2 .
Why this step? U is a sum of 4 squared normals, W a sum of 9 independent ones; stacking them gives 13 independent squared normals — literally the definition of χ 13 2 .
Step 2. E [ U + W ] = 13 and Var ( U + W ) = 2 ⋅ 13 = 26 .
Why this step? Apply E = k , Var = 2 k with k = 13 .
Verify: additivity check via the parts: E [ U ] + E [ W ] = 4 + 9 = 13 ✓ and (independence) Var ( U ) + Var ( W ) = 8 + 18 = 26 ✓. Both routes agree. This additivity is why pooling sums-of-squares in ANOVA keeps producing chi-squareds. ✓
Worked example Example 10 — Cell J: the exam twist (
t variance, F mean, existence)
(a) Give Var ( t 5 ) . (b) Give E [ F 6 , 10 ] . (c) For t 30 , by how much (percent) does its variance exceed the normal's?
Forecast: all three plug into the ( k − 2 ) / ( d 2 − 2 ) formulas — watch the denominators.
Step 1 (a). Var ( t 5 ) = k − 2 k = 3 5 ≈ 1.6667 .
Why this step? Here k = 5 > 2 so the variance exists; the answer exceeds 1 , confirming fatter-than-normal tails.
Step 2 (b). E [ F 6 , 10 ] = d 2 − 2 d 2 = 8 10 = 1.25 .
Why this step? Only the denominator df d 2 = 10 enters the mean; 10 > 2 so it exists. The numerator df d 1 = 6 never appears in the mean — a classic trap.
Step 3 (c). Var ( t 30 ) = 28 30 ≈ 1.0714 , so it exceeds the normal's variance of 1 by about 7.14% .
Why this step? 28 30 − 1 = 28 2 = 14 1 ≈ 0.0714 — a 7% excess, small because 30 df is already close to normal.
Verify: all denominators satisfy their existence conditions (k > 2 , d 2 > 2 ), so none of these is undefined — contrast with Ex 6 where they were. And Var ( t 5 ) = 1.6667 > Var ( t 30 ) = 1.0714 > 1 , correctly showing more df ⇒ closer to normal. ✓
Recall Rapid self-test
Which cell: "n = 20 , unknown σ , test the mean"? ::: Cell C — build a t 19 .
t ∼ t 9 ; distribution of t 2 ? ::: F 1 , 9 (Cell D).
Does Var ( t 2 ) exist? ::: No — needs k > 2 (Cell F).
χ 3 2 + χ 5 2 independent equals? ::: χ 8 2 (Cell I).
E [ F 5 , 10 ] ? ::: 10/8 = 1.25 (Cell J).
Mnemonic Which reference distribution?
"One normal → t . One sum-of-squares → χ 2 . Two of them → F ."
Count how many variance-type pieces are in play, and whether σ is estimated.