2

How do I solve this recurrence relation?

$$ a_k = a_{k-1} + k $$ when $a_0 = 2$.

mvw
  • 35,114
Ben
  • 21

2 Answers2

3

hint: $a_k = (a_k-a_{k-1})+(a_{k-1}-a_{k-2})+\cdots + (a_2-a_1) +(a_1-a_0)+a_0 = k+(k-1)+(k-2)+\cdots + 2+1+2$

DeepSea
  • 78,689
2

Note that $$ a_k - a_{k-1} = k, $$ so $$ a_{n}-a_0 = \sum_{k=1}^{n} (a_k-a_{k-1}) = \sum_{k=1}^n k = \frac{1}{2}n(n+1). $$

Chappers
  • 69,099