Fix and use two-base mathematical induction on . At , the proposed right side is ; at , it is . Suppose the identity holds at and . The defining recurrence relation for the Fibonacci numbers givesThis is the assertion at , completing the proof of the Fibonacci addition formula. The argument includes , since is defined.
At , the product is , as required. Suppose the formula holds at . Appending the next factor giveswhich is exactly the formula at . Thus mathematical induction gives for every . The factorization also explains the cancellation in this telescoping product.
Use strong induction with three consecutive base cases:For , assume all values from through have the required representation. Since , write with nonnegative integers. Then is another such representation. Strong induction proves the claim for every . This is a consecutive-base induction for additive semigroups: the three base cases handle all residues before repeated addition of .
There are unlisted articles, also show them or only show them.