Linked from

The 31 pages that link to Recurrence relation, each with the reason it gives.

• Mathematical inductionRelated: Induction verifies formulas and bounds for recursively generated sequences.

• CombinatoricsRelated: Many counting quantities are built from smaller instances by recurrence.

• Generating functionRelated: Multiplying a recurrence by powers of a variable often converts it into an equation for a series.

• SequenceRelated: It specifies a sequence by linking each term to its predecessors.

• Continued fractionRelated: Numerators and denominators of convergents follow simple recurrences.

• Partial sumRelated: Each partial sum equals the preceding sum plus the next sequence term.

• Fibonacci sequenceNarrower topic: The rule adding the two previous terms is a recurrence relation.

• Formal power seriesRelated: Recurrences often become coefficient equations that determine a formal series uniquely.

• RecursionRelated: It describes how recursive work grows as the input size increases.

• Merge sortRelated: The relation T(n) = 2T(n/2) + Θ(n) describes merge sort’s running time.

• Analysis of algorithmsRelated: Recursive algorithms often yield recurrences that can be solved for their growth.

• Fixed-point iterationRelated: The iterates form a sequence through the recurrence xₙ₊₁ = g(xₙ).

• Recursive definitionRelated: It states the rule that generates later values from the initial terms.

• Combinatorial proofRelated: A counted set can often be partitioned into cases that yield a recurrence and an identity.

• Difference equationRelated: Difference equations commonly express sequence values through recurrence relations.

• Divide-and-conquer algorithmRelated: It expresses an algorithm’s running time in terms of the work on its subproblems.

• Iterative methodRelated: It formalizes the rule that generates each new approximation from prior states.

• Integer sequenceRelated: Many integer sequences are generated by rules linking successive terms.

• HemachandraNarrower topic: The meter counts follow a recurrence based on patterns one or two syllables shorter.

• Tower of HanoiRelated: The minimum move count satisfies T(n) = 2T(n − 1) + 1.

• Discrete mathematicsRelated: Recurrences capture the stepwise structure of counting and algorithmic problems.

• Master theoremNarrower topic: The theorem takes a particular recurrence form as its input.

• Akra–Bazzi methodNarrower topic: Akra–Bazzi applies to a structured family of such equations.

• Bohr–Mollerup theoremRelated: The gamma recurrence propagates each value to the next argument.

• Hosoya indexRelated: Graph-specific recurrences compute the index by reducing to smaller subgraphs.

• Zeckendorf's theoremNarrower topic: The Fibonacci recurrence supplies the identities used to establish the theorem.

• Cassini's identityRelated: The Fibonacci recurrence is the basic rule behind Cassini’s relation.

• Catalan–Mersenne conjectureNarrower topic: The conjecture's sequence is specified by repeatedly applying one recurrence rule.

• Combinatorial principlesRelated: Many counting totals split into smaller cases and satisfy recurrences.

• Exponential integralRelated: Recurrences connect neighboring Eₙ functions and support computation across their orders.

• Legendre equationRelated: Adjacent Legendre polynomial degrees are linked by three-term recurrences.