# Basic Proof Techniques

Size: px
Start display at page:

Transcription

1 Basic Proof Techniques David Ferry September 13, Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document models those four different approaches by proving the same proposition four times over using each fundamental method. The central question which we address in this paper is the truth or falsity of the following statement: The sum of any two consecutive numbers is odd. If you were put on the spot you could certainly convince most reasonable people that our question is undoubtedly true. However, we are not interested in convincing the passing layperson. We seek to demonstrate beyond any doubt that our proposition is true using only the most formal, bulletproof methods available. The following three definitions are central to the execution of our proofs: Definition 1. An integer number n is even if and only if there exists a number k such that n = k. Definition. An integer number n is odd if and only if there exists a number k such that n = k + 1. Definition 3. Two integers a and b are consecutive if and only if b = a Direct Proof (Proof by Construction) In a constructive proof one attempts to demonstrate P Q directly. This is the simplest and easiest method of proof available to us. There are only two steps to a direct proof (the second step is, of course, the tricky part): 1. Assume that P is true.. Use P to show that Q must be true. Theorem 1. If a and b are consecutive integers, then the sum a + b is odd. Proof. Assume that a and b are consecutive integers. Because a and b are consecutive we know that b = a + 1. Thus, the sum a + b may be re-written as a + 1. Thus, there exists a number k such that a + b = k + 1 so the sum a + b is odd. 1

2 1. Proof by Contradiction The proof by contradiction is grounded in the fact that any proposition must be either true or false, but not both true and false at the same time. We arrive at a contradiction when we are able to demonstrate that a statement is both simultaneously true and false, showing that our assumptions are inconsistent. We can use this to demonstrate P Q by assuming both P and Q are simultaneously true and deriving a contradiction. When we derive this contradiction it means that one of our assumptions was untenable. Presumably we have either assumed or already proved P to be true so that finding a contradiction implies that Q must be false. The method of proof by contradiction. 1. Assume that P is true.. Assume that Q is true. 3. Use P and Q to demonstrate a contradiction. Theorem. If a and b are consecutive integers, then the sum a + b is odd. Proof. Assume that a and b are consecutive integers. Assume also that the sum a + b is not odd. Because the sum a + b is not odd, there exists no number k such that a + b = k + 1. However, the integers a and b are consecutive, so we may write the sum a + b as a + 1. Thus, we have derived that a + b k + 1 for any integer k and also that a + b = a + 1. This is a contradiction. If we hold that a and b are consecutive then we know that the sum a + b must be odd. 1.3 Proof by Induction Proof by induction is a very powerful method in which we use recursion to demonstrate an infinite number of facts in a finite amount of space. The most basic form of mathematical induction is where we first create a propositional form whose truth is determined by an integer function. If we are able to show that the propositional form is true for some integer value then we may argue from that basis that the propositional form must be true for all integers. 1. Show that a propositional form P (x) is true for some basis case.. Assume that P (n) is true for some n, and show that this implies that P (n + 1) is true. 3. Then, by the principle of induction, the propositional form P (x) is true for all n greater or equal to the basis case. Theorem 3. If a and b are consecutive integers, then the sum a + b is odd. Proof. Define the propositional form F (x) to be true when the sum of x and its successor is odd. (Step 1) Consider the proposition F (1). The sum 1 + = 3 is odd because we can demonstrate there exists an integer k such that k + 1 = 3. Namely, (1) + 1 = 3. Thus, F (x) is true when x = 1.

3 (Step ) Assume that F (x) is true for some x. Thus, for some x we have that x + (x + 1) is odd. We add one to both x and x + 1 which gives the sum (x+1)+(x+). We claim two things: first, the sum (x+1)+(x+) = F (x+1). Second, we claim that adding two to any integer does not change that integer s evenness or oddness. With these two observations we claim that F (x) is odd implies F (x + 1) is odd. (Step 3) By the principle of mathematical induction we thus claim that F (x) is odd for all integers x. Thus, the sum of any two consecutive numbers is odd. 1.4 Proof by Contrapositive Proof by contraposition is a method of proof which is not a method all its own per se. From first-order logic we know that the implication P Q is equivalent to Q P. The second proposition is called the contrapositive of the first proposition. By saying that the two propositions are equivalent we mean that if one can prove P Q then they have also proved Q P, and vice versa. Proof by contraposition can be an effective approach when a traditional direct proof is tricky, or it can be a different way to think about the substance of a problem. Theorem 4. If the sum a + b is not odd, then a and b are not consecutive integers. It is important to be extremely pedantic when interpreting a contraposition. It would be tempting to claim that the above theorem claims that the sum of two numbers is odd only when those two numbers are consecutive. However, this is nonsense. Proof. Assume that the sum of the integers a and b is not odd. Then, there exists no integer k such that a + b = k + 1. Thus, a + b k + (k + 1) for all integers k. Because k + 1 is the successor of k, this implies that a and b cannot be consecutive integers. Examples.1 Direct Proof There are two steps to directly proving P Q: 1. Assume P is true.. Demonstrate that Q must follow from P. Definition 4. Let MAX(a, b) be a function which returns whichever of a or b is greater. Definition 5. Let ABS(a) be defined to be such that if a is postiive then ABS(a) = a, and if a is negative then ABS(a) = a. The following proofs demonstrate that sometimes it s easiest to break a proposition into separate cases and prove each case separately. 3

4 Theorem 5. Let a,b,c,d be integers. If a > c and b > c, then MAX(a, b) c is always positive. Proof. Assume that a > c and b > c. We know that a > c and b > c, but we cannot say for certain if a > b or b > a. Therefore we proceed by cases. 1. Case 1: Assume that a > b. Because a > b we know that MAX(a, b) = a. We may thus claim that MAX(a, b) c = a c. By assumption we know that a > c so the difference a c must be positive.. Case : Assume that b > a. Because b > a we know that MAX(a, b) = b. We may thus claim that MAX(a, b) c = b c. By assumption we know that b > c so the difference b c must be positive. Thus, in all possible cases MAX(a, b) c is positive. Theorem 6. If a and b are integers, then ABS(a)ABS(b) = ABS(ab). Proof. Assume that a and b are integers. We proceed by cases: 1. Case 1: Suppose a is negative and b is positive. By definition ABS(a) = a and ABS(b) = b. Thus, ABS(a)ABS(b) = ab. Likewise, the product ab is negative so ABS(ab) = ab. Thus, ABS(a)ABS(b) = ABS(ab).. Case : Suppose that a is positive and b is negative. By definition ABS(a) = a and ABS(b) = b. Thus, ABS(a)ABS(b) = a( b) = ab. Likewise, the product ab is negative so ABS(ab) = ab. Thus, ABS(a)ABS(b) = ABS(ab). 3. Case 3: Suppose that both a and b are positive. By definition ABS(a) = a and ABS(b) = b. Thus, ABS(a)ABS(b) = ab. Likewise, the product ab is positive so ABS(ab) = ab. Thus, ABS(a)ABS(b) = ABS(ab). 4. Case 4: Suppose that both a and b are negative. By definition ABS(a) = a and ABS(b) = b. Thus, ABS(a)ABS(b) = ( a)( b) = ab. Likewise, the product ab is then positive so ABS(ab) = ab. Thus, ABS(a)ABS(b) = ABS(ab). Therefore, in every possible case we have that ABS(a)ABS(b) = ABS(ab).. Proof by Contradiction Steps to proving a theorem by contradiction: 1. Assume P is true.. Assume Q is true. 3. Demonstrate a contradiction. 4

5 The statement of the following proof is different from those we have seen so far in that there is no explicitly stated starting assumption. In these cases we are free to assume we have at our disposal the general machinery of the subject which we are studying. In this case, we implicitly assume all of number and set theory to tackle the problem. Theorem 7. Prove that there are an infinite number of primes. Proof. Assume, by way of contradiction, that there are a finite number of primes p 1, p, p 3...p n. Let k be the product of all these primes plus one: k = p 1 p p 3...p n + 1. The integer k is clearly greater than one and because k is an integer, there must exist some prime number P which divides it. However, P cannot be any one of p 1, p, p 3...p n because if it were then P could divide the difference k p 1 p p 3...p n and k p 1 p p 3...p n = 1. P cannot divide one and also be prime (which is by definition greater than one). This is a contradiction. Therefore our assumption is false so there must be an infinite number of primes..3 Proof by Mathematical Induction To demonstrate P Q by induction we require that the truth of P and Q be expressed as a function of some ordered set S. 1. (Basis) Show that P Q is valid for a specific element k in S.. (Inductive Hypothesis) Assume that P Q for some element n in S. 3. Demonstrate that P Q for the element n + 1 in S. 4. Conclude that P Q for all elements greater than or equal to k in S. Theorem 8. Show that the summation formula n i = n(n + 1) (1) is valid for all integers n. Proof. (Basis case) We demonstrate that the formula is valid for n = 1. By substituting one for n the formula gives us 1 = 1(), which is true. (Inductive Hypothesis) Suppose that the formula is valid for some integer n. To demonstrate that the formula is valid for n + 1 we must use the inductive hypothesis to show that the formula still holds. By assumption the formula is valid for n. Using basic algebra we add n + 1 to both sides of the equation to demonstrate that the formula is still valid for n + 1. We begin with the left hand side: n n+1 i + (n + 1) = i () We now demonstrate adding n + 1 to the right hand side. fraction addition and factor out an (n + 1). We perform 5

6 n(n + 1) n(n + 1) + (n + 1) (n + 1)(n + ) + (n + 1) = = Combining the right hand sides of equations two and three yields: (3) n+1 i = (n + 1)(n + ) Which is exactly what we require. Thus, if the formula is valid for n then the formula must be valid for n + 1 as we have shown above. Thus, by mathematical induction over the integers, the summation formula is valid for all integers greater than or equal to one. (4).4 Proof by Contrapositive Recall that first-order logic shows that the statement P Q is equivalent to Q P. 1. Assume Q is true.. Show that P must be true. 3. Observe that P Q by contraposition. Logically, a direct proof, a proof by contradiction, and a proof by contrapositive are all equivalent. It is also true that if in general you can find a proof by contradiction then you can also find a proof by contrapositive. After you have proved a proposition by contradiction you might surprise yourself by converting the contradiction proof to a contrapositive proof. The reason is that in both cases we assume that Q is true and argue from that point. In fact, oftentimes a proof by contradiction assumes Q and argues towards P! Theorem 9. If x is odd then x must be odd. The above proof is certainly doable both by a direct proof or by a contradiction. However, a direct proof requires a cumbersome proof by cases approach and a contradiction is essentially arguing towards a proof by contrapositive. Remember to always state the contrapositive so your reader knows what you re arguing towards. Here I have taken a (justified) liberty with stating the contrapositive. Normally we would have to first prove that a not odd number must be even, but here I just claim this fact without proof. Theorem 10. If x is even then x is even. Proof. We assume that x is even. By definition, there exists an integer k such that x = k. To derive the desired result we square both sides which yields x = 4k = (k ). Thus, x is even. Therefore, by proof of the contrapositive, if x is odd then x must be odd. 6

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

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

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

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

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

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

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

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

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

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

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

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

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

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

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

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

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

### Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

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

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

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

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

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

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

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

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

### DigitalCommons@University of Nebraska - Lincoln

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

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

### COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

### 2.6 Exponents and Order of Operations

2.6 Exponents and Order of Operations We begin this section with exponents applied to negative numbers. The idea of applying an exponent to a negative number is identical to that of a positive number (repeated

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

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

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

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

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

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

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

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

### If n is odd, then 3n + 7 is even.

Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that

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

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

### 3. Logical Reasoning in Mathematics

3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.

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

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

### Fibonacci Numbers and Greatest Common Divisors. The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,...

Fibonacci Numbers and Greatest Common Divisors The Finonacci numbers are the numbers in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,.... After starting with two 1s, we get each Fibonacci number

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

### 5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

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

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

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

### Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

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

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

### Solving Rational Equations

Lesson M Lesson : Student Outcomes Students solve rational equations, monitoring for the creation of extraneous solutions. Lesson Notes In the preceding lessons, students learned to add, subtract, multiply,

### Solution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.

[Chap. ] Pythagorean Triples 6 (b) The table suggests that in every primitive Pythagorean triple, exactly one of a, b,orc is a multiple of 5. To verify this, we use the Pythagorean Triples Theorem to write

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

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

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

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

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

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

### NUMBER SYSTEMS. William Stallings

NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html

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

### Click on the links below to jump directly to the relevant section

Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is

### 2 When is a 2-Digit Number the Sum of the Squares of its Digits?

When Does a Number Equal the Sum of the Squares or Cubes of its Digits? An Exposition and a Call for a More elegant Proof 1 Introduction We will look at theorems of the following form: by William Gasarch

### Chapter 9. Systems of Linear Equations

Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables

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

### 6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

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

### 4.2 Euclid s Classification of Pythagorean Triples

178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

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

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Playing with Numbers

PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also

Exponents and Radicals (a + b) 10 Exponents are a very important part of algebra. An exponent is just a convenient way of writing repeated multiplications of the same number. Radicals involve the use of

### Representation of functions as power series

Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions

### On numbers which are the sum of two squares

On numbers which are the sum of two squares Leonhard Euler 1. Arithmeticians are accustomed to investigating the nature of numbers in many ways where they show their source, either by addition or by multiplication.

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

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

### CHAPTER 2: METHODS OF PROOF

CHAPTER 2: METHODS OF PROOF Section 2.1: BASIC PROOFS WITH QUANTIFIERS Existence Proofs Our first goal is to prove a statement of the form ( x) P (x). There are two types of existence proofs: Constructive

### Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion

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

### 6.4 Normal Distribution

Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under

### 0.8 Rational Expressions and Equations

96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:

Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of

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

### 1.7 Graphs of Functions

64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most

### We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

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

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

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

### Normal distribution. ) 2 /2σ. 2π σ

Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a

### MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

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