Does back substitution method work for any recursive equation? If not is there any generalized form for recursive equation?
Asked
Active
Viewed 98 times
0
-
Back substitution doesn't always work. There is no general method which is always guaranteed to hold. Such is math. – Yuval Filmus Dec 25 '20 at 15:14
-
Back substitution doesn't seem to help for the Fibonacci recurrence $F(n) = F(n-1) + F(n-2)$, for example. – Yuval Filmus Dec 25 '20 at 18:03
-
We have a reference question on the topic of solving recurrence relations. – Yuval Filmus Dec 25 '20 at 18:03