# L13_AdvancedInduction - 1-1COMP170Discrete Mathematical...

This preview shows pages 1–13. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1-1COMP170Discrete Mathematical Toolsfor Computer ScienceDiscrete Math for Computer ScienceK. Bogart, C. Stein and R.L. DrysdaleSection 4.5, pp. 189-193Advanced InductionVersion 2.0: Last updated, May 13, 2007Slidesc2005 by M. J. Golin and G. Trippen2-1Note: We have skipped section 4.4 of the textbook becausethe material it contains, especially theMaster Theorem, willbe taught in later classes, e.g., COMP2713-1More Advanced Induction•Induction, as we’ve seen it so far, was aboutdefining a statementp(n), and then proving•In “practice”, in some real induction proofs,p(n)might not be fullly definedbeforewe start theproof and will only be fully describedduringthedescription of the proof•In some cases it also helps to use astrongerinduction hypothesis than the “natural” one.p(n-1)⇒p(n)or(p(1)∧p(2)∧ ··· ∧p(n-1))⇒p(n)4-1IfT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).IfT(n)≤T(n/3) +cnfor some constantc,thenT(n) =O(n).We will illustrate these concepts with three example proofs:Example 1Example 2Examples 1 & 2will illustrate how to derive the inductionstatementp(n)while provingp(n)4-2IfT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).IfT(n)≤T(n/3) +cnfor some constantc,thenT(n) =O(n).IfT(n)≤4T(n/2) +cnfor some constantc,thenT(n) =O(n2).We will illustrate these concepts with three example proofs:Example 1Example 3Example 2Examples 1 & 2will illustrate how to derive the inductionstatementp(n)while provingp(n)Example 3will illustrate what is meant by using astrongerinduction hypothesis.5-1ifT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).Example 1:5-2From definition of bigOwe need to show thatifT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).∃n, ksuch that∀n > n, T(n)≤knlognExample 1:5-3As before we will assume thatnis a power of2From definition of bigOwe need to show thatifT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).∃n, ksuch that∀n > n, T(n)≤knlognExample 1:5-4As before we will assume thatnis a power of2From definition of bigOwe need to show thatA naive induction proof would assume that(*)T(n)≤knlognwas true forn= 2i-1and then prove that(*)was also true forn= 2iifT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).∃n, ksuch that∀n > n, T(n)≤knlognExample 1:5-5As before we will assume thatnis a power of2From definition of bigOwe need to show thatA naive induction proof would assume that(*)T(n)≤knlognwas true forn= 2i-1and then prove that(*)was also true forn= 2iifT(n)≤2T(n/2) +cnfor some constantc,thenT(n) =O(nlogn).∃n, ksuch that∀n > n, T(n)≤knlognOur problem is that wedo not know whatkisso we can’t prove(*)Example 1:6-1We want to prove that if, for alln= 2i,T(n)≤2T(n/2) +cnfor some constantc,⇒ ∀n > n, T(n)≤knlogn(*)6-2We want to prove that if, for alln= 2i,T(n)≤2T(n/2) +cnfor some constantc,⇒ ∀n > n, T(n)≤knlognOur proof will be by induction,but with a twist....
View Full Document

## This note was uploaded on 08/25/2010 for the course COMP COMP170 taught by Professor M.j.golin during the Spring '10 term at HKUST.

### Page1 / 87

L13_AdvancedInduction - 1-1COMP170Discrete Mathematical...

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

View Full Document
Ask a homework question - tutors are online