Definition
The binomial coefficient recurrence relation expresses a binomial coefficient as the sum of two adjacent binomial coefficients from the preceding row of Pascal's triangle.
Interpretation
The number of ways to select k objects from n objects equals the number of selections that include a particular object plus the number of selections that exclude that object.
Mathematical Significance
This recurrence is the mathematical foundation of Pascal's triangle and provides an efficient method for calculating binomial coefficients without directly evaluating factorial expressions.
Special Cases
C(n, 0) = 1 for every nonnegative integer n.
C(n, n) = 1 for every nonnegative integer n.
For 1 ≤ k ≤ n - 1, the recurrence combines two coefficients from row n - 1.
Binomial coefficients satisfy the symmetry relation C(n, k) = C(n, n - k).