Strong Mathematical Induction
|
|
- Leo Jacobs
- 5 years ago
- Views:
Transcription
1 Strong Mathematical Induction Lecture 23 Section 5.4 Robb T. Koether Hampden-Sydney College Mon, Feb 24, 2014 Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
2 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
3 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
4 The Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n. Let a be an integer. If it is true that P(a), P(a + 1),..., P(b) are true, and For all integers k b, if P(a), P(a + 1),..., P(k) are true, then P(k + 1) is true, then it follows that P(n) is true for all n a. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
5 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
6 The Method The basic step. Show that P(a), P(a + 1),..., P(b) are true. The inductive step. Show that for all integers k b, if P(a), P(a + 1),..., P(k) are true, then P(k + 1) is true, The conclusion. Conclude that P(n) is true for all n a. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
7 The Method The power of the method is that we are allowed to assume that the statement is true for all integers less than or equal to k, not just k itself. Depending on the nature of the statement, this can be a tremendous advantage. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
8 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
9 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
10 Prime Factorization Theorem Every integer n 2 can be factored into a product of primes. The basis step. Let n = 2. 2 is prime, so the statement is true. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
11 Prime Factorization The inductive step. Suppose that the statement is true for all n k for some integer k 2. That is, suppose that every integer n from 2 through k factors into a product of primes, for some integer k 2. Consider the integer k + 1. Either it factors or it does not factor. If it does not factor, then it is prime and we are done. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
12 Prime Factorization So suppose that it does factor, say n = rs for some integers r and s with 2 r < k + 1 and 2 s < k + 1. Then, by the induction hypothesis, r and s factor into products of primes. Therefore, k + 1 factors into a product of primes. Therefore, all integers n 2 factor into a product of primes. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
13 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
14 The Generalized Checkboard Puzzle Theorem Given a checkboard with an even number of squares, if we remove any two squares of opposite color, the remaining squares can be covered with 1 2 and 2 1 tiles. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
15 A Lemma Lemma For any integers m and n, if the diagonally opposite corners of an m n checkerboard are of opposite colors, then either m is even and n is odd or m is odd and n is even. If m and n are both odd, then each row and column will end with the same color that it started with. If m and n are both even, then each row and column will end with the opposite color that it started with. Either way, diagonally opposite corners would be the same color. Therefore, if diagonally opposite corners are of opposite colors, then one of m and n must be even and the other one odd. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
16 Inductive Proof of the Theorem Let m = 2 and n = 1 and remove two squares of opposite from a 2 1 checkerboard. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
17 Inductive Proof of the Theorem There are no squares left, so they can be covered (vacuously) by 2 1 and 1 2 tiles. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
18 Inductive Proof of the Theorem Let m and n be two integers, at least one of which is even, and suppose that the theorem is true for all smaller checkerboards with an even number of squares Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
19 Inductive Proof of the Theorem Remove any two squares of opposite colors. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
20 Inductive Proof of the Theorem Consider the bounding rectangle of the removed squares. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
21 Inductive Proof of the Theorem It either equals the original checkerboard or it is smaller. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
22 Inductive Proof of the Theorem Case 1: Suppose it is smaller. Then, by the induction hypothesis, it can be tiled. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
23 Inductive Proof of the Theorem We must show that the remainder of the checkerboard can also be tiled. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
24 Inductive Proof of the Theorem We may assume that the original checkerboard has an even number of columns. (Why?) Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
25 Inductive Proof of the Theorem The smaller checkerboard must have one even dimension and one odd dimension. Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
26 Inductive Proof of the Theorem Case 1-A: Suppose that it has an even number of rows and an odd number of columns. Even Odd Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
27 Inductive Proof of the Theorem Then we can tile the checkerboard as shown. Even Odd Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
28 Inductive Proof of the Theorem Case 1-B: Suppose that it has an odd number of rows and an even number of columns. Odd Even Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
29 Inductive Proof of the Theorem Then we can tile the checkerboard as shown. Odd Even Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
30 Inductive Proof of the Theorem Case 2: Suppose the smaller checkerboard equals the original checkerboard. Then the two removed squares must be in diagonally opposite corners. Odd Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
31 Inductive Proof of the Theorem Then we can tile the checkerboard as shown. Odd Even Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
32 Inductive Proof of the Theorem There is a gap in the previous proof. Where is it? Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
33 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
34 Trees Definition (Tree) A graph is a tree with at least one vertex if it is connected and contains no cycles. A Tree Not a Tree Not a Tree Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
35 Trees Theorem If a connected graph with n 1 vertices is a tree, then it has exactly n 1 edges. When n = 1, there is only one vertex. If there were an edge, then it would connect that vertex to itself, creating a cycle. Therefore, there are 0 edges and the statement is true when n = 1. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
36 Trees Suppose that the statement is true for all n k for some k 1. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
37 Trees Let G be a graph with k + 1 vertices Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
38 Trees V Select any vertex V in the graph Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
39 Trees e 1 V e 2 e 4 e 3 Let m be the number of edges incident to V Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
40 Trees e 1 V e 2 e 4 e 3 m must be at least 1. Why? Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
41 Trees Remove V and the incident edges Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
42 Trees There are m separate component graphs G i. Why? Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
43 Trees Each component G i is a tree. Why? Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
44 Trees 9 vertices 8 edges 8 vertices 7 edges 7 vertices 6 edges 5 vertices 4 edges Each component G i has k i vertices and k i 1 edges Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
45 Trees The total number of edges in the components is (k 1 1) + + (k m 1) = (k 1 + k m ) m = k m. Now add back in the 1 vertex and m edges that we removed, and we have k + 1 vertices and k edges. Therefore, the statement is true when n = k + 1. Therefore, the statement is true for all n 1. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
46 Trees It is possible to give induction proof based on standard induction. The basic case is the same as before. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
47 Trees Suppose that the statement is true when n = k for some integer k 1. That is, suppose that any tree with k vertices has exactly k 1 edges. Let G be a tree with k + 1 edges. G must have a vertex of index 1. That is, there must be a vertex that is incident to only 1 edge. Remove that vertex and the incident edge, creating the graph G. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
48 Trees The graph G is a tree (why?) and it has k vertices. So G has exactly k 1 edges. Thus, G has exactly k edges. So the statement is true when n = k + 1. Therefore, it is true for all n 1. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
49 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
50 Binary Strings Theorem Let S be the set of all binary strings with an equal number of 0 s and 1 s. Then every string x S is of the form x = 0s1, where s S, x = 1s0, where s S, or x = st, where s, t S. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
51 Binary Strings Let x S have length n. Clearly, if x begins with 0 and ends with 1, or begins with 1 and ends with 0, then it must be in the form 0s1 or 1s0 for some s S. So, suppose that x begins and ends with 0 or begins and ends with 1. Without loss of generality, assume that x begins and ends with 0. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
52 Binary Strings Let x = x 1 x 2... x n 1 x n, where x 1 = 0 and x n = 0. Let k i be the number of 0 s minus the number of 1 s in the first i digits. Clearly, k 0 = 0, k 1 = 1, k n 1 = 1, k n = 0. For all i, the change from k i to k i+1 is either +1 or 1, depending on whether x i+1 = 0 or x i+1 = 1. Therefore, for some j, with 2 i n 2, we must have k j = 0. Then let s = x 1... x j and t = x j+1... x n. Then s, t S and x = st. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
53 Outline 1 The Principle 2 The Method 3 Examples Prime Factorization The Checkerboard Puzzle Trees Binary Strings 4 Assignment Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
54 Collected Collected Sec. 4.8: 16. Sec. 5.1: 15, 44. Sec. 5.2: 14, 26. Sec. 5.3: 10, 18. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
55 Assignment Assignment Read Section 5.4, pages Exercises 1, 6, 7, 8, 10, 11, 12, 17, page 277. Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, / 34
Direct Proof Division into Cases
Direct Proof Division into Cases Lecture 16 Section 4.4 Robb T. Koether Hampden-Sydney College Mon, Feb 10, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Division into Cases Mon, Feb 10, 2014
More informationDirect Proof Universal Statements
Direct Proof Universal Statements Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Feb 6, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Universal Statements Wed, Feb 6, 2013
More informationDirect Proof Floor and Ceiling
Direct Proof Floor and Ceiling Lecture 17 Section 4.5 Robb T. Koether Hampden-Sydney College Wed, Feb 12, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Floor and Ceiling Wed, Feb 12, 2014
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Lecture 6 Section 2.2 Robb T. Koether Hampden-Sydney College Mon, Sep 5, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Finite Automata Mon, Sep 5, 2016
More informationDirect Proof Divisibility
Direct Proof Divisibility Lecture 15 Section 4.3 Robb T. Koether Hampden-Sydney College Fri, Feb 8, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Divisibility Fri, Feb 8, 2013 1 / 20 1 Divisibility
More informationDirect Proof Divisibility
Direct Proof Divisibility Lecture 15 Section 4.3 Robb T. Koether Hampden-Sydney College Fri, Feb 7, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Divisibility Fri, Feb 7, 2014 1 / 23 1 Divisibility
More informationComposition of Functions
Composition of Functions Lecture 34 Section 7.3 Robb T. Koether Hampden-Sydney College Mon, Mar 25, 2013 Robb T. Koether (Hampden-Sydney College) Composition of Functions Mon, Mar 25, 2013 1 / 29 1 Composition
More informationThe Pairwise-Comparison Method
The Pairwise-Comparison Method Lecture 12 Section 1.5 Robb T. Koether Hampden-Sydney College Mon, Sep 19, 2016 Robb T. Koether (Hampden-Sydney College) The Pairwise-Comparison Method Mon, Sep 19, 2016
More informationMaximums and Minimums
Maximums and Minimums Lecture 25 Section 3.1 Robb T. Koether Hampden-Sydney College Mon, Mar 6, 2017 Robb T. Koether (Hampden-Sydney College) Maximums and Minimums Mon, Mar 6, 2017 1 / 9 Objectives Objectives
More informationInstantaneous Rate of Change
Instantaneous Rate of Change Lecture 13 Section 2.1 Robb T. Koether Hampden-Sydney College Wed, Feb 8, 2017 Robb T. Koether (Hampden-Sydney College) Instantaneous Rate of Change Wed, Feb 8, 2017 1 / 11
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationDirect Proof Rational Numbers
Direct Proof Rational Numbers Lecture 14 Section 4.2 Robb T. Koether Hampden-Sydney College Thu, Feb 7, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Rational Numbers Thu, Feb 7, 2013 1 /
More informationPaired Samples. Lecture 37 Sections 11.1, 11.2, Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2012
Paired Samples Lecture 37 Sections 11.1, 11.2, 11.3 Robb T. Koether Hampden-Sydney College Mon, Apr 2, 2012 Robb T. Koether (Hampden-Sydney College) Paired Samples Mon, Apr 2, 2012 1 / 17 Outline 1 Dependent
More informationConfidence Intervals for Proportions Sections 22.2, 22.3
Confidence Intervals for Proportions Sections 22.2, 22.3 Lecture 41 Robb T. Koether Hampden-Sydney College Mon, Apr 4, 2016 Robb T. Koether (Hampden-Sydney College)Confidence Intervals for ProportionsSections
More informationConditional Statements
Conditional Statements Lecture 3 Section 2.2 Robb T. Koether Hampden-Sydney College Fri, Jan 17, 2014 Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, 2014 1 / 26 1 Conditional
More informationSampling Distribution of a Sample Proportion
Sampling Distribution of a Sample Proportion Lecture 26 Section 8.4 Robb T. Koether Hampden-Sydney College Mon, Mar 1, 2010 Robb T. Koether (Hampden-Sydney College) Sampling Distribution of a Sample Proportion
More informationPredicates and Quantifiers
Predicates and Quantifiers Lecture 9 Section 3.1 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 1 / 32 1
More informationElementary Logic and Proof
Elementary Logic and Proof Lecture 5 Robb T. Koether Hampden-Sydney College Mon, Feb 6, 2017 Robb T. Koether (Hampden-Sydney College) Elementary Logic and Proof Mon, Feb 6, 2017 1 / 33 Outline 1 Statements
More informationThe Cobb-Douglas Production Functions
The Cobb-Douglas Production Functions Lecture 40 Section 7.1 Robb T. Koether Hampden-Sydney College Mon, Apr 10, 2017 Robb T. Koether (Hampden-Sydney College) The Cobb-Douglas Production Functions Mon,
More informationSampling Distribution of a Sample Proportion
Sampling Distribution of a Sample Proportion Lecture 26 Section 8.4 Robb T. Koether Hampden-Sydney College Mon, Oct 10, 2011 Robb T. Koether (Hampden-Sydney College) Sampling Distribution of a Sample Proportion
More informationCompound Interest. Lecture 34 Section 4.1. Robb T. Koether. Hampden-Sydney College. Tue, Mar 28, 2017
Compound Interest Lecture 34 Section 4.1 Robb T. Koether Hampden-Sydney College Tue, Mar 28, 2017 Robb T. Koether (Hampden-Sydney College) Compound Interest Tue, Mar 28, 2017 1 / 8 Reminder Reminder Test
More informationNegations of Quantifiers
Negations of Quantifiers Lecture 10 Section 3.2 Robb T. Koether Hampden-Sydney College Thu, Jan 31, 2013 Robb T. Koether (Hampden-Sydney College) Negations of Quantifiers Thu, Jan 31, 2013 1 / 20 1 Negations
More informationIndependent Samples: Comparing Means
Independent Samples: Comparing Means Lecture 38 Section 11.4 Robb T. Koether Hampden-Sydney College Fri, Nov 4, 2011 Robb T. Koether (Hampden-Sydney College) Independent Samples:Comparing Means Fri, Nov
More informationClosure Properties of Regular Languages
Closure Properties of Regular Languages Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Sep 21, 2016 Robb T. Koether (Hampden-Sydney College) Closure Properties of Regular Languages
More informationBinary Search Trees. Lecture 29 Section Robb T. Koether. Hampden-Sydney College. Fri, Apr 8, 2016
Binary Search Trees Lecture 29 Section 19.2 Robb T. Koether Hampden-Sydney College Fri, Apr 8, 2016 Robb T. Koether (Hampden-Sydney College) Binary Search Trees Fri, Apr 8, 2016 1 / 40 1 Binary Search
More informationThe Interpretation of λ
The Interpretation of λ Lecture 49 Section 7.5 Robb T. Koether Hampden-Sydney College Wed, Apr 26, 2017 Robb T. Koether (Hampden-Sydney College) The Interpretation of λ Wed, Apr 26, 2017 1 / 6 Objectives
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationVector Operations. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 7, 2015
Vector Operations Lecture 19 Robb T. Koether Hampden-Sydney College Wed, Oct 7, 2015 Robb T. Koether (Hampden-Sydney College) Vector Operations Wed, Oct 7, 2015 1 / 23 Outline 1 Magnitude 2 Dot Product
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationMathematical Induction. Rosen Chapter 4.1,4.2 (6 th edition) Rosen Ch. 5.1, 5.2 (7 th edition)
Mathematical Induction Rosen Chapter 4.1,4.2 (6 th edition) Rosen Ch. 5.1, 5.2 (7 th edition) Motivation Suppose we want to prove that for every value of n: 1 + 2 + + n = n(n + 1)/2. Let P(n) be the predicate
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationMathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring 2016 1 Climbing the Ladder We want to show that n 1 P(n) is true. Think of the positive integers as a ladder. 1, 2, 3, 4, 5, 6,...
More informationInduction and recursion. Chapter 5
Induction and recursion Chapter 5 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms Mathematical Induction Section 5.1
More informationCS1800 Discrete Structures Final Version A
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use
More informationZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS
ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More informationInduction and Recursion
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion
More informationVariables. Lecture 12 Sections Tue, Feb 3, Hampden-Sydney College. Displaying Distributions - Qualitative.
Lecture 12 Sections 4.3.1-4.3.2 Hampden-Sydney College Tue, Feb 3, 2008 Outline 1 2 3 4 5 Exercise 4.2, p. 219 Determine whether the following variables are qualitative, quantitative discrete, or quantitative
More informationUSA Mathematical Talent Search Round 2 Solutions Year 27 Academic Year
1/2/27. In the grid to the right, the shortest path through unit squares between the pair of 2 s has length 2. Fill in some of the unit squares in the grid so that (i) exactly half of the squares in each
More informationCSE 311: Foundations of Computing. Lecture 14: Induction
CSE 311: Foundations of Computing Lecture 14: Induction Mathematical Induction Method for proving statements about all natural numbers A new logical inference rule! It only applies over the natural numbers
More informationLecture 45 Sections Wed, Nov 19, 2008
The Lecture 45 Sections 14.5 Hampden-Sydney College Wed, Nov 19, 2008 Outline The 1 2 3 The 4 5 The Exercise 14.20, page 949. A certain job in a car assembly plant involves a great deal of stress. A study
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationLecture 3.2: Induction, and Strong Induction
Lecture 3.2: Induction, and Strong Induction CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag Course Admin Mid-Term 1 Graded; to be returned
More informationUse mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.
Exercises Exercises 1. There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough
More informationMa/CS 6b Class 12: Graphs and Matrices
Ma/CS 6b Class 2: Graphs and Matrices 3 3 v 5 v 4 v By Adam Sheffer Non-simple Graphs In this class we allow graphs to be nonsimple. We allow parallel edges, but not loops. Incidence Matrix Consider a
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationLecture 8 : Structural Induction DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/15/2011 Lecture 8 : Structural Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last week we discussed proofs by induction. We
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationCS 220: Discrete Structures and their Applications. Mathematical Induction in zybooks
CS 220: Discrete Structures and their Applications Mathematical Induction 6.4 6.6 in zybooks Why induction? Prove algorithm correctness (CS320 is full of it) The inductive proof will sometimes point out
More informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More informationCS173 Strong Induction and Functions. Tandy Warnow
CS173 Strong Induction and Functions Tandy Warnow CS 173 Introduction to Strong Induction (also Functions) Tandy Warnow Preview of the class today What are functions? Weak induction Strong induction A
More informationCSC236H Lecture 2. Ilir Dema. September 19, 2018
CSC236H Lecture 2 Ilir Dema September 19, 2018 Simple Induction Useful to prove statements depending on natural numbers Define a predicate P(n) Prove the base case P(b) Prove that for all n b, P(n) P(n
More informationLecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More informationCANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS
CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS (1) For a positive integer n, an n-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second
More informationLecture 41 Sections Mon, Apr 7, 2008
Lecture 41 Sections 14.1-14.3 Hampden-Sydney College Mon, Apr 7, 2008 Outline 1 2 3 4 5 one-proportion test that we just studied allows us to test a hypothesis concerning one proportion, or two categories,
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationSection 4.2: Mathematical Induction 1
Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,
More informationMathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
More informationPart 23. Latin Squares. Contents. 1 Latin Squares. Printed version of the lecture Discrete Mathematics on 4. December 2012
Part 23 Latin Squares Printed version of the lecture Discrete Mathematics on 4. December 2012 Tommy R. Jensen, Department of Mathematics, KNU 23.1 Contents 1 Latin Squares 1 2 Orthogonal Latin Squares
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationCOMP232 - Mathematics for Computer Science
COMP232 - Mathematics for Computer Science Tutorial 9 Ali Moallemi moa ali@encs.concordia.ca Iraj Hedayati h iraj@encs.concordia.ca Concordia University, Winter 2017 Ali Moallemi, Iraj Hedayati COMP232
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationExercises. Template for Proofs by Mathematical Induction
5. Mathematical Induction 329 Template for Proofs by Mathematical Induction. Express the statement that is to be proved in the form for all n b, P (n) forafixed integer b. 2. Write out the words Basis
More informationGCSE EDEXCEL MATHS. Year 10 Revision REVISION BOOKLET. Foundation. Name:
GCSE EDEXCEL MATHS Year 10 Revision REVISION BOOKLET Foundation Name: 1 Contents Page: Number: Types of number 3 Place value 6 Directed numbers 8 Algebra: Coordinates 12 Patterns and sequences 15 Collecting
More informationCSE373: Data Structures and Algorithms Lecture 2: Proof by Induction. Linda Shapiro Spring 2016
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Spring 2016 Background on Induction Type of mathematical proof Typically used to establish a given statement for all natural
More informationarxiv: v1 [math.co] 22 Apr 2014
Groups of otating Squares avi Montenegro David A. Huckaby Elaine White Harmon arxiv:1404.5455v1 [math.co] Apr 014 Abstract This paper discusses the permutations that are generated by rotating k k blocks
More informationEdge colored complete bipartite graphs with trivial automorphism groups
Edge colored complete bipartite graphs with trivial automorphism groups Michael J. Fisher Garth Isaak Abstract We determine the values of s and t for which there is a coloring of the edges of the complete
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationAnnouncements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive
Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19
More informationOutline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction
Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationSolutions to Exercises in Chapter 1
Solutions to Exercises in hapter 1 1.6.1 heck that the formula 1 a c b d works for rectangles but not for 4 parallelograms. b a c a d d b c FIGURE S1.1: Exercise 1.6.1. rectangle and a parallelogram For
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationThe Advantage Testing Foundation Olympiad Solutions
The Advantage Testing Foundation 015 Olympiad Problem 1 Prove that every positive integer has a unique representation in the form d i i, where k is a nonnegative integer and each d i is either 1 or. (This
More informationProblems and Solutions
46 th Canadian Mathematical Olympiad Wednesday, April 2, 204 Problems and Solutions. Let a, a 2,..., a n be positive real numbers whose product is. Show that the sum a a 2 + + a ( + a )( + a 2 ) + a 3
More informationAutomata Theory, Computability and Complexity
Automata Theory, Computability and Complexity Mridul Aanjaneya Stanford University June 26, 22 Mridul Aanjaneya Automata Theory / 64 Course Staff Instructor: Mridul Aanjaneya Office Hours: 2:PM - 4:PM,
More informationMAT 243 Test 2 SOLUTIONS, FORM A
MAT Test SOLUTIONS, FORM A 1. [10 points] Give a recursive definition for the set of all ordered pairs of integers (x, y) such that x < y. Solution: Let S be the set described above. Note that if (x, y)
More informationMathematical Induction
Mathematical Induction Representation of integers Mathematical Induction Reading (Epp s textbook) 5.1 5.3 1 Representations of Integers Let b be a positive integer greater than 1. Then if n is a positive
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 4
CS 70 Discrete Mathematics for CS Spring 008 David Wagner Note 4 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all natural numbers,
More informationQ 1 Find the square root of 729. 6. Squares and Square Roots Q 2 Fill in the blank using the given pattern. 7 2 = 49 67 2 = 4489 667 2 = 444889 6667 2 = Q 3 Without adding find the sum of 1 + 3 + 5 + 7
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationLecture 26 Section 8.4. Mon, Oct 13, 2008
Lecture 26 Section 8.4 Hampden-Sydney College Mon, Oct 13, 2008 Outline 1 2 3 4 Exercise 8.12, page 528. Suppose that 60% of all students at a large university access course information using the Internet.
More information