Mathematical Induction I Lecture 5: Sep 20 (chapter 4.2-4.3 of the textbook and chapter 3.3-3.4 of the course notes)

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Mathematical Induction
Mathematical induction Isaac Fung. Announcement ► Homework 1 released ► Due on 6 Oct 2008 (in class)
Mathematical Induction II Lecture 14: Nov
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Induction and Recursion. Odd Powers Are Odd Fact: If m is odd and n is odd, then nm is odd. Proposition: for an odd number m, m k is odd for all non-negative.
Induction Lecture 5: Sep 21 (chapter of the book and chapter of the notes)
Induction and recursion
CS5371 Theory of Computation
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Copyright © Cengage Learning. All rights reserved.
Methods of Proof Lecture 4: Sep 16 (chapter 3 of the book)
1 Strong Mathematical Induction. Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n; a and b be fixed integers.
Induction and Recursion by: Mohsin tahir (GL) Numan-ul-haq Waqas akram Rao arslan Ali asghar.
Induction (chapter of the book and chapter of the notes)
Induction and recursion
Algorithm Design and Analysis (ADA)
Mathematical Maxims and Minims, 1988
Introduction to Proofs
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
Discrete Mathematics Tutorial 11 Chin
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
Discrete Maths: Induction/1 1 Discrete Maths Objective – –to introduce mathematical induction through examples , Semester
9.4 Mathematical Induction
Mathematical Induction I Lecture 4: Sep 16. This Lecture Last time we have discussed different proof techniques. This time we will focus on probably the.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
1 INFO 2950 Prof. Carla Gomes Module Induction Rosen, Chapter 4.
Mathematical Induction Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If.
Mathematical Induction
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring
3.3 Mathematical Induction 1 Follow me for a walk through...
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Induction (chapter of the book and chapter of the notes)
Hubert Chan (Chapters 1.6, 1.7, 4.1)
The Foundations: Logic and Proofs
Advanced Algorithms Analysis and Design
Mathematical Induction II
Induction and recursion
Predicate Calculus Validity
Hubert Chan (Chapters 1.6, 1.7, 4.1)
Gray Code Can you find an ordering of all the n-bit strings in such a way that two consecutive n-bit strings differed by only one bit? This is called the.
Chapter 5 Induction and Recursion
Induction and recursion
Follow me for a walk through...
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Methods of Proof Rosen 1.7, 1.8 Lecture 4: Sept 24, 25.
Applied Discrete Mathematics Week 9: Integer Properties
Follow me for a walk through...
Induction Chapter
Advanced Analysis of Algorithms
Mathematical Induction
Induction Rosen 5 Lecture 8: Oct 29, 30.
Follow me for a walk through...
Methods of Proof Rosen 1.7, 1.8 Lecture 4: Sept, 2019.
Presentation transcript:

Mathematical Induction I Lecture 5: Sep 20 (chapter of the textbook and chapter of the course notes)

This Lecture Last time we have discussed different proof techniques. This time we will focus on probably the most important one – mathematical induction. This lecture’s plan is to go through the following: The idea of mathematical induction Basic induction proofs (e.g. equality, inequality, property,etc) An interesting example A paradox

Odd Powers Are Odd Fact: If m is odd and n is odd, then nm is odd. Proposition: for an odd number m, m i is odd for all non-negative integer i. Let P(i) be the proposition that m i is odd. P(1) is true by definition. P(2) is true by P(1) and the fact. P(3) is true by P(2) and the fact. P(i+1) is true by P(i) and the fact. So P(i) is true for all i. Idea of induction.

Divisibility by a Prime Theorem. Any integer n > 1 is divisible by a prime number. Idea of induction. Let n be an integer. If n is a prime number, then we are done. Otherwise, n = ab, both are smaller than n. If a or b is a prime number, then we are done. Otherwise, a = cd, both are smaller than a. If c or d is a prime number, then we are done. Otherwise, repeat this argument, since the numbers are getting smaller and smaller, this will eventually stop and we have found a prime factor of n.

Objective: Prove Idea of Induction This is to prove The idea of induction is to first prove P(0) unconditionally, then use P(0) to prove P(1) then use P(1) to prove P(2) and repeat this to infinity…

The Induction Rule 0 and (from n to n +1), proves 0, 1, 2, 3,…. P (0),  n  Z P (n)  P (n+1)  m  Z. P (m) Very easy to prove Much easier to prove with P(n) as an assumption. The point is to use the knowledge on smaller problems to solve bigger problems. valid rule

