in Combinatory
184 views
0 votes
0 votes
for whole number n, consider the following recurrence relation defined as

$a_{n+2}=(n+3)a_{n+1}-(n+2)a_n$

and $a_1=1,a_2=3$

find $( \sum_{k=1}^{2015}a_k)(mod\; 100)$ is _
in Combinatory
184 views

1 comment

I got the sum as $1 + 2016 \times a_{2014}$, but don't know how to find the value of $a_{2014}$.

Any ideas?
0
0

Please log in or register to answer this question.

Related questions

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