Register

Recurrence Relation-Counting technique

605 views
1 1 vote

How to solve this equation

an+2-5an+1+6an=2   where a0=1 and a1=2

i know how to solve if it is 0 in RHS, but how to take care of this 2?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Disk SchedulingNext → · Gate 2006
← Previous in category · TheTrevTutor discret...Next in category → · recurrence relation
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
1.5k
1.5k views
piyushkr asked Dec 24, 2015
1,481 views
What will be the recurrence relation of the given below program for Preorder traversing technique?
Preorder(root){ Printf("root.data"); Preorder(root.leftsidetree); Preorder(root.rightside);}
1 1 vote
2 2 answers
995
995 views
Surajit asked Jan 16, 2017
995 views
Rosen-Advance Counting Technique-26
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01.$I am getting a recurrence like An = 2^(n-2) + 2A(n-1) - A (N-2) .Answe...
0 0 votes
2 2 answers
1.5k
1.5k views
LavTheRawkstar asked Jul 4, 2016
1,487 views
Kenneth Rosen:Advance Counting Technique
11)Suppose that the number of bacteria in a colony triples every hour.Set up a recurrence relation for the number of bacteria after n hours have elapsedIf $100$ bacteria ...
22 22 votes
1 1 answer
4.2k
4.2k views
P C asked Dec 31, 2022
4,161 views
Recurrence Relation - Self Doubt
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is odd ...