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

1 Answer

+3 votes
Best answer

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

answered by Boss (5.3k 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 Mar 2017
  1. rude

    5236 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Vignesh Sekar

    1430 Points

  8. Bikram

    1424 Points

  9. Akriti sood

    1420 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,549 questions
26,889 answers
61,247 comments
23,251 users