# WRITING PROOFS. Christopher Heil Georgia Institute of Technology

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 form: Theorem I If statement A is true then statement B is true This just means that whenever statement A is valid, then statement B must be valid as well A proof is an explanation of WHY statement B must be true whenever statement A is true 1 Direct Proofs There are several ways to write a proof of the theorem If statement A is true then statement B is true We ll discuss several of them in these pages It may not be obvious at first which variety of proof to use, but a good rule of thumb is to try a direct proof first A direct proof Start by assuming that statement A is true After all, if statement A is false then there s nothing to worry about; it doesn t matter then whether B is true or false So, suppose that statement A is true write that down as the first step This is information that you can use and build on Now try to proceed logically, one step at a time, building on this information until you have shown that statement B is true An important point is that a proof is always written in English! There are mathematical symbols mixed in with the words, but you must write clear, complete, English sentences, one after another until you ve made your way through to statement B Finally, write an end-of-proof symbol like QED or to show that you ve finished the proof Here is an example of a simple theorem and a simple direct proof Theorem 1 If p is a prime number bigger than, then p is odd Proof Suppose that p is a prime number and p > (That s where we ve assumed that statement A is true Now we build on this until we ve shown that statement B is true) To show that p is odd, we have to show that p is not divisible by Now, because p is a prime number, it is divisible only by 1 and itself Since 1 and p, the number is not one of the numbers that divides p Therefore p is not divisible by, and hence p is an odd number Admittedly, that was a pretty easy theorem and a pretty easy proof, which I ve made excessively long just to give you the idea Most theorems are harder, and you have to sit and think before you get the proof straight DON T BE DISAPPOINTED IF YOU DON T SEE HOW TO DO THE PROOF RIGHT AWAY! Most of the time, it takes THREE sheets of paper to write a proof: c 011 by Christopher Heil 1

3 WRITING PROOFS 3 Here is a final example of a proof by contradiction This theorem was proved by Euclid a LONG time ago Note that the statement of the theorem is slightly different than what we ve discussed: it has the form statement B is true without any dependence on some statement A All the same principles apply, however Theorem 3 (Euclid) There are infinitely many prime numbers Proof Suppose that only finitely many prime numbers existed (Here is where we assume that statement B is false) Let s call these finitely many prime numbers p 1,p,,p N Now consider the number m = p 1 p p N, the product of all of those prime numbers This number m is evenly divisible by each of p 1,p,,p N Therefore, by Theorem, m + 1 is NOT divisible by any of p 1,p,,p N! Thus m + 1 is only evenly divisible by 1 and itself But then m + 1 is a NEW prime number, bigger than any of p 1,p,,p N This is a contradiction, because we said that p 1,p,,p N were ALL the prime numbers that there were in the universe Since we have obtained a contradiction, our assumption that there existed only finitely many prime numbers must be incorrect Hence, there must be infinitely many prime numbers It might surprise you learn that the existence of arbitrarily large prime numbers is of vital importance in cryptography Governments and businesses are paying huge sums of money to encode data using schemes based on huge prime numbers A fast factoring algorithm is the holy grail of much computing research! Question: Look carefully at the proof of Euclid s theorem Does that proof show that if p 1,p,,p N are prime numbers then m = p 1 p p N + 1 is also a prime number? Let s check: + 1 = 3 is prime = 7 is prime = 31 is prime = 11 is prime = 311 is prime = = is NOT prime!! What went wrong? NOTHING! There s nothing wrong with the proof of Euclid s theorem Just be careful about what it says All that the proof says is that IF there were only finitely many prime numbers p 1,p,,p N THEN m = p 1 p p N + 1 would be prime But we showed that there AREN T finitely many prime numbers, so the statement IF there were only finitely many prime numbers p 1,p,,p N THEN m = p 1 p p N +1 would be prime is vacuous, ie, it simply doesn t apply 4 If and Only If Theorems Here is another typical type of theorem: Theorem III Statement A is true if and only if statement B is true This is logically equivalent to two theorems:

