# SECTION 10-2 Mathematical Induction

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e Approximate e 0.5 using the first five terms of the series. Compare this approximation with your calculator evaluation of e Show that: n k 64. Show that: n k ca k c n a k k (a k b k ) n k a k n b k k SECTION 0- Mathematical Induction Introduction Mathematical Induction Additional Examples of Mathematical Induction Three Famous Problems Introduction In common usage, the word induction means the generalization from particular cases or facts. The ability to formulate general hypotheses from a limited number of facts is a distinguishing characteristic of a creative mathematician. The creative process does not stop here, however. These hypotheses must then be proved or disproved. In mathematics, a special method of proof called mathematical induction ranks among the most important basic tools in a mathematician s toolbox. In this section mathematical induction will be used to prove a variety of mathematical statements, some new and some that up to now we have just assumed to be true. We illustrate the process of formulating hypotheses by an example. Suppose we are interested in the sum of the first n consecutive odd integers, where n is a positive integer. We begin by writing the sums for the first few values of n to see if we can observe a pattern: n 3 4 n n n n 5 Is there any pattern to the sums, 4, 9, 6, and 5? You no doubt observed that each is a perfect square and, in fact, each is the square of the number of terms in the sum. Thus, the following conjecture seems reasonable: Conjecture P n : For each positive integer n, (n ) n That is, the sum of the first n odd integers is n for each positive integer n. So far ordinary induction has been used to generalize the pattern observed in the first few cases listed above. But at this point conjecture P n is simply that a conjecture. How do we prove that P n is a true statement? Continuing to list specific cases will never provide a general proof not in your lifetime or all your descendants lifetimes! Mathematical induction is the tool we will use to establish the validity of conjecture P n.

2 0- Mathematical Induction 733 Before discussing this method of proof, let s consider another conjecture: Conjecture Q n : For each positive integer n, the number n n 4 is a prime number. TABLE n n n 4 Prime? 4 Yes 43 Yes 3 47 Yes 4 53 Yes 5 6 Yes It is important to recognize that a conjecture can be proved false if it fails for only one case. A single case or example for which a conjecture fails is called a counterexample. We check the conjecture for a few particular cases in Table. From the table, it certainly appears that conjecture Q n has a good chance of being true. You may want to check a few more cases. If you persist, you will find that conjecture Q n is true for n up to 4. What happens at n 4? which is not prime. Thus, since n 4 provides a counterexample, conjecture Q n is false. Here we see the danger of generalizing without proof from a few special cases. This example was discovered by Euler ( ). EXPLORE-DISCUSS Prove that the following statement is false by finding a counterexample: If n, then at least one-third of the positive integers less than or equal to n are prime. Mathematical Induction We begin by stating the principle of mathematical induction, which forms the basis for all our work in this section. Theorem Principle of Mathematical Induction Let P n be a statement associated with each positive integer n, and suppose the following conditions are satisfied:. P is true.. For any positive integer k, if is true, then is also true. Then the statement P n is true for all positive integers n. Theorem must be read very carefully. At first glance, it seems to say that if we assume a statement is true, then it is true. But that is not the case at all. If the two conditions in Theorem are satisfied, then we can reason as follows: P is true. Condition P is true, because P is true. Condition P 3 is true, because P is true. Condition P 4 is true, because P 3 is true. Condition..

