Study guide

8.2 Probability Distributions: Binomial & Normal Models

NBPTS Adolescence & Young Adulthood / Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Number Systems & Number Theory

1.1 Real and Complex Number Systems & Field Axioms 1.2 Number Theory, Divisibility, Primes & Modular Arithmetic 1.3 Sequences, Series & Summation Notation

2 Chapter 2: Polynomials & Algebraic Structures

2.1 Polynomial Operations, Factoring & Factor/Remainder Theorems 2.2 The Fundamental Theorem of Algebra & Polynomial Roots 2.3 Rational Expressions, Radical Equations & Inequalities 2.4 Matrices, Systems of Equations & Linear Algebra

3 Chapter 3: Functions & Functional Analysis

3.1 Foundations of Functions: Domain, Range & Notation 3.2 Function Transformations, Operations, Composition & Inverses 3.3 Exponential and Logarithmic Functions & Applications 3.4 Rational Functions, Asymptotes & Discontinuities

4 Chapter 4: Trigonometry & Periodic Phenomena

4.1 Angle Measure, Radians & The Unit Circle 4.2 Trigonometric Graphs, Amplitude, Period & Phase Shifts 4.3 Trigonometric Identities & Solving Trigonometric Equations 4.4 Laws of Sines and Cosines, Vectors & Polar Coordinates

5 Chapter 5: Geometry & Measurement

5.1 Axiomatic Geometry, Congruence, Similarity & Proof 5.2 Circle Theorems: Tangents, Chords, Secants & Angles 5.3 2D & 3D Measurement: Area, Surface Area & Volume 5.4 Coordinate Geometry & Geometric Transformations

6 Chapter 6: Single-Variable Calculus

6.1 Limits, Continuity & Average vs. Instantaneous Rate of Change 6.2 Differentiation Rules, Chain Rule & Implicit Differentiation 6.3 Applications of Derivatives: Curve Sketching, Extrema & Optimization 6.4 Definite & Indefinite Integrals, Riemann Sums & FTC 6.5 Volumes of Solids of Revolution: Disk, Washer & Shell Methods

7 Chapter 7: Statistics & Data Analysis

7.1 Descriptive Statistics, Data Distributions & Visual Displays 7.2 Bivariate Data, Scatterplots, Correlation & Linear Regression 7.3 Study Design, Sampling Methods & Sources of Bias 7.4 Inferential Statistics: Confidence Intervals & Hypothesis Testing

8 Chapter 8: Probability & Discrete Mathematics

8.1 Principles of Probability, Conditional Probability & Independence 8.2 Probability Distributions: Binomial & Normal Models 8.3 Combinatorics: Permutations, Combinations & Binomial Theorem 8.4 Graph Theory, Networks, Trees & Algorithms

9 Chapter 9: Mathematical Reasoning, Proof & Modeling

9.1 Propositional Logic, Truth Tables & Quantifiers 9.2 Proof Techniques & Mathematical Induction 9.3 The Mathematical Modeling Cycle & Secondary Applications 9.4 Historical Development of Mathematical Ideas & Cultural Contributions 9.5 Precise Communication of Mathematical Ideas, Definitions & Justification

10 Chapter 10: Secondary Mathematics Pedagogy & NBPTS Standards

10.1 The NBPTS Five Core Propositions & EAYA Mathematics Standards 10.2 Standards for Mathematical Practice & Productive Classroom Discourse 10.3 Formative Assessment, Student Error Analysis & Misconceptions 10.4 Component 1 Assessment Structure & Constructed-Response Strategy

8.2 Probability Distributions: Binomial & Normal Models

Key Takeaways Explain This Topic AI

A discrete random variable X maps outcomes to real numbers and is governed by a probability mass function (PMF) p(x) with p(x) ≥ 0 and ∑ p(x) = 1, featuring expected value E[X] = μ = ∑ x p(x) and variance Var(X) = σ² = E[X²] - (E[X])².

A Binomial experiment requires the four BINS conditions: Binary outcomes (Success/Failure), Independent trials, fixed Number of trials (n), and Same probability of success (p); its PMF is P(X = k) = C(n, k) p^k (1 - p)^(n - k) with mean μ = np and standard deviation σ = √(np(1 - p)).

