For , the binomial coefficient is
When ,
This is Pascal's identity.
The special binomial theorem
follows by mathematical induction. Multiplication of the formula for by and collection of the coefficient of uses Pascal's identity from part (a).
Termwise integration from to gives
Replacing by gives
Finally,
Writing and using the finite geometric series,
turns this into
Put
The initial values are . Using Pascal's identity and the convention that an out-of-range binomial coefficient is zero,
Thus has the same initial values and linear recurrence relation as the Fibonacci numbers. Mathematical induction gives

Articles by others on the same topic (0)

There are currently no matching articles.