Math Problem Statement
Utilice el metodo de sustitucion para resolver el analisis de recurrencia de T (n) = k + n^(2) + 5 T ( n/3 ) siendo T (1) = k
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Recurrence Relations
Asymptotic Analysis
Substitution Method
Geometric Series
Formulas
T(n) = k + n^2 + 5T(n/3)
S_{const} = k (1 + 5 + 25 + ... + 5^j) = k (5^{j+1} - 1) / 4
S_{n^2} = n^2 (1 + 5/9 + 25/81 + ...) = n^2 * 9/4
Theorems
Master Theorem
Geometric Series Sum
Suitable Grade Level
Undergraduate (Computer Science, Algorithms)