Exercises — Gaussian - Normal distribution properties
This page is a self-test ladder. Each problem hides its full solution inside a collapsible callout — try first, then open. We climb from recognising a Gaussian to synthesising several properties at once. Every symbol used here is built in the parent note; if you see something unfamiliar, that note defines it.
Two symbols recur on this page, so we pin them down once:
Two reference values we lean on repeatedly:
The figure below is our decoder ring for every tail question on this page: the green area is (probability to the left of the red line at ), and the remaining area to the right is . Whenever a problem asks "what fraction exceed some value?", we are asking for that right-hand piece — so we compute .

Level 1 — Recognition
L1.1 Read off the parameters
Problem. A model's prediction error is . State its mean, variance, and standard deviation.
Recall Solution
The notation is : first slot is the mean, second slot is the variance (not the standard deviation).
- Mean .
- Variance .
- Standard deviation .
L1.2 Which curve is wider?
Problem. Two Gaussians: and . Same centre — which bell is wider, and by what factor is 's spread bigger than 's?
Recall Solution
Width is governed by the standard deviation , not the variance directly.
- , .
- is wider; its spread is times that of .
Level 2 — Application
L2.1 Standardize one value
Problem. Heights are (cm). Convert a height of cm into a -score.
Recall Solution
The ==-score== answers "how many standard deviations above the mean?" — it is exactly the recipe that turns into the standard normal from the definition above. So cm sits exactly above the mean.
L2.2 A tail probability
Problem. With , what fraction of people are taller than cm?
Recall Solution
From L2.1, . Because , we read the tail straight off the picture: About 2.28% — roughly 1 in 44. Why ? is the green area to the left of in the figure above. We want the right-hand piece, and the whole area is , so we subtract.
L2.3 Transform a Gaussian
Problem. . Let . Give 's distribution.
Recall Solution
Use affine closure: with .
- New mean: .
- New variance: . Sanity check: the spread scales by , so goes , i.e. variance . ✓
Level 3 — Analysis
L3.1 Interval from the empirical rule
Problem. Exam scores are . Give the central interval that contains about of students, and explain which rule you used.
Recall Solution
. The 68–95–99.7 rule says of the mass lies within . Why and not units? The rule is stated in units of , so we scale by the actual before adding to the mean.
The figure below shows exactly this: the butter-yellow band is the region , holding of the area, with the red markers at the two endpoints and the centre .

L3.2 Average of independent measurements
Problem. You take independent readings, each . Find the distribution of the average .
Recall Solution
Step 1 — sum (additive closure). Means add, and for independent variables variances add: Step 2 — divide (affine closure with ). The mean stays ; the variance shrinks to — averaging reduces spread. This is exactly the seed of the Central Limit Theorem.
L3.3 Middle-probability from two tails
Problem. . Find using .
Recall Solution
By symmetry . Why ? A CDF gives area to the left; subtracting the left endpoint's area leaves exactly the strip between them.
Level 4 — Synthesis
L4.1 Difference of two Gaussians
Problem. Sensor and sensor are independent. Find the distribution of the difference , and the probability the difference is negative, . Use .
Recall Solution
Step 1 — write as a linear combination. . Step 2 — mean. . Step 3 — variance. Independence means variances add, and the contributes , so: Note the variances add even though we subtract the variables — subtraction cannot make spread smaller. So , . Step 4 — standardize and read the tail. Since , standardizing gives a : About 25.3% chance reads below .
L4.2 Solve for a threshold
Problem. Package weights are (grams). We want the top heaviest flagged. Above what weight should we flag? (Recall .)
Recall Solution
Step 1 — translate the tail into a CDF value. "Top " is a right-tail: . But our table gives , which is left-area. Since left-area and right-area together make the whole (), the left-area up to must be . Why flip to the complement? Tables list (area to the left), so we always convert a "fraction above" into "fraction below" before looking up — that is what closes the loop between the tail we care about and the CDF we can read. Step 2 — look up . From the table, . Step 3 — un-standardize. Invert with : Flag anything above g. This "find from a probability, then un-standardize" pattern powers threshold-setting in Naive Bayes Classifier and detection systems.
Level 5 — Mastery
L5.1 MLE of the mean from data
Problem. Data () are assumed i.i.d. from . Compute the MLE and the (biased) MLE .
Recall Solution
Where the formulas come from (intuition + calculus sketch). The likelihood is the product of the density at every data point; taking a turns that product into a sum, giving the log-likelihood To maximize, set each partial derivative to zero.
- For : only the last term depends on , and . Setting gives , i.e. . Intuition: the value that makes the total signed deviation cancel is precisely the balancing point — the sample mean.
- For : solves to . Intuition: wants to equal the average squared distance of the data from the fitted centre. (Full derivation in Maximum Likelihood Estimation.) Step 1 — . Sum . So . Step 2 — squared deviations from : . Sum . Step 3 — biased variance. . For comparison, the unbiased estimate (Bessel's correction, divide by ) is .
L5.2 Prove additive closure via MGF
Problem. Let , , independent. Using the moment generating function , prove .
Recall Solution
Key fact. For independent variables, the MGF of the sum is the product of MGFs (the expectation of a product factorises). Multiply exponentials by adding exponents: This is exactly the MGF of . Since the MGF uniquely determines the distribution, the claim holds.
L5.3 Estimate a tail without a table
Problem. A control system alarms when a signal exceeds . Using only the empirical rule ( within ), estimate the probability of a false alarm .
Recall Solution
The rule says , so the total outside is . By symmetry this splits equally between the two tails: About — roughly 1 false alarm per 667 readings. Why halve? The Gaussian is symmetric about , so the right tail and left tail carry identical mass; splitting the leftover evenly is exact for a symmetric distribution.
Recall Self-check: name the property each level relied on
L2 transform ::: Affine closure — L3.2 average ::: Additive closure (sum) then affine scaling by L4.1 difference ::: Additive closure with coefficient ; variances add L5.1 estimates ::: Maximum Likelihood: , L5.3 tail ::: Symmetry + empirical rule, halving the two-tail mass
Where these go next: the summing/averaging machinery underlies Central Limit Theorem and Linear Regression; threshold-finding feeds Bayesian Inference and Kalman Filters; the multivariate versions live in Multivariate Gaussian and Principal Component Analysis. For sampling and diagnostics see Box-Muller Transform and Q-Q Plots.