Question: Let a, b, c e Z+ with b > 2, and let d N. Prove that the solution for the recurrence relation f(1) =
f(1) = d
f(n) = af(n/b) + c, n = bk, k ≥ 1 satisfies
(a) f(n) = d + c logb n, for n = bk, k ∈ N, when a = 1.
(b) f(n) - dnlogb a + (c/(a - 1 ))[nlogb a - 1], for n = bk, k ∈ N, when a ≥ 2.
Step by Step Solution
3.40 Rating (169 Votes )
There are 3 Steps involved in it
As in the proof of Theorem 101 we find that fn a k f 1 c l a a 2 a k... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (8062).docx
120 KBs Word File
