GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
129 views
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
asked in Combinatory by (421 points)  
retagged by | 129 views

1 Answer

+3 votes
Best answer

The recurrence relation is n^2 + 4n + 4 

answered by Boss (6k points)  
selected by
Thanks :)
 I had made the mistake of adding up all the constant terms and then looking for some pattern in them :p
Welcome.:)


Top Users Jul 2017
  1. Bikram

    3782 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1832 Points

  4. joshi_nitish

    1494 Points

  5. Arnab Bhadra

    1096 Points

  6. Arjun

    1054 Points

  7. Hemant Parihar

    1050 Points

  8. Shubhanshu

    972 Points

  9. Ahwan

    876 Points

  10. akash.dinkar12

    642 Points


23,953 questions
30,895 answers
70,107 comments
29,272 users