We are given a second-order linear homogeneous recurrence relation and asked to find a general formula for the $n$th term $a_n$. The recurrence relation is given by $a_{n+2} = a_{n+1} + 6a_n$, with initial conditions $a_1 = -1$ and $a_2 = 1$.
Discrete MathematicsRecurrence RelationsLinear Recurrence RelationsCharacteristic EquationSolving Recurrence Relations
2025/4/3
1. Problem Description
We are given a second-order linear homogeneous recurrence relation and asked to find a general formula for the th term . The recurrence relation is given by , with initial conditions and .
2. Solution Steps
First, we write down the characteristic equation of the given recurrence relation. The recurrence relation is . We can rewrite this as .
The characteristic equation is obtained by replacing with , where is a constant. Thus, we have:
Next, we solve for . We can factor the quadratic equation as follows:
This gives us the roots and .
Since the roots are distinct, the general solution of the recurrence relation is of the form:
, where A and B are constants.
Now, we use the initial conditions to find the values of A and B. We are given and .
For , we have .
For , we have .
We now have a system of two linear equations in two variables:
Multiply the first equation by 2:
Add this to the second equation:
Substitute into the first equation:
So the general solution is: