Finding General Terms for First- and Second-Order Linear Recurrences
This article introduces methods for finding general terms of first- and second-order linear recurrences: by constructing geometric sequences, a first-order recurrence is transformed into a geometric form; for second-order recurrences, a characteristic equation is constructed to find characteristic roots, and two symmetric geometric sequences are used to derive the general term formula, with an example provided.
I learned it here Recently I've been quite busy. Although I had written this set of problems before, I hadn't studied it carefully. Then, in order to explain the problems without embarrassment, I dragged GJY into researching this until two or three in the morning. Actually, if one has learned characteristic roots, this problem is easy to see, but I hadn't learned it. After asking many experts, I finally found the direction of characteristic roots. Since it was really late, I had to log off in shame. The next morning, after spending a dozen minutes reading, I suddenly understood and marveled at how simple it was (not really). The computation is simple, but the construction is challenging. Fortunately, this is a general solution; use it a few times and you'll remember it. Characteristic roots seem to be content from linear algebra (really, it seems).
A little supplement written at the beginning: In this article, because geometric sequences are easier to find the nth term, we hope to transform a recurrence into a geometric sequence form. Here, I first give the recurrence and the geometric sequence, then try to establish a connection between them (equivalence relations between variables).
1. First-order
Of the form:
When , this is an arithmetic sequence. When , consider constructing a geometric sequence (this is a general construction):
Here, each term is of the form , so it becomes a geometric sequence with common ratio .
We consider transforming into the form of , so that we can establish connections between the variables.
Now we can clearly see the shape of in . Further, we establish connections between variables.
At this point, we have obtained all constants of the geometric sequence , and we can find any term , and thus any term .
So .
2. Second-order
This is a second-order linear recurrence. Why is it second-order? Probably because it uses two 's.
Similar to the first-order recurrence, we hope to construct a geometric sequence (again, this is a general construction):
Here, each term is of the form , very similar to the approach in .
Similarly, we try to transform it into the form of .
Then comparing and we get:
To solve for , we consider constructing a quadratic equation with roots . Using Vieta's formulas:
This equation is called the characteristic equation of the sequence, and are called the characteristic roots.
Since are the two roots of the equation, they are "symmetric"; consider the symmetry of the function graph.
Returning to equation , because they are symmetric, we can obtain two geometric sequences:
The right-hand sides can be simplified:
To find , subtract them to eliminate on the left:
2.1 Example:
Now we know our goal is to find . Directly solve the characteristic equation to get:
Substitute into 🦁 (oops, I mean equation ):[^1]
[^1]: Recently changed the Markdown compiler, LaTeX seems to have broken.
Now it's fixed.
Comments
0No comments yet.