This Lecture The idea of mathematical induction Basic induction proofs (e.g. equality, inequality, property,etc) An interesting example A paradox

Proving an Equality Let P(n) be the induction hypothesis that the statement is true for n. Base case: P(1) is true Induction step: assume P(n) is true, prove P(n+1) is true. because both LHS and RHS equal to 1 That is, assuming: Want to prove: This is much easier to prove than proving it directly, because we already know the sum of the first n terms!

Proving an Equality Let P(n) be the induction hypothesis that the statement is true for n. Base case: P(1) is true Induction step: assume P(n) is true, prove P(n+1) is true. by induction because both LHS and RHS equal to 1

Proving an Equality Let P(n) be the induction hypothesis that the statement is true for n. Base case: P(1) is true Induction step: assume P(n) is true, prove P(n+1) is true. by induction

Proving a Property Base Case (n = 1): Induction Step: Assume P(i) for some i  1 and prove P(i + 1): Assume is divisible by 3, prove is divisible by 3. Divisible by 3 by inductionDivisible by 3

Proving a Property Base Case (n = 2): Induction Step: Assume P(i) for some i  2 and prove P(i + 1): Assume is divisible by 6 is divisible by 6. Divisible by 2 by case analysis Divisible by 6 by induction Prove

Proving an Inequality Base Case (n = 3): Induction Step: Assume P(i) for some i  3 and prove P(i + 1): Assume, prove by induction since i >= 3

Proving an Inequality Base Case (n = 2): is true Induction Step: Assume P(i) for some i  2 and prove P(i + 1): by induction

This Lecture The idea of mathematical induction Basic induction proofs (e.g. equality, inequality, property,etc) An interesting example A paradox

Goal: tile the squares, except one in the middle for Bill. Puzzle

There are only trominos (L-shaped tiles) covering three squares: For example, for 8 x 8 puzzle might tile for Bill this way: Puzzle

Theorem: For any 2 n x 2 n puzzle, there is a tiling with Bill in the middle. Proof: (by induction on n) P(n) ::= can tile 2 n x 2 n with Bill in middle. Base case: (n=0) (no tiles needed) Puzzle Did you remember that we proved is divisble by 3?

Induction step: assume can tile 2 n x 2 n, prove can handle 2 n+1 x 2 n n Puzzle Now what??

The new idea: Prove that we can always find a tiling with Bill anywhere. Puzzle Theorem B: For any 2 n x 2 n plaza, there is a tiling with Bill anywhere. Theorem: For any 2 n x 2 n plaza, there is a tiling with Bill in the middle. Clearly Theorem B implies Theorem. A stronger property

Theorem B: For any 2 n x 2 n plaza, there is a tiling with Bill anywhere. Proof: (by induction on n) P(n) ::= can tile 2 n x 2 n with Bill anywhere. Base case: (n=0) (no tiles needed) Puzzle

Induction step: Assume we can get Bill anywhere in 2 n x 2 n. Prove we can get Bill anywhere in 2 n+1 x 2 n+1. Puzzle

Induction step: Assume we can get Bill anywhere in 2 n x 2 n. Prove we can get Bill anywhere in 2 n+1 x 2 n+1.

Method: Now group the squares together, and fill the center with a tile. Done! Puzzle

Some Remarks Note 1: It may help to choose a stronger hypothesis than the desired result (e.g. “Bill in anywhere”). Note 2: The induction proof of “Bill in corner” implicitly defines a recursive procedure for finding corner tilings.

This Lecture The idea of mathematical induction Basic induction proofs (e.g. equality, inequality, property,etc) An interesting example A paradox

Paradox Theorem: All horses have the same color. Proof: (by induction on n) Induction hypothesis: P(n) ::= any set of n horses have the same color Base case (n=0): No horses so obviously true! …

(Inductive case) Assume any n horses have the same color. Prove that any n+1 horses have the same color. Paradox … n+1

… First set of n horses have the same color Second set of n horses have the same color (Inductive case) Assume any n horses have the same color. Prove that any n+1 horses have the same color. Paradox

… Therefore the set of n+1 have the same color! (Inductive case) Assume any n horses have the same color. Prove that any n+1 horses have the same color. Paradox

What is wrong? Proof that P(n) → P(n+1) is false if n = 1, because the two horse groups do not overlap. First set of n=1 horses n =1 Second set of n=1 horses Paradox (But proof works for all n ≠ 1)

Quick Summary You should understand the principle of mathematical induction well, and do basic induction proofs like proving equality proving inequality proving property Mathematical induction has a wide range of applications in computer science. In the next lecture we will see more applications and more techniques.