3 734 0 Sequences and Series Condition : The first domino can be pushed over. (a) Since this chain of implications never ends, we will eventually reach P n for any positive integer n. To help visualize this process, picture a row of dominoes that goes on forever (see Fig. ) and interpret the conditions in Theorem as follows: Condition says that the first domino can be pushed over. Condition says that if the kth domino falls, then so does the (k )st domino. Together, these two conditions imply that all the dominoes must fall. Now, to illustrate the process of proof by mathematical induction, we return to the conjecture P n discussed earlier, which we restate below: P n : (n ) n n any positive integer Condition : If the kth domino falls, then so does the (k )st. (b) We already know that P is a true statement. In fact, we demonstrated that P through P 5 are all true by direct calculation. Thus, condition in Theorem is satisfied. To show that condition is satisfied, we assume that is a true statement: : (k ) k Now we must show that this assumption implies that is also a true statement: : (k ) (k ) (k ) Conclusion: All the dominoes will fall. (c) Since we have assumed that is true, we can perform operations on this equation. Note that the left side of is the left side of plus (k ). So we start by adding (k ) to both sides of : FIGURE Interpreting mathematical induction (k ) k (k ) (k ) k (k ) Factoring the right side of this equation, we have Add k to both sides (k ) (k ) (k ) But this last equation is. Thus, we have started with, the statement we assumed true, and performed valid operations to produce, the statement we want to be true. In other words, we have shown that if is true, then is also true. Since both conditions in Theorem are satisfied, P n is true for all positive integers n. Additional Examples of Mathematical Induction Now we will consider some additional examples of proof by induction. The first is another summation formula. Mathematical induction is the primary tool for proving that formulas of this type are true. EXAMPLE Proving a Summation Formula Prove that for all positive integers n n n n

4 0- Mathematical Induction 735 Proof Part State the conjecture: Show that P is true. P n : n n n P : Thus, P is true. Part Show that if is true, then is true. It is a good practice to always write out both and at the beginning of any induction proof to see what is assumed and what must be proved: : : k k k k k k k We assume is true. We must show that follows from. We start with the true statement, add / k to both sides, and simplify the right side: k k k k k k k k k k k k k k k Thus, k k k k and we have shown that if is true, then is true. Conclusion Both conditions in Theorem are satisfied. Thus, P n is true for all positive integers n.

5 736 0 Sequences and Series Matched Problem Prove that for all positive integers n 3... n n(n ) The next example provides a proof of a law of exponents that previously we had to assume was true. First we redefine a n for n a positive integer, using a recursion formula: DEFINITION Recursive Definition of a n For n a positive integer a a a n a n a n EXAMPLE Proving a Law of Exponents Prove that (xy) n x n y n for all positive integers n. Proof State the conjecture: P n : (xy) n x n y n Part Show that P is true. (xy) xy x y Definition Definition Thus, P is true. Part Show that if is true, then is true. : (xy) k x k y k : (xy) k x k y k Assume is true. Show that follows from. Here we start with the left side of and use to find the right side of : (xy) k (xy) k (xy) x k y k xy (x k x)(y k y) x k y k Definition Use : (xy) k x k y k Property of real numbers Definition

6 0- Mathematical Induction 737 Thus, (xy) k x k y k, and we have shown that if is true, then is true. Conclusion Both conditions in Theorem are satisfied. Thus, P n is true for all positive integers n. Matched Problem Prove that (x/y) n x n /y n for all positive integers n. Our last example deals with factors of integers. Before we start, recall that an integer p is divisible by an integer q if p qr for some integer r. EXAMPLE 3 Proving a Divisibility Property Prove that 4 n is divisible by 5 for all positive integers n. Proof Use the definition of divisibility to state the conjecture as follows: P n : 4 n 5r for some integer r Part Show that P is true. P : Thus, P is true. Part Show that if is true, then is true. : 4 k 5r for some integer r Assume is true. : 4 (k ) 5s for some integer s Show that must follow. As before, we start with the true statement : 4 k 5r 4 (4 k ) 4 (5r) 4 k 6 80r 4 (k ) 80r 5 5(6r 3) Multiply both sides by 4. Simplify. Add 5 to both sides. Factor out 5. Thus, 4 (k ) 5s where s 6r 3 is an integer, and we have shown that if is true, then is true.

