Use the method of iterative substitution to solve the following recurrence. Give the asymptotic solution as well. Assume that T(n) is constant for n <= 5. T(n) = { c if n <= 5 T(n - 2) + log(n) if n > 5
Added by Jeremy J.
Close
Step 1
.. We can see a pattern here. After k steps, the recurrence relation becomes: T(n) = T(6^kn/2^k) + k*log(n) We can stop the substitution when the argument of T becomes less than 5, i.e., when 6^kn/2^k < 5. Solving this inequality for k gives us k > log_6(5n). Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 97 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
The solution of the recurrence relation $a_{n}=3 a_{n-1}-2 a_{n-2}$ with initial conditions $a_{o}=5$ and $a_{1}=8$ is (A) $a_{n}=2(1)^{n}-3(2)^{n}$ (B) $a_{n}=2(1)^{n}+3(2)^{n}$ (C) $a_{n}=3^{n}+3(2)^{n}$ (D) $a_{n}=2(1)^{n}-5(2)^{n}$
Engineering Mathematics
Combinatorics
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD