SOLID STATE PRESS
← Back to catalog
The Geometric Distribution cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

The Geometric Distribution

Waiting for the First Success, Memorylessness, and Expected Trials — A TLDR Primer

Probability class just introduced the geometric distribution and the formula sheet looks like a wall of symbols. Or maybe your AP Statistics exam is coming up and the memoryless property still feels slippery. This guide cuts straight to what you need.

**The Geometric Distribution: Waiting for the First Success** covers every core idea — Bernoulli trials, the PMF and its two competing conventions, the cumulative distribution function, expected value, variance, and the memoryless property — with plain-language explanations and worked numerical examples at every step. You will also see where the geometric distribution appears in the real world (quality control, network retries, sports streaks) and exactly how it differs from the binomial and negative binomial distributions, which trip students up constantly.

This guide is written for high school and early-college students who want a focused explanation of geometric distribution probability without slogging through a door-stopper textbook that buries the key ideas under pages of measure theory. It is equally useful for tutors planning a session or parents who want to understand what their student is struggling with.

Every term is defined in plain language the first time it appears. Common misconceptions — including the gambler's fallacy and the confusion between the "number of trials" and "number of failures" conventions — are named and corrected inline. The exposition is short by design: no filler, no padding, no detours.

If you need to walk into your next exam or homework session understanding the geometric distribution from the ground up, pick this up and start reading.

What you'll learn
  • Recognize when a real-world situation fits a geometric distribution
  • Compute probabilities, expected value, and variance using the geometric PMF and CDF
  • Distinguish the two common conventions (number of trials vs. number of failures)
  • Apply the memoryless property and explain why only the geometric distribution has it (among discrete distributions)
  • Solve typical exam problems including 'at least n trials' and 'first success by trial n' questions
What's inside
  1. 1. Setting the Scene: Bernoulli Trials and Waiting for Success
    Introduces the experimental setup — independent Bernoulli trials with constant success probability p — and frames the geometric distribution as the answer to 'how long until the first success?'
  2. 2. The PMF: Probability of the First Success on Trial k
    Derives the geometric PMF P(X=k) = (1-p)^(k-1) p, explains the two conventions (trials vs. failures), and works several direct computations.
  3. 3. The CDF and 'At Least k Trials' Questions
    Builds the cumulative distribution function, derives the clean tail formula P(X>k) = (1-p)^k, and uses it on the most common exam-style problems.
  4. 4. Expected Value, Variance, and What They Mean
    Derives E[X] = 1/p and Var(X) = (1-p)/p^2, gives intuition for why the mean is the reciprocal of p, and warns about the variance formula's convention dependence.
  5. 5. The Memoryless Property
    States and proves P(X>m+n | X>m) = P(X>n), explains why this is counterintuitive (the gambler's fallacy), and notes that the geometric is the only discrete distribution with this property.
  6. 6. Where It Shows Up: Applications and Look-Alikes
    Surveys real settings (quality control, retries, sports streaks, coupon problems) and distinguishes the geometric from the binomial and negative binomial distributions.
Published by Solid State Press
The Geometric Distribution cover
TLDR STUDY GUIDES

The Geometric Distribution

Waiting for the First Success, Memorylessness, and Expected Trials — A TLDR Primer
Solid State Press

Contents

  1. 1 Setting the Scene: Bernoulli Trials and Waiting for Success
  2. 2 The PMF: Probability of the First Success on Trial k
  3. 3 The CDF and 'At Least k Trials' Questions
  4. 4 Expected Value, Variance, and What They Mean
  5. 5 The Memoryless Property
  6. 6 Where It Shows Up: Applications and Look-Alikes
Chapter 1

Setting the Scene: Bernoulli Trials and Waiting for Success

Flip a coin. Roll a die. Take a free throw. Each of these is a single experiment with two possible outcomes: it either works out — success — or it does not — failure. That stripped-down setup, one trial with exactly two outcomes, is the building block for everything in this book.

A Bernoulli trial is any single experiment that produces exactly one of two outcomes, conventionally called success and failure, where the probability of success is some fixed number $p$ with $0 < p \leq 1$. The probability of failure is then $1 - p$, which statisticians often write as $q$ for short. The name comes from Jacob Bernoulli, a seventeenth-century Swiss mathematician, but you do not need the history — you need the structure. What matters is that $p$ is constant and the outcomes are exactly two.

A few honest examples of Bernoulli trials:

  • A manufacturing line produces a part that is either defective or not, with defect probability $p = 0.03$.
  • A student guesses on a multiple-choice question with four options; the probability of a correct guess is $p = 0.25$.
  • A server attempts to reach a remote host; each attempt either connects ($p = 0.8$) or times out.

Notice that "success" does not have to mean something good in the everyday sense. If you are studying equipment failures, a failure of the machine is your "success" in the statistical sense — it is the event you are counting. The label is just a convention.

Independence Changes Everything

Running one Bernoulli trial is trivial. The interesting question arises when you run them repeatedly: does the outcome of one trial affect the next? For the geometric distribution, the answer must be no. Independence means the outcome of any trial gives you zero information about any other trial's outcome. Past results do not tilt the odds on the next attempt.

This is worth pausing on, because humans are not naturally wired to believe it. If a basketball player misses five free throws in a row, it feels like the sixth one is overdue. That intuition is wrong — if the trials are independent with probability $p$, trial six has exactly probability $p$ of being a success, full stop. We will return to this psychological trap in Section 5 when we discuss the memoryless property.

About This Book

If you're sitting in AP Statistics staring at a probability distributions review sheet, or you're a college freshman grinding through intro probability and discrete distributions feel like a foreign language, this guide is for you. It also works for anyone who has typed something like "geometric distribution probability explained simply" into a search bar at 11 p.m. the night before an exam.

This book covers the core ideas: Bernoulli trials and the probability of the first success, the geometric distribution PMF and CDF with practice problems, how to find the expected value and variance of a geometric distribution, and the memoryless property of the geometric distribution with worked examples. Short by design, with no filler and ruthless cuts.

Read straight through from the beginning — each section builds on the last. Work through the solved examples as you go rather than skipping them, then test yourself with the problem set at the end to find out what you actually know.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon