Prévia do material em texto
Chapter 2, Problem 16E Step-by-step solution Step 1 of 3 5619-2-16E AID: 1112 I 29/08/2012 Inductive proof of Main Recurrence theorem Consider T(n) satisfying: T (n) (n) Where = and Consider the expression for all It can proved by showing that for some We have to prove the given expression by the method of mathematical induction. Step 2 of 3 Basic Step: To check whether the statement is true The value of n₀ is set in such a way that the basic step is made true. Therefore for n = above statement is true. Inductive Step: To prove statement it should be shown that the