The normal curve, spread, counting and tables, built from the ground up. Tap any tile to jump to its section. Each section has a link back here.
| Symbol | Name | What it means |
|---|---|---|
| x | — | Any value on your measurement scale (a tree height, an age, a score) |
| μ | mu | The mean (average) of the data |
| σ | sigma (lowercase) | The standard deviation, the typical distance from the mean |
| σ² | — | The variance, the standard deviation squared |
| Σ | sigma (capital) | "Run this calculation once for each value of the counter, then add the results." An instruction, not a number. The counter (usually n or k) is the only thing that changes between runs. Every other letter stays fixed. |
| n | — | A counter (0, 1, 2, 3…), or a count of data points |
| N | — | Size of a whole population |
| e | — | 2.718281828…, the natural growth constant |
| π | pi | 3.14159265…, the circle constant |
| √ | radical | Square root |
| ! | factorial | 4! = 4 × 3 × 2 × 1 = 24 |
| z | — | How many standard deviations x sits from the mean |
| f(x) | — | The height of the curve at x |
| Φ(z) | Phi (capital) | The area to the left of z, a proportion between 0 and 1 |
Σ and σ are the same Greek letter in different cases doing completely different jobs. Same for φ (height) and Φ (area).
The normal distribution has a small family of formulas. Each one answers a different question, and each builds on the one before it:
| Formula | What it gives you | Use it when you need |
|---|---|---|
| Standard deviation, σ | How spread out the values are | The bell's width, before you can draw anything |
| z-score, z | Where one value sits, counted in standard deviations | To compare values from different bells, or to use a z-table |
| The curve, f(x) | The bell itself, and its height at any point | To graph it, or see how crowded values are at one spot (a height is not a probability) |
| Area to the left, Φ(z) | The probability of landing below a value | "What percent scored under 110?" |
| Area to the right, 1 − Φ(z) | The probability of landing above a value | "What percent scored over 110?" |
| Area between, Φ(zb) − Φ(za) | The probability of landing in a range | "What percent scored between 90 and 110?" |
Work through them in order below. The formula sits right under the graph, with the next one peeking out beneath it: scroll, swipe, or tap to move to it. The boxes under the formula hold its values, stay put as you move between formulas, and update the graph as you go.
Scroll, swipe, or tap the formula for the next one. It loops, so scrolling up from the first takes you to the last.
Standard deviation must be a number greater than 0.
Slide, type, or tap the graph to move the points. Your values are saved in this browser.
Every bell is set by two numbers: where its center sits (μ) and how spread out it is (σ). Here's what σ is actually doing:
Coin check: every flip lands exactly 1 away from its mean of 0, so σ = √(100 ÷ 100) = 1.
Your numbers
A z value of 1 is 1 standard deviation from the mean. On this scale every bell looks the same; changing σ only rescales the height.
Heads counts +1 and tails counts −1. One flip has a mean of 0 and always lands exactly 1 away from it, so one flip's standard deviation is 1.
Each bar is one flip's deviation: +1 or −1, always exactly 1 from the mean. The line is the running total, what's left over after heads and tails cancel.
Squared deviations: 100 flips × 1 = 100. Standard deviation of one flip = √(100 ÷ 100) = 1.
Bars are your samples' totals. The line is the exact count you'd expect from Pascal's triangle, which is the bell with σ = 1 × √100 = 10.
First convert your value to z:
Then, general form:
Written out, with the structure intact in every slot:
| Piece | Job |
|---|---|
| \((-1)^n\) | Produces the alternating + − + − signs |
| \(z^{2n+1}\) | Gives the odd exponents 1, 3, 5, 7, 9 |
| \(2^n\) | Comes from the ½ in the exponent raised to the nth power |
| \(n!\) | Comes from the exponential series |
| \((2n+1)\) | Comes from integrating; always matches the exponent above it |
Nothing in this formula is a rounded decimal. It gives the proportion of all values falling below x.
| Value | How you get it |
|---|---|
| x | Given in the problem. The cutoff you care about. |
| μ | Add every data point, divide by how many there are. Often given directly. |
| σ | Computed from the data (see Section 8). Often given directly. |
| z | Computed: (x − μ) ÷ σ. Never given. |
| 1/√(2π) | An exact constant. Never changes. Decimal value below. |
| 1/2 | Exact. The entire left half of the curve. |
| 2·1·3, 4·2·5, 8·6·7, 16·24·9 | Exact. Built from 2ⁿ · n! · (2n+1). See Section 5. |
Use this only when you reach for a calculator. The formula itself keeps the exact form.
Scales the curve so its total area equals exactly 1, which is what makes the output a valid percentage. Rounding it to 0.4 throws the 4th decimal off.
Data: μ = 251, σ = 50, cutoff x = 187
z = (187 − 251) ÷ 50 = −64 ÷ 50 = −1.28
Negative means x is below the mean. Positive means above.
| Part | What it does |
|---|---|
| \((x - \mu)\) | How far your value sits from the mean |
| \((x - \mu)^2\) | Squared: removes the sign so left and right are symmetric, and makes distance punishing rather than linear |
| \(\div\, 2\sigma^2\) | Converts raw distance into distance measured in standard deviations |
| minus sign | Makes the exponent most negative when you are farthest out |
| \(e^{(\ldots)}\) | Exponential decay: maximum at the mean (e⁰ = 1), dropping fast as you move away |
| \(\frac{1}{\sigma\sqrt{2\pi}}\) | Scaling constant so total area equals 1 |
To find the total area you square it, which turns it into a 3D volume whose height depends on x² + y², the distance from the origin squared. That makes the surface circular, and circles bring π.
| Part | What it does |
|---|---|
| \(z\) | First term: the rough area, before corrections |
| \(-\,z^3/(2\cdot1\cdot3)\) | First correction, pulls the estimate down |
| \(+\,z^5/(4\cdot2\cdot5)\) | Second correction, pushes it back up |
| \(-\,z^7/(8\cdot6\cdot7)\) | Third correction, smaller |
| \(+\,z^9/(16\cdot24\cdot9)\) | Fourth correction, smaller still |
| \(\times\, 1/\sqrt{2\pi}\) | Scales so the full curve totals 1 |
| \(+\,1/2\) | Adds the entire left half of the curve |
The terms alternate sign and shrink fast, so the running total closes in from both sides.
Term rule (n = which term you're on, starting at 0):
| n | 2ⁿ | n! | (2n+1) | Denominator |
|---|---|---|---|---|
| 0 | 1 | 1 | 1 | 1 |
| 1 | 2 | 1 | 3 | 6 |
| 2 | 4 | 2 | 5 | 40 |
| 3 | 8 | 6 | 7 | 336 |
| 4 | 16 | 24 | 9 | 3456 |
| 5 | 32 | 120 | 11 | 42240 |
| 6 | 64 | 720 | 13 | 599040 |
The t in the exponent is squared, so powers of u give t⁰, t², t⁴, t⁶… Integration then adds 1 to each, making them odd: z¹, z³, z⁵, z⁷…
No powers or factorials needed:
Accuracy: 5 terms is enough up to about |z| = 1. Use 7 terms out to |z| = 1.5.
Problem: μ = 251, σ = 50. What proportion falls between 187 and 229?
Convert: z = (187 − 251) ÷ 50 = −1.28
Substitute 1.28 into every z slot:
Powers (each is the prior × 1.6384, which is 1.28²):
| Power | Value |
|---|---|
| 1.28¹ | 1.2800000 |
| 1.28³ | 2.0971520 |
| 1.28⁵ | 3.4359738 |
| 1.28⁷ | 5.6294995 |
| 1.28⁹ | 9.2233720 |
| 1.28¹¹ | 15.1115727 |
Divide each:
| Division | Term |
|---|---|
| 1.2800000 ÷ 1 | +1.2800000 |
| 2.0971520 ÷ 6 | −0.3495253 |
| 3.4359738 ÷ 40 | +0.0858993 |
| 5.6294995 ÷ 336 | −0.0167545 |
| 9.2233720 ÷ 3456 | +0.0026688 |
| 15.1115727 ÷ 42240 | −0.0003578 |
| Add | 1.0019305 |
Convert: z = (229 − 251) ÷ 50 = −0.44
Powers (each is the prior × 0.1936):
| Power | Value |
|---|---|
| 0.44¹ | 0.4400000 |
| 0.44³ | 0.0851840 |
| 0.44⁵ | 0.0164916 |
| 0.44⁷ | 0.0031928 |
Divide each:
| Division | Term |
|---|---|
| 0.4400000 ÷ 1 | +0.4400000 |
| 0.0851840 ÷ 6 | −0.0141973 |
| 0.0164916 ÷ 40 | +0.0004123 |
| 0.0031928 ÷ 336 | −0.0000095 |
| Add | 0.4262055 |
0.3300 − 0.1003 = 0.2297
About 23%. With 500 trees, that's 0.2297 × 500 ≈ 115 trees.
| Asked | Do this |
|---|---|
| Below a value | Φ(z) |
| Above a value ("at least") | 1 − Φ(z) |
| Between two values | Φ(zlarger) − Φ(zsmaller) |
| Count instead of percent | Multiply the result by your total |
Negative z: Φ(−z) = 1 − Φ(z)
Everything below the upper bound includes everything below the lower bound, which you don't want. Subtracting peels it off. Same logic as pages read = end page − start page.
Subtract the brackets directly and skip the 1/2 and the flipping entirely.
Population (you have every value):
Sample (you have a subset, the usual case):
In plain English: the square root of the average of the squared deviations from the mean.
The sample mean is computed from your own data, so it sits closer to your points than the true mean does. Σ(x − x̄)² is mathematically the smallest possible sum, so dividing by n understates the spread every time. Dividing by n − 1 corrects that bias.
Start with the regular standard deviation formula, then simplify from what you already know to get the deviation between groups. All you need is σ and how many people are in each group.
√(100 × 10² ÷ 100²) = √(10,000 ÷ 10,000) = √1 = 1. One person wanders by 10, but the average of 100 people wanders by only 1.
Applies only when data is bell-shaped / approximately normal. Memorize these.
| Within | Percentage |
|---|---|
| 1 standard deviation | 68% |
| 2 standard deviations | 95% |
| 3 standard deviations | 99.7% |
| Region | % |
|---|---|
| Mean to 1 SD | 34% |
| 1 SD to 2 SD | 13.5% |
| 2 SD to 3 SD | 2.35% |
| Beyond 3 SD | 0.15% |
| Half the curve | 50% |
Those four add to 50%, half the curve. Everything else is built from them.
Common derived values: above 1 SD = 16%. Above 2 SD = 2.5%. Below −1 SD = 16%.
Use Chebyshev's inequality, which works for any distribution: at least 75% within 2 SD, at least 89% within 3 SD.
With n = 10: split 5 and 5. Q1 is the 3rd value, Q3 is the 8th. No data point is shared between halves.
It uses the five-number summary: min, Q1, median, Q3, max. Every one of them is a position in the sorted list. The mean and SD never appear. That's the point: one extreme value can drag a mean around, but it can't move a median.
| n | Halves | Median | Q1 / Q3 |
|---|---|---|---|
| Even (n = 26) | 13 and 13 | Average of the 13th and 14th values | 7th value of each half |
| Odd (n = 11) | 5 and 5, median left out of both | The 6th value | 3rd value of each half |
A convention from John Tukey, who invented the boxplot, not a law of math. On bell-shaped data the fences land at about ±2.7 SD, so only about 0.7% of normal data gets flagged. "Outlier" means rarer than roughly 1 in 140.
| Step | Work | Result |
|---|---|---|
| Median | (13th + 14th) ÷ 2 = (66 + 67) ÷ 2 | 66.5 |
| Q1 | 7th value of the lower 13 | 59 |
| Q3 | 7th value of the upper 13 | 71 |
| IQR | 71 − 59 | 12 |
| 1.5 × IQR | 1.5 × 12 | 18 |
| Lower fence | 59 − 18 | 41 |
| Upper fence | 71 + 18 | 89 |
| Outliers | below 41 or above 89 | 37, 38, 93 |
| Whiskers | last real values inside the fences | 44 and 87 |
The middle of 13 values is position 7 (6 below it, 6 above). Counting to the 8th gives Q1 = 61 instead of 59, and every fence and outlier after it shifts.
Use when you have a fixed number of yes/no trials, each with the same chance of success, and you want the probability of getting a certain number of successes.
| Symbol | Meaning |
|---|---|
| n | Number of trials. Fixed, never changes. |
| k | Number of successes you're asking about. This is what Σ varies. |
| p | Chance of success on one trial |
| 1 − p | Chance of failure on one trial |
| n − k | Number of failures |
Exactly k successes:
k or more successes: run it for each k and add.
Three parts, all multiplied (never added inside a term):
Count the smaller group, successes or failures, whichever is fewer. Multiply down from n, as many factors as items you're placing, then divide by that many factorial.
| Items to place | Count |
|---|---|
| 1 | n |
| 2 | n(n−1) ÷ 2! |
| 3 | n(n−1)(n−2) ÷ 3! |
| 4 | n(n−1)(n−2)(n−3) ÷ 4! |
| 5 | n(n−1)(n−2)(n−3)(n−4) ÷ 5! |
Placing items one at a time finds each finished pattern once per ordering of those items. r items have r! orderings, so every pattern is counted exactly r! times. Uniform overcount, so one clean division fixes it.
Example, 3 failures in 5 trials: 5 × 4 × 3 = 60 pickings ÷ 3! = 6 → 10 patterns
Shortcut check: 4 failures out of 6 = 2 successes out of 6. Count the 2: 6 × 5 ÷ 2 = 15. Much faster than 6 × 5 × 4 × 3 ÷ 24.
A machine makes good parts 70% of the time. In 6 parts, what is P(4 or more good)? n = 6, p = 0.7, and k runs 4, 5, 6. n stays 6 in every line.
| k | count | pk | (1−p)n−k | term |
|---|---|---|---|---|
| 4 | 6×5÷2! = 15 | 0.7⁴ = 0.240100 | 0.3² = 0.09 | 0.324135 |
| 5 | 6÷1! = 6 | 0.7⁵ = 0.168070 | 0.3¹ = 0.30 | 0.302526 |
| 6 | 6÷0! = 1 | 0.7⁶ = 0.117649 | 0.3⁰ = 1.00 | 0.117649 |
| Total | 0.7443 | |||
About 74.4%.
Add P(0) through P(n). It must equal exactly 1.00, because one of those outcomes has to happen. It only works if every term carries both successes and failures.
One trial has variance p(1 − p). The trials are independent, so their variances add: n trials give n · p(1 − p). Square root that for the SD, same last step as Section 8.
A machine makes a defective piston 1% of the time. Sample 80.
The SD describes how much the count bounces between batches. Run the sample over and over and the counts scatter (0, 1, 0, 2, 1…). Their average is 0.8 and their typical distance from 0.8 is 0.890.
| Defective in one batch | Chance |
|---|---|
| 0 | 44.75% |
| 1 | 36.16% |
| 2 | 14.43% |
| 3 | 3.79% |
The mean is 0.8, but the single most likely count is 0 (the mode). When a problem says "the mean of the relevant random variable" and "do not round," it wants 0.8, not a whole-number guess.
SD ÷ mean = 0.890 ÷ 0.8 ≈ 111% is the coefficient of variation, the same uncertainty stated relative to the estimate. When a question names "the standard deviation," it wants the absolute version: 0.890.
A team wins 64% of its games. Over 12 games, what is the chance it wins exactly 10? Ten or more?
n = 12, p = 0.64, 1 − p = 0.36, k runs 10, 11, 12
| k | count (smaller group) | pk | (1−p)n−k | term |
|---|---|---|---|---|
| 10 | 2 losses: 12×11÷2! = 66 | 0.011529 | 0.36² = 0.1296 | 0.098616 |
| 11 | 1 loss: 12 | 0.007379 | 0.36¹ = 0.36 | 0.031876 |
| 12 | 0 losses: 1 | 0.004722 | 0.36⁰ = 1 | 0.004722 |
| 10 or more | 0.135215 | |||
Exactly 10: 0.0986 (about 9.9%). Ten or more: 0.1352 (about 13.5%).
Cross-check with the mean and SD: expected wins = 12 × 0.64 = 7.68, SD = √(12 × 0.64 × 0.36) = 1.66. Ten wins sits about 1.4 SD above expected, which is why it happens only about 1 time in 7.
A contingency table sorts every person (or sample) by two variables at once. The expected frequency of a cell is the count you'd see if the two variables had nothing to do with each other.
"Independent" means knowing one variable tells you nothing about the other. So each row's share of the grand total should hold inside every column. If 60% of all samples are acidic, then 60% of the sandy ones should be acidic too: 0.60 × the sandy column total. That's row total ÷ grand total × column total, the same formula.
Observed counts, by pH and texture:
| Sandy | Loam | Clay | Total | |
|---|---|---|---|---|
| Acidic | 38 | 50 | 32 | 120 |
| Neutral / alkaline | 12 | 40 | 28 | 80 |
| Total | 50 | 90 | 60 | 200 |
Expected counts, if pH and texture were independent:
| Sandy | Loam | Clay | Total | |
|---|---|---|---|---|
| Acidic | 120×50÷200 = 30 | 120×90÷200 = 54 | 120×60÷200 = 36 | 120 |
| Neutral / alkaline | 80×50÷200 = 20 | 80×90÷200 = 36 | 80×60÷200 = 24 | 80 |
| Total | 50 | 90 | 60 | 200 |
Compare observed (O) to expected (E) in every cell: \(\chi^2 = \Sigma \frac{(O-E)^2}{E}\). The bigger it is, the less the data looks independent. Here: 2.13 + 0.30 + 0.44 + 3.20 + 0.44 + 0.67 ≈ 7.19, with degrees of freedom = (rows − 1) × (columns − 1) = 1 × 2 = 2.
The Central Limit Theorem. Take values from any distribution (skewed, flat, lumpy) and add many of them together independently. The distribution of that sum converges to a normal curve. The original shape is erased; only its mean and variance survive.
A single coin flip is uniform (0 or 1, equally likely), the least bell-like thing possible. But 100 flips summed is a bell. The shape wasn't in the coin; it emerged from adding.
For a sum to land at an extreme, every term has to cooperate, which is rare. For it to land in the middle, vastly more combinations get there. Counting those combinations produces the hump.
Income isn't a sum of small independent effects, so it's skewed, not normal. Always check that the problem says "bell-shaped" or "approximately normal" before using the empirical rule.
Why there's no simple area formula: e−t²/2 has no elementary antiderivative. Liouville proved this in the 1830s. That's why z-tables exist and why the area formula is a series instead of a clean expression.