Linked from

The 36 pages that link to Finite difference, each with the reason it gives.

• Binomial coefficientRelated: Binomial coefficients provide coefficients for repeated finite-difference formulas.

• Mathematical inductionRelated: Polynomial identities proved by induction often correspond to predictable changes between adjacent cases.

• Sensitivity analysisRelated: It estimates sensitivity when analytic derivatives are unavailable.

• Arithmetic progressionRelated: The first differences of an arithmetic progression are all equal.

• Charles BabbageRelated: Finite differences supplied the arithmetic method behind the Difference Engine.

• Difference quotientRelated: Dividing a finite difference by its input step produces a difference quotient.

• Pascal's triangleRelated: Triangle entries also organize finite-difference patterns and polynomial coefficients.

• Secant lineRelated: A finite-difference quotient is the numerical counterpart of a secant slope.

• Marginal analysisRelated: Discrete choices use finite changes when actions cannot vary infinitesimally.

• Taylor polynomialRelated: Taylor expansions derive the accuracy and error of finite-difference formulas.

• Difference equationRelated: Finite differences provide a discrete counterpart to derivatives in equations for sequences.

• Euler–Maclaurin formulaRelated: The formula grew from relations between finite differences and derivatives.

• Falling factorialRelated: Finite differences lower the order of falling factorials in a simple way.

• Integer sequenceRelated: Constant higher differences characterize sequences given by polynomial formulas.

• Pascal's ruleRelated: Binomial coefficients and their recurrences organize identities for finite differences.

• Stolz–Cesàro theoremRelated: Successive differences play the role that derivatives play in continuous limit comparisons.

• Abel's inequalityRelated: The transformed sum contains differences of adjacent weights.

• Levinson's inequalityRelated: Paired values around a midpoint can be analyzed through differences that expose derivative constraints.

• Ono's inequalityRelated: Differences of partition numbers are natural candidates for quantitative bounds.