Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with induction
Search options not deleted
user 131786
Questions about mathematical induction and inductive proofs.
1
vote
Prove by induction that a recurrence has solution $T(n)=\Theta(n^2 \log_{3}n)$
Let $n = 3^{k}$ to obtain $T(3^{k}) = 9T(3^{k-1}) + 9^{k}$. This can be written $t_{k} - 9t_{k-1} = 9^{k}$. The characteristic equation is $(x-9)^{2} = 0$. Hence $t_{k} = c_{1}9^{k} + c_{2}k9^{k}$. Pu …
- 43