Induction Proof: Am I on the right track?

elizaburlap
Messages
8
Reaction score
0

Homework Statement



Let a(1)=a(2)=5 and a(n+1)=a(n)+6a(n-1), n≥2
Use induction to prove that a(n)=(3^n)-(-2)^n for n≥1

Homework Equations



Not applicable

The Attempt at a Solution



I have check that a(3) = 5+6·5 = 35 = 3^3-(-2)^3 so it holds for n = 3.
The cases n = 1 and n = 2 are similar and also hold

So I assumed that it holds for n and considered

a(n+1) = a(n)+6a(n-1)
= (3^n-(-2)^n)+6(3^(n-1)-(-2)^(n-1))

The second term [6(3^(n-1)-(-2)^(n-1))] equals [2·3^n+3·(-2)^n].

So,

a(n+1) = (3^n-(-2)^n)+(2·3^n+3·(-2)^n)
= 3^(n+1)-(-2)^(n+1)

Is this a valid induction proof? Am I on the right lines here?

Thanks!
 
Physics news on Phys.org
welcome to pf!

hi elizaburlap! welcome to pf! :smile:

(try using the X2 and X2 buttons just above the Reply box :wink:)
elizaburlap said:
So I assumed that it holds for n and considered

a(n+1) = a(n)+6a(n-1)
= (3^n-(-2)^n)+6(3^(n-1)-(-2)^(n-1)) …

yes, that's all (difficult to read :wink:, but) fine! :smile:
 
Thank you! This was my first attempt at an induction proof, so I wasn't too sure.

Oh! I see the x2 now, thanks :)
 
Math1115. (:p)
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Replies
7
Views
2K
Replies
15
Views
2K
Replies
7
Views
1K
Replies
4
Views
1K
Replies
7
Views
923
Replies
22
Views
456
Replies
2
Views
2K
Replies
1
Views
1K
Back
Top