Get the latest tech news
Solving Recurrence Relations
Introduction A neat bit of “engineering mathematics” is solving recurrence relations. The solution method falls out of the notation itself, and harkens back to a time where formal sums …
First let’s settle on working over the vector space of all infinite sequences of real numbers with non-negative subscripts. We gamble and hope some of the solutions are of the following simple form:[r n| n = 1, 2, ...] = (r, r 2, r 3, ...), where r is a to be determined (possibly complex) number. We can lift any solution found in the weaker world (power series) to the more general one (subscripted sequences).
Or read this on Hacker News