dm-lec7-StrongFormofInduction-s - Discrete Mathematics...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Mathematics CS204 Lecture #6 September 16, 2009 at KAIST 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Review Recall that - Mathematical induction, as a method of proof, is based on the following property of the set of positive integers. For n Z + , S (1) ( n S ( n ) S ( n + 1)) → ∀ n S ( n ) where S ( n ) is a propositional function defined on the set of positive integers. - The implication n S ( n ) S ( n + 1) is supposedly easier to prove than n S ( n ) . 2
Background image of page 2
- The strong form of mathematical induction allows us to assume the truth of all of the preceding statements. - At the inductive step of strong form of induction, we prove the implication ( S ( k ) for all k with 1 k < n ) S ( n ) which is a weaker statement than n S ( n - 1) S ( n ) . Note that if S ( n - 1) S ( n ) is true, then ( S ( k ) for all k with 1 k < n ) S ( n ) is true. - The strong form of induction obtains the same conclusion from a priori weaker statements. 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2010 for the course COMPUTER S Cs206 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.

Page1 / 12

dm-lec7-StrongFormofInduction-s - Discrete Mathematics...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online