Finding a5 in an+1 Sequence Using a4 and 1/2

  • Context: MHB 
  • Thread starter Thread starter brunette15
  • Start date Start date
  • Tags Tags
    Sequence
Click For Summary
SUMMARY

The discussion focuses on deriving the term a5 in the sequence defined by the recurrence relation an+1 = an + (1/2)n+1, starting with a0 = 1. Participants emphasize finding the closed form for an, which is determined to be a_n = 2 - 2^(-n). The relationship between a5 and a4 is established as a5 = (1/2)a4 + 1, demonstrating the connection between these terms through the derived closed form and recursive calculations.

PREREQUISITES
  • Understanding of recurrence relations and difference equations
  • Familiarity with closed form solutions in sequences
  • Knowledge of the principle of superposition in solving linear equations
  • Basic algebraic manipulation and solving equations
NEXT STEPS
  • Study the method of undetermined coefficients for finding particular solutions
  • Learn about homogeneous and particular solutions in difference equations
  • Explore the principle of superposition in the context of linear recurrences
  • Practice deriving closed forms for various recurrence relations
USEFUL FOR

Mathematicians, students studying discrete mathematics, and anyone interested in solving recurrence relations and understanding sequences.

brunette15
Messages
58
Reaction score
0
I have been given the following sequence: an+1 = an + (1/2)n+1, n>=0 with a0 = 1.

I am trying to express a5 in terms of 1/2(a4) .

I have started by writing out the first few terms however i am still struggling with getting a5.

Can anyone please help me out with this?
Thanks in advance!
 
Physics news on Phys.org
What I would do here is find the closed form for $a_n$ first. Can you identify the homogeneous solution $h_n$ and the form of the particular solution $p_n$? If so, can you then find the particular solution and then by the principle of superposition give the general solution, and then use the given initial value to obtain the solution satisfying all given conditions?

Once you do this, then expressing $a_5$ as a function of $\frac{1}{2}a_4$ is straightforward. :D
 
MarkFL said:
What I would do here is find the closed form for $a_n$ first. Can you identify the homogeneous solution $h_n$ and the form of the particular solution $p_n$? If so, can you then find the particular solution and then by the principle of superposition give the general solution, and then use the given initial value to obtain the solution satisfying all given conditions?

Once you do this, then expressing $a_5$ as a function of $\frac{1}{2}a_4$ is straightforward. :D

Hi, thanks for the reply. I kind of see where you are heading with this, i am a bit unsure what you mean by closed form of an though?
 
brunette15 said:
Hi, thanks for the reply. I kind of see where you are heading with this, i am a bit unsure what you mean by closed form of an though?

When we find the closed form for the solution to a difference equation, we find (in this case) $a_n$ as a function of $n$. For example, if given:

$$a_n=a_{n-1}+n$$ where $a_1=1$, then the closed form is:

$$a_n=\frac{n(n+1)}{2}$$
 
I will walk you through the process for finding the closed form for the given recursion, or difference equation:

$$a_{n+1}=a_{n}+\left(\frac{1}{2}\right)^{n+1}$$ where $a_0=1$.

The associated homogeneous equation is:

$$a_{n+1}-a_{n}=0$$

Now, we see the characteristic equation is:

$$r-1=0\implies r=1$$

Thus we know the homogeneous solution is given by:

$$h_n=c_1\cdot1^n=c_1$$

Inspection of the original equation tells us the particular solution must have the form:

$$p_n=A\left(\frac{1}{2}\right)^n$$

We can now use the method of undetermined coefficnets to find $A$. Substituting this solution into the original equation, we obtain (after rearranging a bit):

$$p_{n+1}-p_{n}=\left(\frac{1}{2}\right)^{n+1}$$

Now, using the form of $p_n$, we get:

$$A\left(\frac{1}{2}\right)^{n+1}-A\left(\frac{1}{2}\right)^n=\left(\frac{1}{2}\right)^{n+1}$$

Multiplying though by $2^{n+1}\ne0$, there results:

$$A-2A=1\implies A=-1$$

And so, using the principle of superposition, we obtain the general solution:

$$a_n=h_n+p_n=c_1-\frac{1}{2^n}$$

Now, all that's left to do is find the parameter $c_1$ using the given initial value:

$$a_0=c_1-\frac{1}{2^0}=1\implies c_1=2$$

Hence, the closed form can be written as:

$$a_n=2-2^{-n}$$

So, can you now write $a_5$ as a function of $\dfrac{1}{2}a_4$?
 
MarkFL said:
I will walk you through the process for finding the closed form for the given recursion, or difference equation:

$$a_{n+1}=a_{n}+\left(\frac{1}{2}\right)^{n+1}$$ where $a_0=1$.

The associated homogeneous equation is:

$$a_{n+1}-a_{n}=0$$

Now, we see the characteristic equation is:

$$r-1=0\implies r=1$$

Thus we know the homogeneous solution is given by:

$$h_n=c_1\cdot1^n=c_1$$

Inspection of the original equation tells us the particular solution must have the form:

$$p_n=A\left(\frac{1}{2}\right)^n$$

We can now use the method of undetermined coefficnets to find $A$. Substituting this solution into the original equation, we obtain (after rearranging a bit):

$$p_{n+1}-p_{n}=\left(\frac{1}{2}\right)^{n+1}$$

Now, using the form of $p_n$, we get:

$$A\left(\frac{1}{2}\right)^{n+1}-A\left(\frac{1}{2}\right)^n=\left(\frac{1}{2}\right)^{n+1}$$

Multiplying though by $2^{n+1}\ne0$, there results:

$$A-2A=1\implies A=-1$$

And so, using the principle of superposition, we obtain the general solution:

$$a_n=h_n+p_n=c_1-\frac{1}{2^n}$$

Now, all that's left to do is find the parameter $c_1$ using the given initial value:

$$a_0=c_1-\frac{1}{2^0}=1\implies c_1=2$$

Hence, the closed form can be written as:

$$a_n=2-2^{-n}$$

So, can you now write $a_5$ as a function of $\dfrac{1}{2}a_4$?

Thankyou so much!
 
To finish up the problem, what I did was write:

$$a_5=2-2^{-5}$$

$$\frac{1}{2}a_4=\frac{1}{2}\left(2-2^{-4}\right)=1-2^{-5}$$

Now, if we solve both equations for $2^{-5}$ and equate the results, we obtain:

$$2^{-5}=2-a_5=1-\frac{1}{2}a_4$$

And from this, by solving for $a_5$, we get:

$$a_5=\frac{1}{2}a_4+1$$

Another way to proceed would be to begin with the given recursion and compute the following values:

$$a_1=\frac{3}{2},\,a_2=\frac{7}{4},\,a_3=\frac{15}{8},\,a_4=\frac{31}{16}$$

Then use:

$$a_5=a_4+\frac{1}{32}=\frac{1}{2}a_4+\frac{1}{2}\cdot\frac{31}{16}+\frac{1}{32}=\frac{1}{2}a_4+1$$
 
It is also possible to say
\[
a_{n+1}=a_n+\frac{1}{2^{n+1}}\implies a_5=a_4+\frac{1}{2^5}=2\frac{a_4}{2}+\frac{1}{2^5}.
\]
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 44 ·
2
Replies
44
Views
7K
  • · Replies 3 ·
Replies
3
Views
2K