4 4 WRITING PROOFS If statement A is true then statement B is true AND If statement B is true then statement A is true Therefore, when you try to write a proof for Theorem III you need to write TWO proofs, one for each direction For example, you could write two direct proofs: start by assuming that statement A is true and then proceed until you ve shown that statement B is true Then, start all over: assume statement B is true and work until you ve shown that statement A is true IF YOU ONLY WRITE ONE OF THESE THEN YOU HAVEN T PROVED THE THEOREM! Here is an example Theorem 4 Let n be a positive integer Then n is even if and only if n is even Proof We have to write TWO PROOFS (In this part, we ll use a direct proof to show that if n is even, then n is even) Suppose that n is even This means that n = k for some integer k Therefore n = 4k Since 4k is divisible by, we conclude that n = 4k is even (In this part, we ll use a contrapositive proof to show that if n is even, then n is even To do this, we must show that if n is not even, then n is not even) Suppose that n is odd That means that n = k + 1 for some integer k Therefore, n = 4k + 4k + 1 But the number 4k + 4k is divisible by, so by Theorem, the number 4k + 4k + 1 cannot be divisible by Hence n = 4k + 4k + 1 is odd Here is another situation where you have to write two proofs If X and Y are sets (collections of objects) and you want to show that X = Y then you must show two things: (1) First show that if x X then x Y This shows that X Y () Next show that if y Y then y X This shows that Y X The combination of the two proofs establishes that every object in X is also in Y and vice versa, and therefore that the two sets are the same 5 Proof by Induction Here is one more proof method It s used when you have a lot of statements, one for each integer, say, statements A n for n = 1,,3,, that you need to prove The theorem looks like this: Theorem IV Statement A n is true for n = 1,,3, The proof is by a method that should be familiar to anyone in computer science: recursion! It s used when you don t see how to prove each statement individually, but you do see how to get from one statement to the next Here is how to write a proof by induction: Step 1 Show that the first statement A 1 is true Step Prove the following: IF statement A n is true then statement A n+1 is true

5 WRITING PROOFS 5 That s all there is: once you ve done those two things you ve written a complete proof Why does this show that, say, A 13 is true? Because of the recursion We have NOT shown directly that A 13 is true What we ve shown is that IF A 1 is true THEN A 13 is true Of course, we don t know that A 1 is true, but we have shown that IF A 11 is true THEN A 1 is true, and so forth, down to IF A 1 is true THEN A is true And we HAVE shown that A 1 is true (that s why you need Step 1), so the recursion works Follow the links back, and you conclude that A 13 is true Here is an example of a proof by induction Theorem For each integer n 1 we have n = n(n+1) Proof Step 1 It s true for n = 1 because 1 = 1(1+1) Step We have to show that IF n = n(n+1) is true for some particular n, then the analogous statement is also true for the number n + 1 So, ASSUME that n = n(n+1) is true for some n, and USE this information to show that the formula is also valid for n + 1 We calculate: n + (n + 1) = n(n + 1) + (n + 1) = n + n + n + = (n + 1)(n + ) We used the formula for n, and what we end up with is the correct formula for n+1 Note that we didn t prove the formula for n + 1 directly! All we did is show that IF it s true for some n THEN it s true for n + 1 And that s enough to make the recursion work

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

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

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

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

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

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

### This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

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

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

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,

### Proofs Crash Course. Winter 2011

Proofs Crash Course Winter 2011 Today s Topics O Why are Proofs so Hard? O Proof by Deduction O Proof by Contrapositive O Proof by Contradiction O Proof by Induction Why are Proofs so Hard? If it is a

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

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

### Steps to Proving a Theorem

Steps to Proving a Theorem Step 1: Understand Goal What am I looking for? What should the last sentence in my proof say? What are some equivalent ways to state what I want? Are there any complicated definitions

### Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

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

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

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

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

### LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

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

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

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

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course

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

### Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

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

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

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

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

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

### 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

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

### Introduction to mathematical arguments

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

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

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

### 1.16 Factors, Multiples, Prime Numbers and Divisibility

