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

Discussion Overview

The discussion revolves around finding the term a5 in the sequence defined by the recurrence relation an+1 = an + (1/2)n+1, starting with a0 = 1. Participants explore methods to express a5 in terms of a4 and the factor 1/2, discussing the derivation of a closed form for the sequence.

Discussion Character

  • Mathematical reasoning
  • Technical explanation
  • Exploratory

Main Points Raised

  • One participant seeks assistance in expressing a5 in terms of 1/2(a4) after writing out the first few terms of the sequence.
  • Another participant suggests finding the closed form for an, proposing to identify the homogeneous and particular solutions of the associated difference equation.
  • A later reply clarifies the concept of a closed form, providing an example of a different sequence to illustrate the idea.
  • Several participants detail the process of finding the closed form for the given recursion, arriving at a general solution of an = 2 - 2^-n.
  • One participant explicitly calculates a5 and 1/2(a4), showing their equivalence and deriving a5 = 1 + 1/2(a4).
  • Another participant presents an alternative approach to derive a5 using the recursion directly, calculating the values of previous terms.
  • One participant notes that a5 can also be expressed in terms of a4 and a power of 1/2, reinforcing the connection between the terms.

Areas of Agreement / Disagreement

Participants generally agree on the approach to derive a closed form for the sequence, but there are multiple methods proposed to express a5 in relation to a4, indicating that the discussion remains somewhat unresolved with competing views on the best approach.

Contextual Notes

Some participants provide detailed derivations, while others focus on specific calculations. The discussion includes various assumptions about the sequence and the methods used to derive the terms, which may not be universally accepted.

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
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 44 ·
2
Replies
44
Views
7K
  • · Replies 3 ·
Replies
3
Views
2K