edited by
218 views
2 votes
2 votes

What is the solution of the following recurrence relation? $a_n = 6.a_{n-1} - 9.a_{n-2}$ 
Base cases : $a_0 = 1$ and $a_1 = 6$.

  1. $3n$
  2. $2.3n$
  3. $3n + n.3n$
  4. $3n - n.3n$
edited by

1 Answer

Answer:

Related questions

5 votes
5 votes
2 answers
1
Bikram asked May 24, 2017
567 views
Let $S$ be the set $\{1,2,3, \dots ,8\}$. Let $n$ be the number of sets of two non-empty disjoint subsets of $S$. The value of $n$ is _______.
5 votes
5 votes
1 answer
2
Bikram asked May 24, 2017
477 views
Total number of ways we can fill a $4 \times 4$ matrix by $0$ and $1$’s such that every row and column contains odd no of $0$'s and $1$'s is ________.
2 votes
2 votes
2 answers
3
Bikram asked May 24, 2017
386 views
Which of the above is a lattice :b and ca and db and da only
3 votes
3 votes
1 answer
4
Bikram asked May 24, 2017
275 views
$O(G) = 12$ and $G$ is cyclic. The total number of generators possible in $G$ are __________.