Computer Sciences > Gate 2016 Set-1 > recurrence relation
Consider the recurrence relation
a1 = 8, an = 6n2 + 2n + an-1.
Let a99 = k x 104.
The value of K is _____
a1 = 8, an = 6n2 + 2n + an-1.
Let a99 = k x 104.
The value of K is _____
Correct : a
Similar Questions
Let an be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for an?
Let an be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for an?
Let an be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for an?
Total Unique Visitors
Loading......