Timeline for Solve recurrence T(n)=2T(n-1)+n for n greater than 1 and T(1)=1
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2019 at 14:14 | comment | added | Yuval Filmus | Furthermore, by finding the Jordan form of $M$, you can extract the closed form solution. | |
| Jan 10, 2019 at 13:53 | history | edited | RcnSc | CC BY-SA 4.0 |
added 2 characters in body
|
| Jan 10, 2019 at 13:43 | history | answered | RcnSc | CC BY-SA 4.0 |