191 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 _

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Prateek Raghuvanshi asked Jan 9, 2019
468 views
How many 5 digit numbers can be formed if either (a) every successive digit exceeds its predecessor ,or(b) every successive digit is smaller than it’s predecessor Note:...
0 votes
0 votes
0 answers
2
Vipin Rai asked Jan 28, 2019
375 views
Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 28 KB and the maximum segment size is 2KB. How l...
0 votes
0 votes
0 answers
3
Vipin Rai asked Jan 25, 2019
258 views
A system uses SR Protocol with a window size of 4. If each packet carries 5000 bits of data, then the time required to transfer 5 million bits of data , if the distance ...
0 votes
0 votes
1 answer
4
screddy1313 asked Jan 27, 2019
486 views
Calculate total time to transmit a 1500 KB file over a link.Assume one way delay in either direction is 40ms .Bandwidth is 1Mbpsand packet size including header is 1 KB ...