A continuous random variable is characterized by a probability density function (PDF) f(x) ≥ 0 with total area ∫ f(x) dx = 1; the probability of any single point is zero (P(X = c) = 0), so interval probabilities P(a ≤ X ≤ b) = ∫_a^b f(x) dx are identical whether endpoints are open or closed.

The Normal distribution N(μ, σ) is symmetric and bell-shaped, governed by the Empirical Rule (68-95-99.7% within 1, 2, and 3 standard deviations); standardizing via z = (x - μ) / σ maps X to the standard normal distribution Z ~ N(0, 1).

The Normal model approximates the Binomial distribution when np ≥ 10 and n(1 - p) ≥ 10; accurate discrete-to-continuous conversion requires a continuity correction of ±0.5 to adjust discrete integer boundaries to continuous area intervals.

Last updated: September 2026

8.2 Probability Distributions: Binomial & Normal Models

Probability distributions bridge theoretical chance and applied statistical inference by assigning probabilities to numerical values of random variables. For secondary mathematics educators, mastering discrete and continuous models is essential for guiding students from counting permutations and combinations to analyzing real-world sampling distributions. Understanding the structural properties of Binomial and Normal distributions—along with their asymptotic connection via the Central Limit Theorem—allows teachers to address common misconceptions regarding discrete endpoints, continuity corrections, and probability densities.

1. Discrete Random Variables, PMFs, Expectation & Variance

A random variable X X X is a measurable function mapping elements of a sample space S S S to the real numbers: X : S → R X: S \to \mathbb{R} X : S → R . A random variable is discrete if its range (support) is finite or countably infinite.

Probability Mass Function (PMF)

The distribution of a discrete random variable is completely specified by its probability mass function p ( x ) = P ( X = x ) p(x) = P(X = x) p ( x ) = P ( X = x ) , which must satisfy two foundational properties:

p ( x ) ≥ 0 p(x) \ge 0 p ( x ) ≥ 0 for all x ∈ R x \in \mathbb{R} x ∈ R .

∑ x p ( x ) = 1 \sum_{x} p(x) = 1 ∑ x ​ p ( x ) = 1 , where the summation extends over all possible values of X X X .

Expected Value (Mean) of a Discrete Random Variable

The expected value (or mathematical expectation) E [ X ] E[X] E [ X ] , denoted μ \mu μ , is the probability-weighted average of all possible values: E [ X ] = μ = ∑ x x ⋅ p ( x ) E[X] = \mu = \sum_{x} x \cdot p(x) E [ X ] = μ = x ∑ ​ x ⋅ p ( x )

Properties of Expectation (Linearity): For any constants a , b ∈ R a, b \in \mathbb{R} a , b ∈ R and random variables X , Y X, Y X , Y :

E [ a X + b ] = a E [ X ] + b E[aX + b] = a E[X] + b E [ a X + b ] = a E [ X ] + b

E [ X + Y ] = E [ X ] + E [ Y ] E[X + Y] = E[X] + E[Y] E [ X + Y ] = E [ X ] + E [ Y ] (holds universally, even if X X X and Y are dependent).

Variance and Standard Deviation

The variance Var ⁡ ( X ) \operatorname{Var}(X) Var ( X ) , denoted σ 2 \sigma^2 σ 2 , measures the expected squared dispersion around the mean: Var ⁡ ( X ) = σ 2 = E [ ( X − μ ) 2 ] = ∑ x ( x − μ ) 2 ⋅ p ( x ) \operatorname{Var}(X) = \sigma^2 = E[(X - \mu)^2] = \sum_{x} (x - \mu)^2 \cdot p(x) Var ( X ) = σ 2 = E [( X − μ ) 2 ] = x ∑ ​ ( x − μ ) 2 ⋅ p ( x )

Expanding the squared binomial yields the standard computational shortcut: Var ⁡ ( X ) = E [ X 2 − 2 μ X + μ 2 ] = E [ X 2 ] − 2 μ E [ X ] + μ 2 = E [ X 2 ] − ( E [ X ] ) 2 \operatorname{Var}(X) = E[X^2 - 2\mu X + \mu^2] = E[X^2] - 2\mu E[X] + \mu^2 = E[X^2] - (E[X])^2 Var ( X ) = E [ X 2 − 2 μ X + μ 2 ] = E [ X 2 ] − 2 μ E [ X ] + μ 2 = E [ X 2 ] − ( E [ X ] ) 2

