---
title: "Recursion Relations in Intro to Probability"
description: "Recursion relations are equations that build each probability from earlier terms, a useful tool in Intro to Probability for discrete distributions and PGFs."
canonical: "https://fiveable.me/introduction-probability/key-terms/recursion-relations"
type: "key-term"
subject: "Intro to Probability"
unit: "Unit 13"
---

# Recursion Relations in Intro to Probability

## Definition

Recursion relations are equations that define a probability sequence from earlier terms. In Intro to Probability, they often describe discrete distributions one term at a time and connect to probability generating functions.

## What It Is

Recursion relations are formulas that let you find one probability from one or more earlier probabilities in the same sequence. In Intro to Probability, that usually means you are not writing out a distribution all at once. Instead, you start with a base case and use a rule like p(k+1) = f(k)p(k) to generate the rest of the probabilities.

That setup shows up a lot with discrete distributions, where the probability mass function has a pattern from one value of x to the next. For example, if a distribution has probabilities p(0), p(1), p(2), and so on, a recursion relation may tell you how p(2) depends on p(1), then how p(3) depends on p(2). Once you know the starting value, the whole sequence can be built step by step.

The base case matters because a recursion relation cannot start from nothing. You need one known probability, often found by using the fact that all probabilities add to 1. After that, the recursion does the repeated work for you. This is especially useful when the distribution has an infinite support or when the terms are easier to compare than to write directly.

A big reason recursion relations appear in this course is their connection to probability generating functions. A PGF packages the probabilities into a single algebraic object, and the recursion often comes out of comparing coefficients or using a pattern in the function. That is why recursion relations are a bridge between a probability table and an algebraic method.

A common example is the Poisson distribution, where consecutive probabilities have a simple ratio. The binomial distribution can also be written recursively. In both cases, the recursion is less about memorizing a special trick and more about recognizing a pattern that lets you compute probabilities efficiently.

## Why It Matters

Recursion relations give you a fast way to work with distributions that would be annoying to calculate term by term from scratch. In Intro to Probability, that matters any time you are asked to analyze a discrete random variable, especially when the probabilities follow a clear pattern.

They also make probability generating functions feel less abstract. A PGF is a compact algebra tool, but the recursion relation is often the part you can actually use to compute probabilities, verify a distribution, or check whether a pattern is consistent. If you can move between the recursion and the distribution table, you are in good shape for problem sets that mix algebra and probability.

These relations are useful for deriving moments too. Once a distribution is written in a recursive form, it can be easier to study expected value or variance indirectly, rather than recomputing everything from the full probability mass function. That is especially handy in families like the Poisson or Negative Binomial Distribution, where the recursion shows the structure of the distribution more clearly than a long list of terms does.

The skill also builds good habits for reading probability problems carefully. You learn to spot the starting value, identify the pattern between terms, and check that the probabilities still sum to 1. That is the kind of reasoning that comes up in homework, quizzes, and written explanations in a probability class.

## Connections

### Probability generating function

A probability generating function is the algebraic object that often produces a recursion relation when you compare coefficients or simplify the expression. If you know the PGF, you can sometimes recover the whole probability sequence one term at a time. The recursion is the computational side of the PGF idea.

### Discrete distribution

Recursion relations usually describe discrete distributions, where probabilities are assigned to countable outcomes like 0, 1, 2, and so on. The recursion tells you how the mass function changes from one outcome to the next. That makes it easier to study patterns in binomial, Poisson, and related distributions.

### [Higher-order moments](/introduction-probability/key-terms/higher-order-moments)

Once a recursion relation is in place, it can help with finding moments or spotting formulas for them. Higher-order moments depend on sums of powers of the random variable, and recursive patterns can make those calculations cleaner. They are often part of the same algebraic toolbox as PGFs.

### [Negative Binomial Distribution](/introduction-probability/key-terms/negative-binomial-distribution)

The Negative Binomial Distribution often shows up with recursive patterns because its probabilities follow a repeatable ratio from one count to the next. That makes it a good example of how recursion relations organize a probability mass function. If you can recognize the pattern, you can write down later terms without starting over.

## On the AP Exam

A problem set question may give you the first probability and a rule for the next one, then ask you to generate several terms or identify the distribution. Your job is to use the base case correctly, apply the recursion without skipping indices, and check whether the resulting probabilities make sense. If a question uses a PGF, you may need to connect the algebraic form back to the coefficient sequence. A common mistake is forgetting that the recursion only works after you have the starting value, so you cannot produce the full distribution from the pattern alone. You also want to watch the notation carefully, since p(x+1) and p(x-1) are not interchangeable. In written answers, a clear setup, one or two computed terms, and a short justification are usually enough to show you know how the relation works.

