47 Slides--Induction III, Fibonacci

47 Slides--Induction III, Fibonacci - CS103A HO# 47...

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

View Full Document Right Arrow Icon
CS103A HO# 47 Induction III, Fibonacci 2/27/08 1 CI WOP Well Ordering Property: If A is a non-empty set of positive integers, then A has a least element. CI WOP Well Ordering Property: If A is a non-empty set of positive integers, then A has a least element. Proof. Suppose that A is a set of positive integers without a least element, and let P(n) be the proposition that n A. We will show that n P(n) by complete mathematical induction, i.e., that A must be empty. BASE CASE: Since 1 is the smallest positive integer, 1 A, because if so, 1 would be the least element of A. So P(1) is true. INDUCTIVE STEP: Assume: for some positive integer k, P(i) for 1 i k. Show P(k + 1). CI WOP Well Ordering Property: If A is a non-empty set of positive integers, then A has a least element. Proof. Suppose that A is a set of positive integers without a least element, and let P(n) be the proposition that n A. We will show that n P(n) by complete mathematical induction, i.e., that A must be empty. BASE CASE: Since 1 is the smallest positive integer, 1 A, because if so, 1 would be the least element of A. So P(1) is true. INDUCTIVE STEP: Assume: for some positive integer k, P(i) for 1 i k. Show P(k + 1). If k + 1 A, k + 1 would be the least element in A, since no integer less than k + 1 is in A by the inductive hypothesis. Thus k + 1 A, and P(k+1) is true. Thus by C.I., n P(n). Since A is a set of positive integers to which no integer belongs, we have shown that if A has no least element, it must be empty. CI WOP Well Ordering Property: If A is a non-empty set of positive integers, then A has a least element. Proof. We will show that if A is a set of positive integers without a least element, then A is empty. Let P(n) be the proposition that n A. We will show that n P(n) by complete mathematical induction. BASE CASE: Since 1 is the smallest positive integer, 1 A, because if so, 1 would be the least element of A. So P(1) is true. INDUCTIVE STEP: Assume: for some positive integer k, P(i) for 1 i k.
Background image of page 1

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

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

This note was uploaded on 10/01/2011 for the course CS 103A taught by Professor Plummer,r during the Winter '07 term at Stanford.

Page1 / 6

47 Slides--Induction III, Fibonacci - CS103A HO# 47...

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

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