Show that this sequence satisfies the recurrence relation

bdh2991
Messages
102
Reaction score
0

Homework Statement


Let d0, d1, d2,... be defined by the formula dn = 3n - 2n for all integers n ≥ 0. Show that this sequence satisfies the recurrence relation.

dk = 5dk-1 - 6dk-2.

Homework Equations


The Attempt at a Solution



I found that dk = 3k - 2k

dk-1 = 3k-1 - 2k-1
dk-2 = 3k-2 - 2k-2

after plugging dk-1 and dk - 2 into the formula dk = 5dk-1 - 6dk-2, i am stuck and do not understand how to do the algebra if that is what i 'm supposed to be doing...any help?
 
Physics news on Phys.org
bdh2991 said:

Homework Statement


Let d0, d1, d2,... be defined by the formula dn = 3n - 2n for all integers n ≥ 0. Show that this sequence satisfies the recurrence relation.

dk = 5dk-1 - 6dk-2.

Homework Equations



The Attempt at a Solution



I found that dk = 3k - 2k

dk-1 = 3k-1 - 2k-1
dk-2 = 3k-2 - 2k-2

after plugging dk-1 and dk - 2 into the formula dk = 5dk-1 - 6dk-2, i am stuck and do not understand how to do the algebra if that is what i 'm supposed to be doing...any help?
Take
dk-1 = 3k-1 - 2k-1

and

dk-2 = 3k-2 - 2k-2 '​
Plug those into
5dk-1 - 6dk-2 .​
Do some algebra & see what you get.
 
SammyS said:
Take
dk-1 = 3k-1 - 2k-1

and

dk-2 = 3k-2 - 2k-2 '​
Plug those into
5dk-1 - 6dk-2 .​
Do some algebra & see what you get.

This is what i tried doing at i stated above...after you plug them in i get

3k - 2k = 5( 3k-1 - 2k-1) - 6(3k-2 - 2k-2), I don't really understand what i can do with that algebraically...i must just be missing it...
 
bdh2991 said:
This is what i tried doing at i stated above...after you plug them in i get

3k - 2k = 5( 3k-1 - 2k-1) - 6(3k-2 - 2k-2), I don't really understand what i can do with that algebraically...i must just be missing it...

Use 3^(k-1)=3*3^(k-2) and 2^(k-1)=2*2^(k-2).
 
Dick said:
Use 3^(k-1)=3*3^(k-2) and 2^(k-1)=2*2^(k-2).

ok so changing the equation to that gives me:

5(3*3k-2 - 2*2k-2) - 6( 3k-2 - 2k-2)

i can see how that gave me some like terms but multiplying through gives me:

15 * 3k-2 - 10 * 2k-2 - 6 * 3k-2 - 6 * 2k-2

i feel like that wasn't where you were leading me lol...i'm sorry, I'm not that great at algebra
 
bdh2991 said:
ok so changing the equation to that gives me:

5(3*3k-2 - 2*2k-2) - 6( 3k-2 - 2k-2)

i can see how that gave me some like terms but multiplying through gives me:

15 * 3k-2 - 10 * 2k-2 - 6 * 3k-2 - 6 * 2k-2

i feel like that wasn't where you were leading me lol...i'm sorry, I'm not that great at algebra

I guess not. But you're almost there. Collect the 3^(k-2) terms. What do you get? And you've a sign error on the last term. Could you fix it?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top