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

1 Answer

+3 votes
Best answer

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

answered by Boss (5.9k 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 May 2017
  1. akash.dinkar12

    3338 Points

  2. pawan kumarln

    2108 Points

  3. Bikram

    1922 Points

  4. sh!va

    1682 Points

  5. Arjun

    1614 Points

  6. Devshree Dubey

    1272 Points

  7. Debashish Deka

    1208 Points

  8. Angkit

    1056 Points

  9. LeenSharma

    1018 Points

  10. Arnab Bhadra

    812 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    1008 Points

  2. pawan kumarln

    734 Points

  3. Arnab Bhadra

    726 Points

  4. Arjun

    342 Points

  5. bharti

    328 Points


22,893 questions
29,196 answers
65,302 comments
27,695 users