discrete mathematics practice 3: induction & recursion · discrete mathematics practice 3:...
TRANSCRIPT
![Page 1: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/1.jpg)
Discrete MathematicsPractice 3: Induction & Recursion
Dong-Sig Han
Seoul National University
May 11, 2017
![Page 2: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/2.jpg)
Overview
Induction
Recursion
Problems in Homework Assignment
![Page 3: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/3.jpg)
Induction
![Page 4: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/4.jpg)
Mathematical Induction: Introduction
I For every n, P (n) holds (P (k): a propositional function)I Basis step: first domino is knocked overI Inductive step type 1: if k-th domino is knocked over, then
(k+1)-th domino will knocked over.P (k)→ P (k + 1): Mathematical Induction
I Inductive step type 2: if first, second, ..., and k-th dominoesare knocked over, then (k+1)-th domino will knocked over.P (1) ∧ · · · ∧ P (k)→ P (k + 1): Strong Induction
I Hence, all the dominoes will knocked over.
![Page 5: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/5.jpg)
![Page 6: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/6.jpg)
![Page 7: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/7.jpg)
![Page 8: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/8.jpg)
Well-ordering Property
I Every nonempty set of nonnegative integers has a leastelement.
I The set of natural numbers with the order < is well-ordered.I The uncountable subset of the real numbers with the standard
ordering ≤ cannot be well ordered.
R: nonempty subset of positive real numbersr ∈ R, r > 0
0 <r
3 < r
I Well-ordered subset must have a lower bound.
![Page 9: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/9.jpg)
![Page 10: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/10.jpg)
![Page 11: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/11.jpg)
Recursion
![Page 12: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/12.jpg)
![Page 13: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/13.jpg)
Lamé’s Theorem
![Page 14: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/14.jpg)
Lamé’s Theorem
![Page 15: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/15.jpg)
![Page 16: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/16.jpg)
![Page 17: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/17.jpg)
![Page 18: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/18.jpg)
Problems in Homework Assignment
![Page 19: Discrete Mathematics Practice 3: Induction & Recursion · Discrete Mathematics Practice 3: Induction & Recursion Dong-SigHan Seoul National University dshan@bi.snu.ac.kr May11,2017](https://reader030.vdocument.in/reader030/viewer/2022040202/5e7596fa0e3c6c61f04d3a0e/html5/thumbnails/19.jpg)
1. Prove that 1/(2n) ≤ [1 · 3 · 5 · · · · · (2n− 1)]/(2 · 4 · · · · · 2n)whenever n is a positive integer.
2. Using the well-ordering principle to show that if x and y arereal numbers with x < y, then there is a rational number rwith x < r < y.