7 738 0 Sequences and Series Conclusion Both conditions in Theorem are satisfied. Thus, P n is true for all positive integers n. Matched Problem 3 Prove that 8 n is divisible by 7 for all positive integers n. In some cases, a conjecture may be true only for n m, where m is a positive integer, rather than for all n 0. For example, see Problems 49 and 50 in Exercise 0-. The principle of mathematical induction can be extended to cover cases like this as follows: Theorem Extended Principle of Mathematical Induction Let m be a positive integer, let P n be a statement associated with each integer n m, and suppose the following conditions are satisfied:. P m is true.. For any integer k m, if is true, then is also true. Then the statement P n is true for all integers n m. Three Famous Problems The problem of determining whether a certain statement about the positive integers is true may be extremely difficult. Proofs may require remarkable insight and ingenuity and the development of techniques far more advanced than mathematical induction. Consider, for example, the famous problems of proving the following statements:. Lagrange s Four Square Theorem, 77: Each positive integer can be expressed as the sum of four or fewer squares of positive integers.. Fermat s Last Theorem, 637: For n, x n y n z n does not have solutions in the natural numbers. 3. Goldbach s Conjecture, 74: Every positive even integer greater than is the sum of two prime numbers. The first statement was considered by the early Greeks and finally proved in 77 by Lagrange. Fermat s last theorem, defying the best mathematical minds for over 350 years, finally succumbed to a 00-page proof by Prof. Andrew Wiles of Princeton University in 993. To this date no one has been able to prove or disprove Goldbach s conjecture. EXPLORE-DISCUSS (A) Explain the difference between a theorem and a conjecture. (B) Why is Fermat s last theorem a misnomer? Suggest more accurate names for the result.

8 0- Mathematical Induction 739 Answers to Matched Problems. Sketch of proof. State the conjecture: P n : 3... n ( ) Part.. P is true. Part. Show that if is true, then is true. n(n ) Conclusion: P n is true.. Sketch of proof. State the conjecture: P n : x y x y x 3... k(k ) k 3... k (k ) x y n x n y n Part.. P is true. y Part. Show that if is true, then is true. k(k ) (k ) (k )(k ) x y k x y k x y x k y y k x xk x y k y xk y k Conclusion: P n is true. 3. Sketch of proof. State the conjecture: P n : 8 n 7r for some integer r Part P is true. Part. Show that if is true, then is true. 8 k 7r 8(8 k ) 8(7r) 8 k 56r 7 7(8r ) 7s Conclusion: P n is true. EXERCISE 0- A In Problems 4, find the first positive integer n that causes the statement to fail.. 3 n 4 n 5 n. n 3n n is divisible by n 4. n 5n 6 Verify each statement P n in Problems 5 0 for n,, and P n : (4n ) n 6. P n : n n(n ) 7. P n : a 5 a n a 5 n 8. P n : (a 5 ) n a 5n 9. P n : 9 n is divisible by 4 0. P n : 4 n is divisible by 3 Write and for P n as indicated in Problems 6.. P n in Problem 5. P n in Problem 6 3. P n in Problem 7 4. P n in Problem 8 5. P n in Problem 9 6. P n in Problem 0 In Problems 7, use mathematical induction to prove that each P n holds for all positive integers n. 7. P n in Problem 5 8. P n in Problem 6 9. P n in Problem 7 0. P n in Problem 8. P n in Problem 9. P n in Problem 0

9 740 0 Sequences and Series B In Problems 3 6, prove the statement is false by finding a counterexample. 3. If n, then any polynomial of degree n has at least one real zero. 4. Any positive integer n 7 can be written as the sum of three or fewer squares of positive integers. 5. If n is a positive integer, then there is at least one prime number p such that n p n If a, b, c, d are positive integers such that a b c d, then a c or a d. In Problems 7 4, use mathematical induction to prove each proposition for all positive integers n, unless restricted otherwise n n n n (n ) 3 (4n 3 n) (n ) (n ) ; n n n(n )(n ) n(n ) n(n )(n ) 3 a n a a n 3 ; n ; n 5 a a 3 n a n a m a n a m n ; m, n N [Hint: Choose m as an arbitrary element of N, and then use induction on n.] 36. (a n ) m a mn ; m, n N 37. x n is divisible by x ; x [Hint: Divisible means that x n (x )Q(x) for some polynomial Q(x).] 38. x n y n is divisible by x y; x y 39. x n is divisible by x ; x 40. x n is divisible by x ; x n 3 ( 3... n) [Hint: See Matched Problem following Example.] 4. C In Problems 43 46, suggest a formula for each expression, and prove your hypothesis using mathematical induction, n N n n(n ) 45. The number of lines determined by n points in a plane, no three of which are collinear 46. The number of diagonals in a polygon with n sides In Problems 47 50, prove the statement is true for all integers n as specified. 47. a a n ; n N a 0 a n ; n N 49. n n; n n n ; n 5 5. Prove or disprove the generalization of the following two facts: Prove or disprove: n n is a prime number for all natural numbers n. If {a n } and {b n } are two sequences, we write {a n } {b n } if and only if a n b n, n N. In Problems 53 56, use mathematical induction to show that {a n } {b n }. 53. a, a n a n ; b n n 54. a, a n a n ; b n n 55. a, a n a n ; b n n 56. a, a n 3a n ; b n 3 n n(n )(n ) n(n 3) 4(n )(n ) SECTION 0-3 Arithmetic and Geometric Sequences Arithmetic and Geometric Sequences nth-term Formulas Sum Formulas for Finite Arithmetic Series Sum Formulas for Finite Geometric Series Sum Formula for Infinite Geometric Series

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

### Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

### PRINCIPLE OF MATHEMATICAL INDUCTION

Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosophy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem

### Mathematical Induction

Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

### 1.2. Successive Differences

1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers

### Mathematical Induction

Chapter 4 Mathematical Induction 4.1 The Principle of Mathematical Induction Preview Activity 1 (Exploring Statements of the Form.8n N/.P.n//) One of the most fundamental sets in mathematics is the set

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Worksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation

Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

### In a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.

PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Running head: A GEOMETRIC INTRODUCTION 1

Running head: A GEOMETRIC INTRODUCTION A Geometric Introduction to Mathematical Induction Problems using the Sums of Consecutive Natural Numbers, the Sums of Squares, and the Sums of Cubes of Natural Numbers

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 3

CS 70 Discrete Mathematics and Probability Theory Fall 06 Seshia and Walrand Note 3 Mathematical Induction Introduction. In this note, we introduce the proof technique of mathematical induction. Induction

### SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 5.2 Mathematical Induction I Copyright Cengage Learning. All rights reserved.

### Mathematics for Computer Science

mcs 01/1/19 1:3 page i #1 Mathematics for Computer Science revised Thursday 19 th January, 01, 1:3 Eric Lehman Google Inc. F Thomson Leighton Department of Mathematics and the Computer Science and AI Laboratory,

### Exam #5 Sequences and Series

College of the Redwoods Mathematics Department Math 30 College Algebra Exam #5 Sequences and Series David Arnold Don Hickethier Copyright c 000 Don-Hickethier@Eureka.redwoods.cc.ca.us Last Revision Date:

### An introduction to number theory and Diophantine equations

An introduction to number theory and Diophantine equations Lillian Pierce April 20, 2010 Lattice points and circles What is the area of a circle of radius r? You may have just thought without hesitation

### Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Felix Lazebnik This collection of problems is for those who wish to learn about arithmetic and geometric sequences, or to those who wish to improve their understanding

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### Mathematical Induction

Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10

### Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction

Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### The Equation x 2 + y 2 = z 2

The Equation x 2 + y 2 = z 2 The equation x 2 + y 2 = z 2 is associated with the Pythagorean theorem: In a right triangle the sum of the squares on the sides is equal to the square on the hypotenuse. We

### Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

### 2.4 Mathematical Induction

2.4 Mathematical Induction What Is (Weak) Induction? The Principle of Mathematical Induction works like this: What Is (Weak) Induction? The Principle of Mathematical Induction works like this: We want

### Mathematical Induction

MCS-236: Graph Theory Handout #A5 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 2010 Mathematical Induction The following three principles governing N are equivalent. Ordinary Induction Principle.

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

### 3.3 MATHEMATICAL INDUCTION

Section 3.3 Mathematical Induction 3.3.1 3.3 MATHEMATICAL INDUCTION From modus ponens: p p q q basis assertion conditional assertion conclusion we can easily derive double modus ponens : p 0 p 0 p 1 p

### Congruences. Robert Friedman

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

### MATHEMATICAL INDUCTION

MATHEMATICAL INDUCTION MATH 5A SECTION HANDOUT BY GERARDO CON DIAZ Imagine a bunch of dominoes on a table. They are set up in a straight line, and you are about to push the first piece to set off the chain

### Recurrence Relations. Niloufar Shafiei

Recurrence Relations Niloufar Shafiei Review A recursive definition of a sequence specifies one or more initial terms a rule for determining subsequent terms from those that precede them. Example: a 0

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

### Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

### Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction

### Indiana State Core Curriculum Standards updated 2009 Algebra I

Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS

1 CHAPTER 6. MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 Introduction Recurrence

### CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 5 Proofs: Mathematical Induction 1 Outline What is a Mathematical Induction? Strong Induction Common Mistakes 2 Introduction What is the formula of the sum of the first

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### COMP 250 Fall Mathematical induction Sept. 26, (n 1) + n = n + (n 1)

COMP 50 Fall 016 9 - Mathematical induction Sept 6, 016 You will see many examples in this course and upcoming courses of algorithms for solving various problems It many cases, it will be obvious that

### PRINCIPLE 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

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### San Jose Math Circle October 17, 2009 ARITHMETIC AND GEOMETRIC PROGRESSIONS

San Jose Math Circle October 17, 2009 ARITHMETIC AND GEOMETRIC PROGRESSIONS DEFINITION. An arithmetic progression is a (finite or infinite) sequence of numbers with the property that the difference between

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### CS 173: Discrete Structures, Fall 2010 Homework 6 Solutions

CS 173: Discrete Structures, Fall 010 Homework 6 Solutions This homework was worth a total of 5 points. 1. Recursive definition [13 points] Give a simple closed-form definition for each of the following

### Sequences and Mathematical Induction. CSE 215, Foundations of Computer Science Stony Brook University

Sequences and Mathematical Induction CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Sequences A sequence is a function whose domain is all the integers

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### Stanford University Educational Program for Gifted Youth (EPGY) Number Theory. Dana Paquin, Ph.D.

Stanford University Educational Program for Gifted Youth (EPGY) Dana Paquin, Ph.D. paquin@math.stanford.edu Summer 2010 Note: These lecture notes are adapted from the following sources: 1. Ivan Niven,

### Discrete Mathematics

Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical

### 8.3. GEOMETRIC SEQUENCES AND SERIES

8.3. GEOMETRIC SEQUENCES AND SERIES What You Should Learn Recognize, write, and find the nth terms of geometric sequences. Find the sum of a finite geometric sequence. Find the sum of an infinite geometric

### 4. MATHEMATICAL PROBLEM SOLVING

4. MATHEMATICAL PROBLEM SOLVING Historically, algebra grew out of arithmetic, and it ought so to grow afresh for each individual. Mathematical Association, 1934, 5 Over the centuries mathematicians, both

### Geometry Unit 1. Basics of Geometry

Geometry Unit 1 Basics of Geometry Using inductive reasoning - Looking for patterns and making conjectures is part of a process called inductive reasoning Conjecture- an unproven statement that is based

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### New Zealand Mathematical Olympiad Committee. Induction

New Zealand Mathematical Olympiad Committee Induction Chris Tuffley 1 Proof by dominoes Mathematical induction is a useful tool for proving statements like P is true for all natural numbers n, for example

### Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES

### Chapter Two. Number Theory

Chapter Two Number Theory 2.1 INTRODUCTION Number theory is that area of mathematics dealing with the properties of the integers under the ordinary operations of addition, subtraction, multiplication and

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

### CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction. Linda Shapiro Winter 2015

CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Winter 2015 Background on Induction Type of mathematical proof Typically used to establish a given statement for all natural

### 1. What s wrong with the following proofs by induction?

ArsDigita University Month : Discrete Mathematics - Professor Shai Simonson Problem Set 4 Induction and Recurrence Equations Thanks to Jeffrey Radcliffe and Joe Rizzo for many of the solutions. Pasted

### 2.1. Inductive Reasoning EXAMPLE A

CONDENSED LESSON 2.1 Inductive Reasoning In this lesson you will Learn how inductive reasoning is used in science and mathematics Use inductive reasoning to make conjectures about sequences of numbers

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)

### Proof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract

Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### Review Name Rule of Inference

CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of