Stefani_problem_stefani_problem Page

A common "Stefani Problem" involves proving identities of Fibonacci numbers, such as:

This property is closely related to the , which is often used to optimize dynamic programming algorithms from 2. Fundamental Proof Techniques stefani_problem_stefani_problem

Assuming the property is false and showing this leads to an impossibility. Contraposition: Proving "If not B, then not A." A common "Stefani Problem" involves proving identities of

fkfk+1+fk+12=fk+1(fk+fk+1)f sub k f sub k plus 1 end-sub plus f sub k plus 1 end-sub squared equals f sub k plus 1 end-sub of open paren f sub k plus f sub k plus 1 end-sub close paren by definition: fk+1fk+2f sub k plus 1 end-sub f sub k plus 2 end-sub The identity is proven for all Resources for Further Study stefani_problem_stefani_problem