## Recursion relations vs Probability generating function

A probability generating function is the single algebraic function that encodes a whole discrete distribution. A recursion relation is the step-by-step rule that tells you how one probability leads to the next. They are closely related, but they are not the same thing. The PGF stores the distribution, while the recursion lets you compute or compare its terms.

## Key Takeaways

- Recursion relations in Intro to Probability are rules that generate probabilities from earlier probabilities in the same distribution.
- You need a base case before the recursion can do any work, and that starting value is often found using the total probability rule.
- These relations are common for discrete distributions because they make patterns in the probability mass function easier to use.
- Recursion relations often connect directly to probability generating functions, since the PGF can encode the same sequence in algebraic form.
- If you can move from one term to the next without mixing up the index, you can usually handle recursion questions with confidence.

## FAQs

### What is recursion relations in Intro to Probability?

Recursion relations are formulas that define a probability sequence using earlier terms in the sequence. In Intro to Probability, they are often used for discrete distributions, where you can find p(x+1) from p(x) instead of starting from scratch each time. They are especially useful when the distribution has a clear pattern.

### How do recursion relations work with probability generating functions?

A probability generating function can encode the whole distribution in one expression, and the recursion relation often comes from that expression. When you expand the PGF or compare coefficients, you may get a rule that links consecutive probabilities. That makes the PGF a compact way to derive the recursion.

### What is the base case in a recursion relation?

The base case is the first known term that starts the sequence. In probability, it is often p(0) or another starting probability found from the total probability rule. Without that starting value, the recursion cannot generate the rest of the distribution.

### What distributions use recursion relations?

Common examples include the Poisson distribution, the binomial distribution, and the Negative Binomial Distribution. In each case, the probabilities follow a pattern from one count to the next. That pattern makes the distribution easier to compute and analyze.

## Related Study Guides

- [13.3 Probability generating functions for discrete distributions](/introduction-probability/unit-13/probability-generating-functions-discrete-distributions/study-guide/2Uh5U0XVsUPMh75I)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/introduction-probability/key-terms/recursion-relations#resource","name":"Recursion Relations in Intro to Probability","url":"https://fiveable.me/introduction-probability/key-terms/recursion-relations","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/introduction-probability/key-terms/recursion-relations#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:23:02.089Z","isPartOf":{"@type":"Collection","name":"Intro to Probability Key Terms","url":"https://fiveable.me/introduction-probability/key-terms"},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/introduction-probability/key-terms/recursion-relations#term","name":"Recursion relations","description":"Recursion relations are equations that define a probability sequence from earlier terms. In Intro to Probability, they often describe discrete distributions one term at a time and connect to probability generating functions.","url":"https://fiveable.me/introduction-probability/key-terms/recursion-relations","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Intro to Probability Key Terms","url":"https://fiveable.me/introduction-probability/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is recursion relations in Intro to Probability?","acceptedAnswer":{"@type":"Answer","text":"Recursion relations are formulas that define a probability sequence using earlier terms in the sequence. In Intro to Probability, they are often used for discrete distributions, where you can find p(x+1) from p(x) instead of starting from scratch each time. They are especially useful when the distribution has a clear pattern."}},{"@type":"Question","name":"How do recursion relations work with probability generating functions?","acceptedAnswer":{"@type":"Answer","text":"A probability generating function can encode the whole distribution in one expression, and the recursion relation often comes from that expression. When you expand the PGF or compare coefficients, you may get a rule that links consecutive probabilities. That makes the PGF a compact way to derive the recursion."}},{"@type":"Question","name":"What is the base case in a recursion relation?","acceptedAnswer":{"@type":"Answer","text":"The base case is the first known term that starts the sequence. In probability, it is often p(0) or another starting probability found from the total probability rule. Without that starting value, the recursion cannot generate the rest of the distribution."}},{"@type":"Question","name":"What distributions use recursion relations?","acceptedAnswer":{"@type":"Answer","text":"Common examples include the Poisson distribution, the binomial distribution, and the Negative Binomial Distribution. In each case, the probabilities follow a pattern from one count to the next. That pattern makes the distribution easier to compute and analyze."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Intro to Probability","item":"https://fiveable.me/introduction-probability"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/introduction-probability/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 13","item":"https://fiveable.me/introduction-probability/unit-13"},{"@type":"ListItem","position":4,"name":"Recursion relations"}]}]}
```