1.16 Factors, Multiples, Prime Numbers and Divisibility Factor an integer that goes into another integer exactly without any remainder. Need to be able to find them all for a particular integer it s usually

### Elementary Algebra. Section 0.4 Factors

Section 0.4 Contents: Definitions: Multiplication Primes and Composites Rules of Composite Prime Factorization Answers Focus Exercises THE MULTIPLICATION TABLE x 1 2 3 4 5 6 7 8 9 10 11 12 1 1 2 3 4 5

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

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

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

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

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

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

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

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

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

### Rules and Tips for Writing Mathematics Discrete Math

Rules and Tips for Writing Mathematics Discrete Math Adapted from: Writing in Mathematics by Annalisa Crannell Why Should You Have To Write Papers In A Math Class? For most of your life so far, the only

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

### Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

### LOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras

LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

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

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### 1 Die hard, once and for all

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.

### Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

### Notes on polyhedra and 3-dimensional geometry

Notes on polyhedra and 3-dimensional geometry Judith Roitman / Jeremy Martin April 23, 2013 1 Polyhedra Three-dimensional geometry is a very rich field; this is just a little taste of it. Our main protagonist

### 2. INEQUALITIES AND ABSOLUTE VALUES

2. INEQUALITIES AND ABSOLUTE VALUES 2.1. The Ordering of the Real Numbers In addition to the arithmetic structure of the real numbers there is the order structure. The real numbers can be represented by

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

### Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.

Unit 1 Number Sense In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions. BLM Three Types of Percent Problems (p L-34) is a summary BLM for the material

### 22 Proof Proof questions. This chapter will show you how to:

22 Ch22 537-544.qxd 23/9/05 12:21 Page 537 4 4 3 9 22 537 2 2 a 2 b This chapter will show you how to: tell the difference between 'verify' and 'proof' prove results using simple, step-by-step chains of

### For the purposes of this course, the natural numbers are the positive integers. We denote by N, the set of natural numbers.

Lecture 1: Induction and the Natural numbers Math 1a is a somewhat unusual course. It is a proof-based treatment of Calculus, for all of you who have already demonstrated a strong grounding in Calculus

### Algebra for Digital Communication

EPFL - Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain

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

### 2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In

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

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### Mathematical Induction

Mathematical Induction William Cherry February 2011 These notes provide some additional examples to supplement the section of the text on mathematical induction. Inequalities. It happens that often in

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

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### 3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

### Additional Topics in Linear Algebra Supplementary Material for Math 540. Joseph H. Silverman

Additional Topics in Linear Algebra Supplementary Material for Math 540 Joseph H Silverman E-mail address: jhs@mathbrownedu Mathematics Department, Box 1917 Brown University, Providence, RI 02912 USA Contents

### Course notes on Number Theory

Course notes on Number Theory In Number Theory, we make the decision to work entirely with whole numbers. There are many reasons for this besides just mathematical interest, not the least of which is that

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 1 (out of three) Plan 1. The Principle of Mathematical Induction 2. Induction Examples The Principle of Mathematical Induction Suppose we have

### 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution.

Name : Instructor: Marius Ionescu Instructions: 1. Please write your name in the blank above, and sign & date below. 2. Please use the space provided to write your solution. 3. If you need extra pages

### An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

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

### A brief history of type theory (or, more honestly, implementing mathematical objects as sets)

A brief history of type theory (or, more honestly, implementing mathematical objects as sets) Randall Holmes, Boise State University November 8, 2012 [notes revised later; this is the day the talk was

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

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

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

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

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

### Mathematical induction: variants and subtleties

Mathematical induction: variants and subtleties October 29, 2010 Mathematical induction is one of the most useful techniques for solving problems in mathematics. I m assuming you re familiar with the basic

### Welcome to Analysis 1

Welcome to Analysis 1 Each week you will get one workbook with assignments to complete. Typically you will be able to get most of it done in class and will finish it off by yourselves. In week one there

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

### WHERE DOES THE 10% CONDITION COME FROM?

1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

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

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

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