CuRio$ty's question at Yahoo Answers regarding a linear homogeneous recursion

In summary, we are given a recursive formula and initial values for a sequence, and we must list the next four terms and find the closed form for the sequence. Using the recursive algorithm, we find the next four terms to be 11, 46, 195, and 826. To find the closed form, we solve the associated characteristic equation and use the initial values to determine the parameters. The closed form for the sequence is A_n=\frac{\sqrt{5}}{10}\left(\left(23-10\sqrt{5} \right)\left(2+\sqrt{5} \right)^n-\left(23+10\sqrt{5} \right)\left(2-\sqrt{
  • #1
MarkFL
Gold Member
MHB
13,288
12
Here is the question:

Math help please! recursive formula?

consider the sequence defined by the following recursive formula and starting with A^1=3 and A^2=2
A^1=4A^N-1 +A^N-2
A)list the next four terms of the sequence
b) find A^g
NOTE: ALL SUBSCRIPTS ARE SUPPOSE TO BE LOCATED BELOW THE "A"
please show me how this is done. would liketo learn. thanks in advance!

I have posted a link there to this topic so the OP can see my work.
 
Mathematics news on Phys.org
  • #2
Hello CuRio\$!ty,

We are (presumably) given the linear homogeneous recursion:

\(\displaystyle A_{n}=4A_{n-1}+A_{n-2}\)

where \(\displaystyle A_1=3,\,A_2=2\)

a) List the next four terms of the sequence.

For this we may simply use the recursive algorithm:

\(\displaystyle A_3=4A_2+A_1=4\cdot2+3=11\)

\(\displaystyle A_4=4A_3+A_2=4\cdot11+2=46\)

\(\displaystyle A_5=4A_4+A_3=4\cdot46+11=195\)

\(\displaystyle A_6=4A_5+A_4=4\cdot195+46=826\)

b) Find $A_n$.

To find the closed form, we find the roots of the associated characteristic equation:

\(\displaystyle r^2-4r-1=0\)

The quadratic formula gives us:

\(\displaystyle r=2\pm\sqrt{5}\)

Hence, the close form is:

\(\displaystyle A_n=c_1\left(2+\sqrt{5} \right)^n+c_2\left(2-\sqrt{5} \right)^n\)

Using the initial values, we may determine the parameters $c_i$:

\(\displaystyle A_1=c_1\left(2+\sqrt{5} \right)+c_2\left(2-\sqrt{5} \right)=3\)

\(\displaystyle A_2=c_1\left(2+\sqrt{5} \right)^2+c_2\left(2-\sqrt{5} \right)^2=2\)

These equations may be written:

\(\displaystyle 2\left(c_1+c_2 \right)+\sqrt{5}\left(c_1-c_2 \right)=3\)

\(\displaystyle 9\left(c_1+c_2 \right)+4\sqrt{5}\left(c_1-c_2 \right)=2\)

Multiplying the first equation by -4 and adding to the second, we obtain:

\(\displaystyle c_1+c_2=-10\)

Multiplying the first equation by 9 and the second by -2 and adding we obtain:

\(\displaystyle c_1-c_2=\frac{23}{\sqrt{5}}\)

Adding together these last two equations, we get:

\(\displaystyle 2c_1=\frac{23}{\sqrt{5}}-10\implies c_1=\frac{23}{2\sqrt{5}}-5\)

and so:

\(\displaystyle c_2=-\left(\frac{23}{2\sqrt{5}}+5 \right)\)

Thus, the closed form for the sequence is:

\(\displaystyle A_n=\left(\frac{23}{2\sqrt{5}}-5 \right)\left(2+\sqrt{5} \right)^n-\left(\frac{23}{2\sqrt{5}}+5 \right)\left(2-\sqrt{5} \right)^n\)

\(\displaystyle A_n=\frac{\sqrt{5}}{10}\left(\left(23-10\sqrt{5} \right)\left(2+\sqrt{5} \right)^n-\left(23+10\sqrt{5} \right)\left(2-\sqrt{5} \right)^n \right)\)
 

Related to CuRio$ty's question at Yahoo Answers regarding a linear homogeneous recursion

1. What is a linear homogeneous recursion?

A linear homogeneous recursion is a mathematical function that describes a sequence of values where each value is calculated using the previous value and a fixed set of coefficients. The function is called "homogeneous" because all terms in the recursion have the same degree and "linear" because the coefficients are constant multiples of the previous term.

2. What is the difference between a linear and non-linear recursion?

The main difference between a linear and non-linear recursion is that a linear recursion has a constant relationship between each term in the sequence, while a non-linear recursion has a variable relationship. In other words, the coefficients in a linear recursion are constant multiples of the previous term, while in a non-linear recursion, the coefficients can vary depending on the previous term.

3. How is a linear homogeneous recursion represented mathematically?

A linear homogeneous recursion is typically represented using the following formula:
xn = a1xn-1 + a2xn-2 + ... + akxn-k
where xn is the nth term in the sequence, a1-a k are the constant coefficients, and k is the number of previous terms used to calculate the current term.

4. What is the purpose of studying linear homogeneous recursions?

Linear homogeneous recursions are commonly used in various fields of mathematics and science to model and analyze real-world phenomena. They can also be used to solve complex problems, such as predicting population growth or analyzing financial data. Studying linear homogeneous recursions helps scientists and mathematicians better understand and make predictions about these systems.

5. How are initial conditions determined in a linear homogeneous recursion?

Initial conditions, or starting values, are usually given in the problem or can be determined by observing the pattern of the sequence. For example, if the sequence is given by xn = 2xn-1 + 3xn-2 with initial values x0 = 0 and x1 = 1, the first few terms of the sequence would be 0, 1, 2, 7, 17, ... . These initial values are used to calculate the rest of the terms in the sequence using the recursive formula.

Similar threads

Replies
1
Views
1K
Replies
4
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
4
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
1
Views
1K
Back
Top