example of closed form
Consider the recurrence given by and . Then it can be proved by induction that .
Now consider Fibonacci’s recurrence:
It is not a closed formula, since if we wanted to compute we would need to know , (and for knowing them, the previous terms too). However, such recurrence has a closed formula, known as Binet formula:
Binet formula is closed, since if we wanted to compute we only need to substitute on the previous formula, and no additional information is required.
|Title||example of closed form|
|Date of creation||2013-03-22 15:03:07|
|Last modified on||2013-03-22 15:03:07|
|Last modified by||drini (3)|