# Mathematical Induction

Size: px
Start display at page:

Transcription

1 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, and so our first examples with its application are chosen so as to reduce as much as possible the amount of algebraic distractions Consider the following infinite sequence of L-shaped plane regions: L 1 L L 3 etc Note that each successive region in this sequence is obtained from the previous by doubling the width and the height, thereby quadrupling the area In general we denote by L n any plane region of the following shape: } {{ } n n 1 { }} { n n 1 L n Observe that every L n -region can be tiled using L 1 -tiles: L 1 L L 3 etc 1

2 As usual, to tile a region with a given set of tiles means to completely cover the region using the tiles provided, without any overlapping of tiles There is a pattern to the above sequence of tilings: If one knows how to tile L k using L 1 -tiles, then one can also tile L k+1 by first decomposing it into four L k -regions: L k L k L k L k L k+1 : and then tiling each L k -region using the previously determined tiling scheme Thus a tiling of L gives a tiling of L 3, which gives a tiling of L 4, which gives a tiling of L 5, etc This gives our first example of a proof by induction: Theorem 1 For every n 1 it is possible to tile an L n -region using L 1 -tiles Proof The conclusion follows immediately for n = 1 since an L 1 -region can clearly be tiled using a single L 1 -tile Assuming that for some k 1 we know how to tile an L k -region using L 1 -tiles, then we can also tile an L k+1 -region by first decomposing it into four L k - regions as shown above, and then tiling each of these four regions by the known method By induction, it follows that for every n 1, an L n -region can be tiled using L 1 -tiles It was not strictly necessary to switch from n to k above, but we have done so to highlight that these variables play very different roles In the statement of the theorem, n is quantified universally ( for all n ); whereas in the proof, k is quantified existentially ( for some k ) This is a vital distinction! If in the course of the proof we had assumed that L k could be tiled for every k then we would be assuming the very statement we are trying to prove! and we would thus be guilty of circular reasoning It is however legitimate to assume L k can be tiled for some k (at least we know L 1 can be tiled) and to show that as a consequence, L k+1 can also be tiled We are in effect saying that since L 1 can be tiled, so can L ; and since L can be tiled, so can L 3 ; and since L 3 can be tiled, so can L 4 ; etc This is not circular reasoning; it is induction

3 Generalizing the process described above, we are in fact attempting to prove infinitely many statements P 1,P,P 3, (In our example, P n was the statement that an L n -region can be tiled using L 1 -tiles) In order to prove infinitely many statements, it suffices to do two things: (a) Prove P 1 (This is called the initial case) (b) Prove that if P k is true for some k, then P k+1 is also true (This is called the inductive step In this step we assume the inductive hypothesis that P k is true, and show that P k+1 follows as a consequence) The Principle of Mathematical Induction is the fact that if one proves (a) and (b), then as a logical consequence all of the statements P 1,P,P 3, must be true as a logical consequence We compare mathematical induction to knocking down an infinite sequence of dominoes which are arranged to stand on end in such a way that each domino is in position to knock down the next one in the sequence: etc Proving the initial case amounts to knocking down the first domino Proving the inductive step amounts to arranging the dominoes close enough that each domino knocks down the next one Note that the inductive step amounts to proving that for all k, the statement P k implies P k+1 We are using the term implies in the following technical (logical) sense Consider any two statements P and Q, each of which may be either true or false (The truth value of P is either T=TRUE or F=FALSE, and similarly for Q) Then the statement P Q (read as P implies Q ) is the statement that if P is true then so is Q In other words only four possible combinations may arise for the possible truth values of the statements P, Q and P Q, as listed in the rows of the following truth table: P Q P Q T T T T F F F T T F F T For example the statement If n is odd then n+1 is even is universally true for all n In this case we may let P represent the hypothesis that n is odd, and let Q represent the 3

4 conclusion that n+1 is even Sometimes P and Q are both true (eg for n = 3) and sometimes they are both false (eg for n = 10) but in our example the statement P Q is always true In the domino analogy, the statement P Q says that P and Q are dominoes with P standing next to Q, close enough to knock it over It does not say that P has been knocked over, only that if it is knocked over then Q must fall as well Here is an instructive example of an incorrect proof We assert that all horses have the same color In order to state this in a form that is amenable to induction, we restate this as follows: For every set of n 1 horses, all horses in the set have the same color In this case P n is the statement that every set of n horses consists of horses of the same color Clearly P 1 is true since every set consisting of one horse has only horses of a single color To prove the inductive step, suppose that P k is true for some k 1 and consider any set of k+1 horses which we picture as follows: By the inductive hypothesis the leftmost k horses all have the same color, and the rightmost k horses all have the same color Therefore all k+1 horses have the same color as the horses in the middle, and so P k+1 is true More careful reading reveals that the inductive step fails for k = 1 since in this case there are no horses in the middle, ie the leftmost horse and the rightmost horse do not overlap This is the only flaw (but a fatal one) in the proof What is actually true, and in fact follows from our argument, is that the inductive step P k P k+1 holds for all k This should not come as any surprise since if every pair of horses has the same color then of course any n horses have the same color Since the initial case is valid and the inductive step is valid for all k we may liken this situation to the following sequence of dominoes: etc 4

5 in which the chain reaction breaks down due to the big gap between the first and second domino Another example of a proof by induction is given by the Towers of Hanoi puzzle This puzzle consists of three vertical posts (call them A, B and C) and n 1 circular disks of differing diameter, having holes in the middle so that the disks may be stacked on any of the three posts One rule of the game is that no disk may be stacked on top of a disk of smaller diameter A second rule is that only one disk may be moved at one time At the start of the game all disks are stacked on one post (say, post A) The object of the game is to move all the disks to another post (say, post B) Here is a solution in the case n = 3: Start Move the two smallest disks from A to C Move largest disk from A to B Move the two smallest disks from C to B You are encouraged to try this for yourself for n =,3,4,5, disks Several applets have been created for this purpose; one can be found at It is probably not clear that there is a solution for all n; but we proceed to show this Our proof, by induction, is suggested by the headings given above, which indicate a strategy for solving the puzzle 5

6 Theorem For every n 1 there is a sequence of legal moves in the Towers of Hanoi puzzle, that will move the stack of disks from one specified post to another Proof The statement is clearly true for n = 1 since it takes only one move to transfer a single disk from one post to another Suppose that for some k 1 there is a solution to the Towers of Hanoi puzzle with k disks Then given a Towers of Hanoi puzzle with k+1 disks on post A, here is a strategy for moving all the disks to post B: (i) Ignoring the largest disk, move the k smallest disks from A to C By the inductive hypothesis, there is a sequence of legal moves which accomplishes this (ii) Move the largest disk from A to B This is possible in a single move since post B is currently empty (iii) Again ignoring the largest disk, move the k smallest disks from C to B Again by the inductive hypothesis, there is a sequence of legal moves which accomplishes this The result follows by induction The following shows that the Towers of Hanoi puzzle can be solved in n 1 moves It may in fact be shown that this is the smallest number of moves in any solution, although we omit this For example the solution shown above for 3 disks with 7 moves is optimal Theorem 3 For every n 1 the Towers of Hanoi puzzle with n disks can be solved using at most n 1 moves Proof This is clear for n = 1 since it takes only one move to transfer a single disk from one post to another Assume that for some k 1 there exists a solution with k 1 moves In order to solve the Towers of Hanoi puzzle with k+1 disks we use the strategy outlined in the proof of Theorem, which requires (i) k 1 moves, then (ii) 1 move, and finally (iii) k 1 moves, for a total of ( k 1) ( k 1) = k+1 1 moves The result follows by induction Here is another example of a proof by induction, which shows that induction works over n = 0,1,, just as well as over n = 1,,3, 6

7 Theorem 4 For every integer n 0, the integer 7 n n is divisible by 5 Proof The conclusion holds for n = 0 since = 1 1 = 0 = 0 5 is clearly divisible by 5 Assuming 7 k k is divisible by 5 for some k 0, then 7 k+1 k+1 = (7 k k ) + 5 k where both terms on the right side are divisible by 5 (the first term (7 k k ) is divisible by 5 by the inductive hypothesis) and so their sum is divisible by 5, ie 5 7 k+1 k+1 The result follows by induction Here is another example This time we use induction to prove an inequality Although a direct proof is available (one may express the finite sum in closed form since it is just a finite geometric series) we use this instead to provide another example of a proof by induction Theorem 5 For every integer n 0 we have n < Proof For n = 0 there is only one term on the left side and the statement reduces to 1 < which is trivially true Assuming that for some k 0 we have k <, then ( 1 = k ( ) < The result follows by induction = k ) It is interesting to observe that in trying to prove the latter result by induction, one s first attempt is typically to start with the inductive hypothesis k < and then to add 1 k+1 to both sides However this yields only k + 1 k+1 < + 1 k+1 7

8 which is not strong enough! (The right hand side is larger than ) The proof we have given, rather, starts with the inductive hypothesis and then divides both sides by to obtain < 1 k+1 and then adding 1 to both sides gives the desired conclusion The following example is the most popular example in textbook treatments of induction and it is almost obligatory to include it here We have delayed it until now because we find that when learning induction, students have significant trouble distinguishing the algebraic steps involved from the logical steps, and so it less effective as a first example of an inductive proof Again a direct proof (without induction) is not hard to find, but instead we use this as an example of a proof by induction Theorem 6 For every n 1 we have n = n(n+1) Proof The conclusion clearly holds for n = 1 since 1 = 1(1+1) Assuming that for some k we have k = k(k+1) then The result follows by induction k + (k+1) = k(k+1) + (k+1) = (k + 1) ( k + 1) = (k+1)(k+) We trust that the reader has observed that if one replaces n by k+1 in the conclusion of Theorem 6, the resulting statement is in fact which appears in our proof k + (k+1) = (k+1)(k+) As another example of an invalid proof, consider the following attempt to prove the statement of Theorem 6: Since 1 = 1(1+1), the conclusion obviously holds for n = 1 Assuming the conclusion holds for n = k, ie assuming k = k(k+1), 8

9 then replacing k by k+1 in the latter expression yields (k+1) = (k+1)(k+) which is what we were required to prove So the result of the theorem follows by induction The fallacy here is either blatantly obvious, or rather subtle, depending on whether you really understand yet how induction works (Do you?) The person writing this proof has written the inductive hypothesis P k and then simply replaced k by k+1 to give the statement P k+1 which is what we are required to prove; but they have not proved it, only stated it without proof This is the single most common error in a typical student s early attempts to write inductive proofs Another variation on induction, sometimes called complete induction or strong induction, is the following Once again, suppose we want to prove infinitely many statements P 1,P,P 3, To accomplish this, it suffices to do two things: (a) Prove P 1 (This is the initial case) (b) Prove that if all of the statements P 1,P,,P k are true for some k, then P k+1 is also true (This is the inductive step In this step we assume the inductive hypothesis that P n is true for all n k, and show that P k+1 follows as a consequence) Once again it should be clear why this works: We prove P 1 in the initial case Since P 1 is true, P follows by the inductive step Then since both P 1 and P are true, P 3 follows by the inductive step, etc Exploiting the analogy with dominoes yet again, we may compare complete induction to a chain of dominoes lined up so close together that each domino is knocked over not merely by the previous domino, but by the full weight of all preceding dominoes in the chain: etc Not every sequence of true statements can be proved by induction Sometimes this stronger form of induction succeeds where the previous does not An example is the following result which we have been building up to for several classes Theorem 7 (Fundamental Theorem of Arithmetic) Every integer n can be uniquely factored as a product of primes 9

10 Proof Let n If n is prime then the result is clearly true by the definition of prime numbers (This case includes the initial case n = but also covers many of the remaining cases) Assume all integers n {,3,4,,k} have unique factorization into prime factors We must show that k+1 also has unique factorization into prime factors We may assume k = ab where a,b {,3,,k} (since otherwise k is prime and by the preceding remarks we would be done) By the inductive hypothesis a is a product of primes, and so is b; so k = ab is also a product of primes Now suppose k+1 has two possibly different prime factorizations given by k+1 = p 1 p p 3 p r = q 1 q q 3 q s where p 1,p,,p s are primes (not necessarily distinct) and q 1,q,,q s are primes (not necessarily distinct) Again by the preceding remarks we may assume r,s (ie k+1 is not prime) We must show that r = s and that the prime factors p 1,,p r are actually the same as the prime factors q 1,,q s in some order Since p 1 divides n = q 1 q q s, by Euclid s Lemma it follows that p 1 must divide one of q 1,q,,q s We may assume that in fact p 1 divides q 1 ; otherwise simply rearrange the factors q 1,q,,q s in a different order so that the factor q j divisible by p 1 is listed first Of course since p 1 q 1 where both p 1 and q 1 are prime, this forces p 1 = q 1 Canceling this first factor gives p p 3 p r = q q 3 q s This gives two prime factorizations of a number in the range {,3,,k} and so by the inductive hypothesis they must agree: thus r = s and the remaining prime factors p,p 3,,p r agree with q,q 3,,q s in some order Restoring the prime factor p 1 = q 1 shows that both lists of factors p 1,,p r and q 1,q,,q s are the same, only possibly listed in a different order The result follows by induction The reason that ordinary induction fails where complete induction succeeds, is that the factorization of k+1 cannot be obtained from the factorization of k; indeed these two numbers are relatively prime One uses rather the factorization of more general numbers in the range {,3,4,,k} when factoring k+1 Actually one does not require here the factorization of all the numbers,3,4,,k if one simply wants to factor k+1 More generally in proofs by complete induction one typically does not typically make full use of the inductive hypothesis that all the statements P 1,P,,P k are true; nevertheless they are available just in case We should also observe that Euclid s Lemma as we originally stated it, applied only to two factors: if p ab where p is prime, then p a or p b But clearly this implies the more 10

11 general statement for s 1 factors: if p a1 a a s then p ai for some i {1,,,s} To see how this follows from the original statement of Euclid s Lemma, note that p a1 a a 3 a n implies that p a1 or p a a 3 a s which implies that p a1 or p a or p a3 a 4 a s which implies that p a1 or p a or p a3 or or p as HOMEWORK #5 Due Monday, April 9 1 The following proof by induction contains just one mistake After finding the mistake, rewrite the proof in full with the appropriate corrections Theorem Every set with n elements has n subsets Proof If n = 0 then the only set with zero elements is the empty set which has just one subset, namely itself; so the conclusion holds for n = 0 Now let A be a set with k + 1 elements, and we suppose that the result holds for n = k, ie every set with k elements has k subsets Since A is non-empty we can choose a A, and let B = {x A : x a} so that B has k elements By the inductive hypothesis, B has exactly k subsets Moreover every subset B 1 B gives rise to two subsets of A, namely B 1 and B 1 a; and every subset of A is counted exactly once in this way So the number of subsets of A is twice the number of subsets of B, which is k = k+1 By induction, the result holds for all values of n 0 In exercises and 3, use mathematical induction to prove the indicated statements The first exercise is a very simple variation on the proof of Theorem 4 given above Use our proof as a model for what to write, using as few changes as necessary to obtain a valid proof by induction At least in the first exercise, do not concern yourself with being original or inventive! Show that for all integers n 0, the integer 33 k 19 k is divisible by 7 3 Show that for all n 0, there exist polynomials f n (X),g n (X) Z[X] such that the following identities hold for all θ: cos(nθ) = f n (cos θ) and sin(nθ) = g n (cos θ)sin θ 11

12 In exercise, use the identities sin θ + cos θ = 1 where as usual sin θ = (sin θ) and cos θ = (cos θ) ; also Thus for example cos(a + B) = cos Acos B sin Asin B, sin(a + B) = sin Acos B + cos Asin B cos(θ) = cos(θ + θ) = cos θ cos θ sinθ sin θ = cos θ sin θ = cos θ (1 cos θ) = cos θ 1; sin(θ) = sin(θ + θ) = sin θ cos θ + cos θ sinθ = sin θ cos θ; cos(3θ) = cos(θ + θ) = cos(θ)cos θ sin(θ)sin θ = (cos θ 1)cos θ sin θ cos θ = cos 3 θ cos θ (1 cos θ)cos θ = 4cos 3 θ 3cos θ; sin(3θ) = sin(θ + θ) = sin(θ)cos θ + cos(θ)sin θ = sinθ cos θ + (cos θ 1)sin θ = (4cos θ 1)sin θ which gives the first few polynomials f n (X) and g n (X) in our infinite list: n f n (X) g n (X) X 1 X 1 X 3 4X 3 3X 4X 1 1

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

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

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

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

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

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

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

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

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

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

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### SECTION 10-2 Mathematical Induction

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 0.. 6. Approximate e 0.5 using the first five terms

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

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

### Mathematical Induction

Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

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

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

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

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Row Echelon Form and Reduced Row Echelon Form

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with

### Session 6 Number Theory

Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

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

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

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

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### 5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### Regular Languages and Finite Automata

Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a

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

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

### Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### LAMC Beginners Circle: Parity of a Permutation Problems from Handout by Oleg Gleizer Solutions by James Newton

LAMC Beginners Circle: Parity of a Permutation Problems from Handout by Oleg Gleizer Solutions by James Newton 1. Take a two-digit number and write it down three times to form a six-digit number. For example,

### DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition

### arxiv:0909.4913v2 [math.ho] 4 Nov 2009

IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### Homework 2 Solutions

Homework Solutions 1. (a) Find the area of a regular heagon inscribed in a circle of radius 1. Then, find the area of a regular heagon circumscribed about a circle of radius 1. Use these calculations to

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

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

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### G. GRAPHING FUNCTIONS

G. GRAPHING FUNCTIONS To get a quick insight int o how the graph of a function looks, it is very helpful to know how certain simple operations on the graph are related to the way the function epression

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### A Little Set Theory (Never Hurt Anybody)

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### The Chinese Remainder Theorem

The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

### Properties of Real Numbers

16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### The Pointless Machine and Escape of the Clones

MATH 64091 Jenya Soprunova, KSU The Pointless Machine and Escape of the Clones The Pointless Machine that operates on ordered pairs of positive integers (a, b) has three modes: In Mode 1 the machine adds

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

### Kenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract

Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.

### Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### 88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

### Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical

### Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

### 3 Some Integer Functions

3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple

### Solutions to Homework 10

Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.