alt-mi2 - n = k + 1.) i.e. Suppose

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Alternative Template for MI2 For n ..... consider the statement ........................................................................................... We proceed by induction on n . The statement is true for n = ..... since ............................... Let k ... . Now assume the statement is true for ... n k . (We want to use this assumption to prove that the statement is true for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n = k + 1.) i.e. Suppose ................................................... holds for ... ≤ n ≤ k . Hence the statement is true for n = k + 1. Therefore the statement is true for all n ≥ .... by mathematical induction (MI2). i.e. .................................................. holds for n ≥ .... . ± 1...
View Full Document

This note was uploaded on 06/03/2011 for the course MAS 3300 taught by Professor Staff during the Spring '08 term at University of Florida.

Ask a homework question - tutors are online