where E [ X 2 ] = ∑ x x 2 ⋅ p ( x ) E[X^2] = \sum_{x} x^2 \cdot p(x) E [ X 2 ] = ∑ x ​ x 2 ⋅ p ( x ) . The standard deviation is σ = Var ⁡ ( X ) \sigma = \sqrt{\operatorname{Var}(X)} σ = Var ( X ) ​ .

Variance Scaling Property: For constants a , b a, b a , b : Var ⁡ ( a X + b ) = a 2 Var ⁡ ( X ) ⟹ σ a X + b = ∣ a ∣ σ X \operatorname{Var}(aX + b) = a^2 \operatorname{Var}(X) \implies \sigma_{aX+b} = |a| \sigma_X Var ( a X + b ) = a 2 Var ( X ) ⟹ σ a X + b ​ = ∣ a ∣ σ X ​

2. The Binomial Distribution (BINS Framework)

The Binomial distribution models the number of successes in a sequence of independent Bernoulli trials.

The Four BINS Criteria

To establish that a random variable X X X follows a Binomial distribution, X ∼ B ( n , p ) X \sim B(n, p) X ∼ B ( n , p ) , educators and students verify the BINS acronym:

B — Binary Outcomes: Each trial results in exactly one of two mutually exclusive categories: Success ( S S S ) or Failure ( F F F ).

I — Independent Trials: The outcome of any individual trial does not alter the probabilities of subsequent trials.

N — Number of Trials Fixed: The total number of trials n n n is fixed in advance.

S — Same Probability of Success: The probability of success p = P ( S ) p = P(S) p = P ( S ) is constant on every single trial ( q = 1 − p = P ( F ) q = 1 - p = P(F) q = 1 − p = P ( F ) ).

The Binomial Probability Formula

For X ∼ B ( n , p ) X \sim B(n, p) X ∼ B ( n , p ) , the probability of obtaining exactly k k k successes in n n n trials (where k ∈ { 0 , 1 , 2 , … , n } k \in \{0, 1, 2, \dots, n\} k ∈ { 0 , 1 , 2 , … , n } ) is: P ( X = k ) = ( n k ) p k ( 1 − p ) n − k = n ! k ! ( n − k ) ! p k q n − k P(X = k) = \binom{n}{k} p^k (1 - p)^{n - k} = \frac{n!}{k!(n - k)!} p^k q^{n - k} P ( X = k ) = ( k n ​ ) p k ( 1 − p ) n − k = k ! ( n − k )! n ! ​ p k q n − k

Combinatorial Derivation: Any specific ordered sequence containing k k k successes and n − k n - k n − k failures (e.g., S S … S F F … F SS \dots SFF \dots F SS … SFF … F ) has probability p k ( 1 − p ) n − k p^k (1 - p)^{n - k} p k ( 1 − p ) n − k by independence. The binomial coefficient ( n k ) \binom{n}{k} ( k n ​ ) counts the number of distinct ways to choose which k k k of the n n n trial slots contain the successes.

Mean and Variance of the Binomial Distribution

Using indicator variables, express X = I 1 + I 2 + ⋯ + I n X = I_1 + I_2 + \dots + I_n X = I 1 ​ + I 2 ​ + ⋯ + I n ​ , where each I j ∼ Bernoulli ( p ) I_j \sim \text{Bernoulli}(p) I j ​ ∼ Bernoulli ( p ) with P ( I j = 1 ) = p P(I_j = 1) = p P ( I j ​ = 1 ) = p and P ( I j = 0 ) = 1 − p P(I_j = 0) = 1 - p P ( I j ​ = 0 ) = 1 − p . For each indicator:

E [ I j ] = 1 ( p ) + 0 ( 1 − p ) = p E[I_j] = 1(p) + 0(1 - p) = p E [ I j ​ ] = 1 ( p ) + 0 ( 1 − p ) = p

E [ I j 2 ] = 1 2 ( p ) + 0 2 ( 1 − p ) = p ⟹ Var ⁡ ( I j ) = p − p 2 = p ( 1 − p ) E[I_j^2] = 1^2(p) + 0^2(1 - p) = p \implies \operatorname{Var}(I_j) = p - p^2 = p(1 - p) E [ I j 2 ​ ] = 1 2 ( p ) + 0 2 ( 1 − p ) = p ⟹ Var ( I j ​ ) = p − p 2 = p ( 1 − p )

By linearity of expectation and independence: μ = E [ X ] = ∑ j = 1 n E [ I j ] = n p \mu = E[X] = \sum_{j=1}^n E[I_j] = n p μ = E [ X ] = j = 1 ∑ n ​ E [ I j ​ ] = n p σ 2 = Var ⁡ ( X ) = ∑ j = 1 n Var ⁡ ( I j ) = n p ( 1 − p ) ⟹ σ = n p ( 1 − p ) \sigma^2 = \operatorname{Var}(X) = \sum_{j=1}^n \operatorname{Var}(I_j) = n p (1 - p) \implies \sigma = \sqrt{n p (1 - p)} σ 2 = Var ( X ) = j = 1 ∑ n ​ Var ( I j ​ ) = n p ( 1 − p ) ⟹ σ = n p ( 1 − p ) ​

3. Continuous Probability Distributions & PDFs

A random variable X X X is continuous if its possible values form an uncountable interval of real numbers (e.g., time, height, mass). Because an uncountable set cannot be summed with a discrete PMF, continuous variables are governed by a probability density function (PDF) f ( x ) f(x) f ( x ) .

Axiomatic Properties of a PDF

Non-negativity: f ( x ) ≥ 0 f(x) \ge 0 f ( x ) ≥ 0 for all x ∈ R x \in \mathbb{R} x ∈ R .

Total Area: ∫ − ∞ ∞ f ( x ) d x = 1 \int_{-\infty}^{\infty} f(x) \, dx = 1 ∫ − ∞ ∞ ​ f ( x ) d x = 1 . +-----------------------------------------------------------------------------+

  • | CONTINUOUS PROBABILITY AS AREA UNDER A PDF |
  • | |
  • | f(x) ^ |
  • | | **** |
  • | | * * |
  • | | * Area = * |
  • | | * P(a ≤ X ≤ b)* |
  • | | * |////////////| * |
  • | +---------+--+----------+--+----------> x |
  • | a b |
  • | |
  • | P(a ≤ X ≤ b) = ∫_a^b f(x) dx P(X = c) = ∫_c^c f(x) dx = 0 |
  • +-----------------------------------------------------------------------------+
  • The Point-Probability Zero Paradox

For any continuous random variable X X X and any specific exact real constant c c c : P ( X = c ) = ∫ c c f ( x ) d x = 0 P(X = c) = \int_c^c f(x) \, dx = 0 P ( X = c ) = ∫ c c ​ f ( x ) d x = 0

Instructional Consequence: For continuous distributions, strict and non-strict inequalities are mathematically identical: P ( a ≤ X ≤ b ) = P ( a < X ≤ b ) = P ( a ≤ X < b ) = P ( a < X < b ) P(a \le X \le b) = P(a < X \le b) = P(a \le X < b) = P(a < X < b) P ( a ≤ X ≤ b ) = P ( a < X ≤ b ) = P ( a ≤ X < b ) = P ( a < X < b )

This contrasts starkly with discrete distributions, where P ( X ≤ 5 ) = P ( X < 5 ) + P ( X = 5 ) P(X \le 5) = P(X < 5) + P(X = 5) P ( X ≤ 5 ) = P ( X < 5 ) + P ( X = 5 ) .

4. The Normal Distribution & Standard Normal Z-Scores

The Normal (Gaussian) distribution N ( μ , σ ) N(\mu, \sigma) N ( μ , σ ) is the foundational continuous distribution of mathematical statistics, with PDF: f ( x ) = 1 σ 2 π e − ( x − μ ) 2 2 σ 2 , x ∈ R f(x) = \frac{1}{\sigma \sqrt{2\pi}} e^{-\frac{(x - \mu)^2}{2\sigma^2}}, \quad x \in \mathbb{R} f ( x ) = σ 2 π ​ 1 ​ e − 2 σ 2 ( x − μ ) 2 ​ , x ∈ R

Structural Characteristics

Symmetry: The curve is symmetric, bell-shaped, and unimodal about the center x = μ x = \mu x = μ . Mean = Median = Mode = μ \mu μ .

Inflection Points: The concavity of f ( x ) f(x) f ( x ) transitions from concave down to concave up exactly at the inflection coordinates x = μ − σ x = \mu - \sigma x = μ − σ and x = μ + σ x = \mu + \sigma x = μ + σ .

