1 / 15

02/28/13

Induction. 02/28/13. http://www.picshag.com/recursive-painting.html. Discrete Structures (CS 173) Derek Hoiem, University of Illinois. Midterms. Grades available Returned in discussion sections Averages Mean: 87 Median: 92. Last lecture: graphs and 2-way bounds.

chaz
Télécharger la présentation

02/28/13

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Induction 02/28/13 http://www.picshag.com/recursive-painting.html Discrete Structures (CS 173) Derek Hoiem, University of Illinois

  2. Midterms • Grades available • Returned in discussion sections • Averages • Mean: 87 • Median: 92

  3. Last lecture: graphs and 2-way bounds • Terminology for graph connectivity • Walk, path, cycle, acyclic, closed, Euler circuit, distance, diameter, connected components • Graph coloring and how to apply it • How to use two-way bounding in a variety of settings

  4. This lecture (and next): Induction • What is induction • Examples

  5. Does domino n fall?

  6. Does domino n fall? • Suppose domino k falls. Then domino k+1 falls.

  7. Does domino n fall? • Suppose domino k falls. Then domino k+1 falls. • The first domino falls

  8. Induction Inductive hypothesis: Suppose domino k falls. Inductive conclusion: Domino k+1 falls. Base case: The first domino falls.

  9. Simple math example Claim: for all natural integers .

  10. Basic structure of induction proof Claim: Inductive step: or Base: is true. Weak Induction Inductive hypothesis Inductive conclusion Strong Induction

  11. Another math example Claim: For ,

  12. Number theory example Claim: For any natural integer , is divisible by .

  13. Geometrical example Claim: For any positive integer , a checkerboard with one square removed can be tiled using right triminos. right trimino

  14. Things to remember • Induction requires demonstrating a base case and an inductive step • Inductive step usually involves showing that or

  15. Next class • Induction with graphs, stamps, and games

More Related