So, I know how to convert to explicit formulas things like the Fibonacci sequence cause it only consists of an like this:
an=an−1+an−2
However my problem is I've encountered a type of this problem I haven't been thought how to approach, and can't find the solution anywhere:
an=an−1+n+1
The sequence this is supposed to represent is: 0,2,5,9,14,20,27...
The correct explicit formula that I don't know how to get to for this is:
an=n2(n+3)
To solve this, I've tried converting it to:
rn=rn−1+n+1
and treating n as the superscript of r... to end up with
r2=r+2+1
..which is the standard procedure I've been taught, then solving for r to get r1 and r2 and adding α and β like I've been taught to get:
an=α(r1)n+β(r2)n
.. then plugging in known n and an values to get a system of equations and then finally plug in the resulting α and β to get the explicit formula, which however turned out to be complete gibberish. I'm sure I didn't mess up the system of equations or any step since I used automated equation solving to make sure.
That means the problem is me not knowing how to deal with that problem in the first place, I think. It seems to have a non-standard procedure to it.
Answer
The formula which you give, an=n2(n+3) is not the correct formula for the sequence defined recursively by a1=0,an+1=an+n+1.
This is a sequence with a constant second difference.
The sequence is
0,2,5,9,14,20,27,⋯
The first difference is found by subtracting each term from the following term:
2,3,4,5,6,7,⋯
The second difference is a constant sequence consisting entirely of ones.
When the second difference is constant, an is a second degree polynomial in n
an=rn2+sn+t
We are given that
an+1−an=n+1
Therefore
r(n+1)2+s(n+1)+t−(rn2+sn+t)=n+12rn+r+s=n+1
So
2r=1r+s=1
which gives r=s=12
Now we have that
an=12n2+12n+ta1=12+12+t=0
Therefore, t=−1
an=12n2+12n−1=12(n2+n−2)=12(n−1)(n+2)
No comments:
Post a Comment