Asymptotes: The tails approach the horizontal axis asymptotically ( f ( x ) → 0 f(x) \to 0 f ( x ) → 0 as x → ± ∞ x \to \pm\infty x → ± ∞ ) but never touch it.

The Empirical Rule (68–95–99.7 Rule)

For any normally distributed population:

≈ 68.27 % \approx 68.27\% ≈ 68.27% of the distribution lies within 1 standard deviation of the mean: ( μ − σ , μ + σ ) (\mu - \sigma, \mu + \sigma) ( μ − σ , μ + σ ) .

≈ 95.45 % \approx 95.45\% ≈ 95.45% of the distribution lies within 2 standard deviations of the mean: ( μ − 2 σ , μ + 2 σ ) (\mu - 2\sigma, \mu + 2\sigma) ( μ − 2 σ , μ + 2 σ ) .

≈ 99.73 % \approx 99.73\% ≈ 99.73% of the distribution lies within 3 standard deviations of the mean: ( μ − 3 σ , μ + 3 σ ) (\mu - 3\sigma, \mu + 3\sigma) ( μ − 3 σ , μ + 3 σ ) .

Standard Normal Distribution Z ∼ N ( 0 , 1 ) Z \sim N(0, 1) Z ∼ N ( 0 , 1 ) & Z-Scores

To evaluate probabilities for an arbitrary X ∼ N ( μ , σ ) X \sim N(\mu, \sigma) X ∼ N ( μ , σ ) , the variable is standardized into the standard normal score (z-score): Z = X − μ σ ∼ N ( 0 , 1 ) Z = \frac{X - \mu}{\sigma} \sim N(0, 1) Z = σ X − μ ​ ∼ N ( 0 , 1 )

The z-score measures the signed distance between an observation x x x and the population mean μ \mu μ in units of standard deviation. The cumulative distribution function (CDF) is denoted Φ ( z ) = P ( Z ≤ z ) = 1 2 π ∫ − ∞ z e − t 2 / 2 d t \Phi(z) = P(Z \le z) = \frac{1}{\sqrt{2\pi}} \int_{-\infty}^z e^{-t^2/2} \, dt Φ ( z ) = P ( Z ≤ z ) = 2 π ​ 1 ​ ∫ − ∞ z ​ e − t 2 /2 d t .

5. Normal Approximation to the Binomial & Continuity Correction

When n n n is large, evaluating binomial cumulative sums ∑ k = a b ( n k ) p k ( 1 − p ) n − k \sum_{k=a}^b \binom{n}{k} p^k (1 - p)^{n - k} ∑ k = a b ​ ( k n ​ ) p k ( 1 − p ) n − k by hand or basic calculators is computationally prohibitive. By the De Moivre-Laplace Limit Theorem (a precursor to the Central Limit Theorem), the Binomial distribution converges asymptotically to a Normal distribution with identical mean and variance: N ( n p , n p ( 1 − p ) ) N(np, \sqrt{np(1-p)}) N ( n p , n p ( 1 − p ) ​ ) .

Rule of Thumb Conditions

The normal approximation is valid when both expected successes and expected failures are at least 10: n p ≥ 10 and n ( 1 − p ) ≥ 10 n p \ge 10 \quad \text{and} \quad n(1 - p) \ge 10 n p ≥ 10 and n ( 1 − p ) ≥ 10

The Continuity Correction Protocol

Because we are approximating a discrete integer-valued random variable X X X with a continuous density curve Y Y Y , each integer k k k on the discrete number line corresponds to a unit-width interval [ k − 0.5 , k + 0.5 ] [k - 0.5, k + 0.5] [ k − 0.5 , k + 0.5 ] under the continuous curve.

Discrete Binomial Event Continuous Normal Interval Rationale / Adjustment

P ( X = k ) P(X = k) P ( X = k ) P ( k − 0.5 ≤ Y ≤ k + 0.5 ) P(k - 0.5 \le Y \le k + 0.5) P ( k − 0.5 ≤ Y ≤ k + 0.5 ) Single discrete bar spanning width 1 centered at k k k

P ( X ≥ k ) P(X \ge k) P ( X ≥ k ) P ( Y ≥ k − 0.5 ) P(Y \ge k - 0.5) P ( Y ≥ k − 0.5 ) Includes bar k k k , so lower boundary shifts left by 0.5

