The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
155 views
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
asked in Combinatory by Junior (507 points)
retagged by | 155 views

1 Answer

+3 votes
Best answer

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

answered by Boss (8.1k 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.:)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,947 questions
36,793 answers
91,077 comments
34,690 users