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

1 Answer

+3 votes
Best answer

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

answered by Loyal (4.7k 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 Feb 2017
  1. Arjun

    5386 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2240 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,022 answers
59,696 comments
22,133 users