P ( X > k ) P(X > k) P ( X > k ) P ( Y ≥ k + 0.5 ) P(Y \ge k + 0.5) P ( Y ≥ k + 0.5 ) Excludes bar k k k , so lower boundary starts after k k k at k + 0.5 k + 0.5 k + 0.5

P ( X ≤ k ) P(X \le k) P ( X ≤ k ) P ( Y ≤ k + 0.5 ) P(Y \le k + 0.5) P ( Y ≤ k + 0.5 ) Includes bar k k k , so upper boundary shifts right by 0.5

P ( X < k ) P(X < k) P ( X < k ) P ( Y ≤ k − 0.5 ) P(Y \le k - 0.5) P ( Y ≤ k − 0.5 ) Excludes bar k k k , so upper boundary terminates before k k k at k − 0.5 k - 0.5 k − 0.5

6. Secondary Pedagogical Traps & Instructional Interventions

Accomplished mathematics educators anticipate predictable student errors in distribution theory:

Misconception 1: Interchanging Strict and Non-Strict Inequalities Indiscriminately

Students frequently assume P ( X < 4 ) = P ( X ≤ 4 ) P(X < 4) = P(X \le 4) P ( X < 4 ) = P ( X ≤ 4 ) in all probability problems, confusing continuous and discrete rules.

Pedagogical Intervention: Draw a discrete probability histogram where each integer is represented by a distinct rectangular bar. Show that P ( X ≤ 4 ) P(X \le 4) P ( X ≤ 4 ) includes the entire bar over 4 4 4 , whereas P ( X < 4 ) P(X < 4) P ( X < 4 ) stops at the bar over 3 3 3 . Thus, P ( X ≤ 4 ) − P ( X < 4 ) = P ( X = 4 ) > 0 P(X \le 4) - P(X < 4) = P(X = 4) > 0 P ( X ≤ 4 ) − P ( X < 4 ) = P ( X = 4 ) > 0 . Then contrast this with a smooth continuous curve where the area over a single point x = 4 x = 4 x = 4 is a line segment of zero width (area = 0 = 0 = 0 ).

Misconception 2: Arbitrary Sign Selection in Continuity Corrections

Students memorize that continuity corrections involve ± 0.5 \pm 0.5 ± 0.5 , but guess whether to add or subtract.

Pedagogical Intervention: Mandate that students sketch a segment of the discrete integer axis and shade the "target bars" before writing any numbers. For example, if asked for P ( X ≥ 12 ) P(X \ge 12) P ( X ≥ 12 ) , have them shade the bars 12 , 13 , 14 , … 12, 13, 14, \dots 12 , 13 , 14 , … . Visually, the shaded region starts at the left edge of bar 12 12 12 , which is 11.5 11.5 11.5 . Thus, P ( X ≥ 12 ) ≈ P ( Y ≥ 11.5 ) P(X \ge 12) \approx P(Y \ge 11.5) P ( X ≥ 12 ) ≈ P ( Y ≥ 11.5 ) . If asked for P ( X > 12 ) P(X > 12) P ( X > 12 ) , the shaded region begins at bar 13 13 13 , whose left edge is 12.5 12.5 12.5 . The visual diagram prevents sign errors.

Misconception 3: Interpreting the PDF Height f ( x ) f(x) f ( x ) as a Probability

When evaluating a normal density function, students often compute f ( 0 ) = 1 2 π ≈ 0.3989 f(0) = \frac{1}{\sqrt{2\pi}} \approx 0.3989 f ( 0 ) = 2 π ​ 1 ​ ≈ 0.3989 and conclude that P ( Z = 0 ) = 39.89 % P(Z = 0) = 39.89\% P ( Z = 0 ) = 39.89% .

Pedagogical Intervention: Remind students that f ( x ) f(x) f ( x ) represents probability density (probability per unit of x x x ), not probability itself. Illustrate with a uniform distribution on [ 0 , 0.5 ] [0, 0.5] [ 0 , 0.5 ] where f ( x ) = 2.0 f(x) = 2.0 f ( x ) = 2.0 . If f ( x ) f(x) f ( x ) were a probability, P = 2.0 > 1.0 P = 2.0 > 1.0 P = 2.0 > 1.0 would violate Kolmogorov's first and second axioms. Reiterate: only areas under f ( x ) f(x) f ( x ) represent probabilities.

Loading diagram... Taxonomy of Probability Models: Discrete vs. Continuous Distributions