The general solution of recurrence relation \(a_r-5a_{r-1}+6a_{r-2}=4^r,\ r\ge2\) is:
The given problem asks for the general solution of a linear, non-homogeneous recurrence relation:
\(a_r - 5a_{r-1} + 6a_{r-2} = 4^r\), for \(r \ge 2\).
A recurrence relation defines a sequence where each term is a function of the preceding terms. To find the general solution of a non-homogeneous linear recurrence relation, we need to find two parts:
The general solution is the sum of these two parts: \(a_r = a_r^{(h)} + a_r^{(p)}\).
The homogeneous part of the recurrence relation is obtained by setting the non-homogeneous term (\(4^r\)) to zero:
\(a_r - 5a_{r-1} + 6a_{r-2} = 0\).
To solve this homogeneous recurrence relation, we write its characteristic equation. We assume a solution of the form \(a_r = k^r\). Substituting this into the homogeneous equation gives:
\(k^r - 5k^{r-1} + 6k^{r-2} = 0\)
Assuming \(k \ne 0\) and dividing by \(k^{r-2}\) (for \(r \ge 2\)), we get the characteristic equation:
\(k^2 - 5k + 6 = 0\)
Now, we solve this quadratic equation for \(k\). We can factor it:
\((k - 2)(k - 3) = 0\)
The roots are \(k_1 = 2\) and \(k_2 = 3\). Since the roots are distinct real numbers, the homogeneous solution is of the form:
\(a_r^{(h)} = A_1 \cdot k_1^r + A_2 \cdot k_2^r\)
Substituting the roots, we get the homogeneous solution:
\(a_r^{(h)} = A_1 \cdot 2^r + A_2 \cdot 3^r\)
where \(A_1\) and \(A_2\) are arbitrary constants determined by initial conditions (which are not provided in this problem asking for the general solution).
The non-homogeneous term is \(f(r) = 4^r\). Since the base of this exponential (4) is not a root of the characteristic equation (the roots are 2 and 3), we assume a particular solution of the form:
\(a_r^{(p)} = C \cdot 4^r\)
where \(C\) is a constant that we need to find. We substitute this assumed form into the original non-homogeneous recurrence relation:
\(a_r - 5a_{r-1} + 6a_{r-2} = 4^r\)
\((C \cdot 4^r) - 5(C \cdot 4^{r-1}) + 6(C \cdot 4^{r-2}) = 4^r\)
To solve for \(C\), we can factor out \(C \cdot 4^{r-2}\) or divide the entire equation by \(4^{r-2}\) (for \(r \ge 2\)):
\(C \cdot \dfrac{4^r}{4^{r-2}} - 5C \cdot \dfrac{4^{r-1}}{4^{r-2}} + 6C \cdot \dfrac{4^{r-2}}{4^{r-2}} = \dfrac{4^r}{4^{r-2}}\)
\(C \cdot 4^2 - 5C \cdot 4^1 + 6C \cdot 4^0 = 4^2\)
\(16C - 20C + 6C = 16\)
\((16 - 20 + 6)C = 16\)
\(2C = 16\)
\(C = \dfrac{16}{2}\)
\(C = 8\)
So, the particular solution is:
\(a_r^{(p)} = 8 \cdot 4^r\)
The general solution is the sum of the homogeneous and particular solutions:
\(a_r = a_r^{(h)} + a_r^{(p)}\)
\(a_r = (A_1 \cdot 2^r + A_2 \cdot 3^r) + (8 \cdot 4^r)\)
The general solution of the recurrence relation \(a_r - 5a_{r-1} + 6a_{r-2} = 4^r\) is:
\(a_r = A_1 \cdot 2^r + A_2 \cdot 3^r + 8 \cdot 4^r\)
where \(A_1\) and \(A_2\) are arbitrary constants.
Let's compare our derived general solution \(A_1 \cdot 2^r + A_2 \cdot 3^r + 8 \cdot 4^r\) with the given options:
Therefore, the correct option is the one that matches the derived general solution \(A_1.2^r+A_2.3^r+8.4^r\).
| Step | Description | Applied to \(a_r - 5a_{r-1} + 6a_{r-2} = 4^r\) |
|---|---|---|
| 1 | Identify the homogeneous part. | \(a_r - 5a_{r-1} + 6a_{r-2} = 0\) |
| 2 | Write the characteristic equation. | \(k^2 - 5k + 6 = 0\) |
| 3 | Solve the characteristic equation for roots. | Roots are \(k=2, k=3\) |
| 4 | Write the homogeneous solution \(a_r^{(h)}\) based on roots. | \(a_r^{(h)} = A_1 \cdot 2^r + A_2 \cdot 3^r\) |
| 5 | Identify the non-homogeneous term \(f(r)\). | \(f(r) = 4^r\) |
| 6 | Guess the form of the particular solution \(a_r^{(p)}\) based on \(f(r)\) and roots. | Assume \(a_r^{(p)} = C \cdot 4^r\) (since 4 is not a root) |
| 7 | Substitute \(a_r^{(p)}\) into the original non-homogeneous equation. | \(C \cdot 4^r - 5(C \cdot 4^{r-1}) + 6(C \cdot 4^{r-2}) = 4^r\) |
| 8 | Solve for the constant(s) in \(a_r^{(p)}\). | \(2C = 16 \implies C=8\) |
| 9 | Write the particular solution \(a_r^{(p)}\). | \(a_r^{(p)} = 8 \cdot 4^r\) |
| 10 | Combine \(a_r^{(h)}\) and \(a_r^{(p)}\) for the general solution \(a_r\). | \(a_r = A_1 \cdot 2^r + A_2 \cdot 3^r + 8 \cdot 4^r\) |
Linear constant-coefficient recurrence relations are similar to linear constant-coefficient differential equations. The methods for finding homogeneous and particular solutions have parallels.
The form of the particular solution \(a_r^{(p)}\) depends on the form of the non-homogeneous term \(f(r)\) and the roots of the characteristic equation.
In our case, \(f(r) = 4^r = 4^r \cdot 1\). Here, \(c=4\) and \(P(r)=1\) (a polynomial of degree \(d=0\)). Since 4 is not a root of the characteristic equation, we guessed \(a_r^{(p)} = 4^r \cdot C\), where \(C\) is a polynomial of degree 0 (a constant).
The general solution includes arbitrary constants (\(A_1, A_2\)). These constants can be uniquely determined if initial conditions (e.g., values of \(a_0, a_1\)) are provided. Without initial conditions, the solution represents the entire family of sequences that satisfy the recurrence relation.
How many bit strings of length ten either start with a 1 bit or end with two bits 00?
How many are there to place 8 indistinguishable balls into four distinguishable bins?
Consider the set of all possible five-card poker hands dealt fairly from a standard deck of
fifty-two cards. How many atomic events are there in the joint probability distribution?The number of substrings that can be formed from string given by “a d e f b g h n m p” is
Given the recurrence relation f(n) = (n - 1) + f(n - 1), n > 72, f(2) = 1, then f(n) is: