1.2 The Well-Ordering Principle
|
|
- Penelope Barton
- 6 years ago
- Views:
Transcription
1 36 Chapter 1. The Integers Exercises Prove the following theorem: Theorem. Let m and a be integers. If m a and a m, thenm = ±a. 2. Prove the following theorem: Theorem. For all integers a, b and k, witha 6= 0 and k 6= 0, we have that a b if and only if ak bk. 1.2 The Well-Ordering Principle An important property of the set of natural numbers N is that any nonempty 2 subset of N has a least element. This property follows from a principle that is often applied in mathematical proofs. Well-Ordering Principle. Let S be a non-empty set of integers all of which are larger than some fixed integer. Then S has a least element. Proof Strategy (Well-ordering proof strategy). Let b be a fixed integer and let n be an integer variable. Given a diagram of the form use the diagram Prove (8n b) P (n) To prove (8n b) P (n): Assume that P (n) holds for some integer n b. Let N b be the least such integer satisfying P (N). Derive a contradiction. Definition A natural number p>1 is a prime number if and only if for all natural numbers a and b, ifp = ab then either a = 1 or b = 1. When a natural number n>1 is not a prime, then we shall say that n is a composite number. Definition A natural number n is called a composite number if and only if there are natural numbers a and b such that n = ab where a 6= 1 and b 6= 1. Euclid used proof strategy to prove the following lemma. 3 Lemma Every natural number n>1 is divisible by a prime number. Proof. Suppose, for a contradiction, that there is a natural number n>1 that is not divisible by a prime. By the well-ordering principle, there is a least natural number N>1 that is not divisible by a prime. Thus we have that (i) N is not divisible by a prime, (ii) for any natural number k, if1<k<n then k is divisible by a prime. 2 Asetisnonemptyifithasatleastoneelementinit. 3 In mathematics, a lemma is a little theorem that is usually used in the proof of a more important theorem.
2 1.3 Proof by Mathematical Induction 37 We now consider two cases: either N is a prime or it is not a prime. Case 1: N is a prime. Since N is divisible by itself, this contradicts (i). Case 2: N is not a prime. Thus N is a composite number. So, N = ab for some natural numbers a and b with 1 <a<n and 1 <b<n.since1<a<n, assertion (ii) implies that p a for some prime p. Because a N, Theorem 1.1.2(c) implies that p N. Hence, N is divisible by a prime. This contradicts (i) and completes the proof. Exercises Prove the statement: For all natural numbers n 1, we can write n =2 k m for some integers k and m where k 0 and m is odd. 2. Prove that for every natural number n 0, either n is even or n is odd. 3. Let P (n) be a statement where n stands for a natural number. Suppose that the following two conditions hold: (a) P (1) is true, and (b) for all n 1, if P (n) holds then P (n + 1) also holds. Use the well-ordering principle to prove that P (n) must be true for all natural numbers n 1. Exercise Notes: For Exercise 1, use the well-ordering proof strategy where P (n) is the statement n =2 k m for some integers k and m where k 0 and m is odd. There are two cases to consider about N. Case 1: N is even; and Case 2: N is odd. If N is even, then N =2i for some natural number i where 1 apple i<n. If N is odd, then N =2 0 N. For Exercise 2, use the proof strategy Show that N>0. Note that either N 1 is even or N 1 is odd. For Exercise 3, if N is the least natural number satisfying P (N), then explain why N = n + 1 for some n 1 and observe that n<n. 1.3 Proof by Mathematical Induction Mathematical induction is a powerful method for proving theorems about the natural numbers. Suppose you have a statement P (n) that you want to prove is true for every integer n greater than or equal to the integer b. How can you prove this statement by mathematical induction? First you prove that the statement definitely holds for b. Then you have to prove that whenever the statement holds for an integer n b, then it must hold for the next integer n + 1 as well. In other words, mathematical induction is a method of proof that works by first proving the statement is true for a starting value b, which is called the base step. Then one must prove the inductive step, which shows that the truth of the statement P (n) implies the truth of the statement P (n + 1). If the base step and the inductive step are both proven, then the statement P (n) is true for all the natural numbers n b. Base step: Inductive step: b b+1 b+2 n n+1 Figure 1.1: The base step and inductive step force the dominoes to fall, one and all.
3 38 Chapter 1. The Integers It may be helpful to think of the domino e ect where one is presented with an infinite row of dominoes, each standing on end, as pictured in Figure 1.1. The base step shows that the first domino will fall. The inductive step ensures that each domino is perfectly aligned with the one ahead of it. Thus, we know that the first domino will fall (base step) and whenever the n-th domino falls, the n + 1 domino will also fall (inductive step). Therefore, all of the dominoes must fall. Now for the mathematical details The well-ordering principle implies the following related principle (see Exercise 3 on page 37). Principle of Mathematical Induction. Let P (n) be a statement about an integer variable n. Let b be a given integer. Suppose that the following two statements hold: 1. P (b) istrue. 2. For all n b, ifp (n) thenp (n + 1). Then for all integers n b, P (n) istrue. There are many mathematical statements having the form: For every integer n b, something about n happens, where b is some fixed integer. The Principle of Mathematical Induction motivates the following essential proof strategy called proof by mathematical induction. Proof Strategy Let b be a fixed integer. To prove a statement of the form (8n by mathematical induction, use the diagram In other words, use the diagram Prove P (b). Prove (8n b)[p (n)! P (n + 1)]. Base step: Prove P (b). Inductive step: Let n b be arbitrary. Assume P (n). Prove P (n + 1). b) P (n) In a proof of a statement (8n b) P (n) by mathematical induction, b is referred to as the base value. The proof of P (b) is called the base step and the proof of (8n b)[p (n)! P (n + 1)] is called the inductive step. In the latter proof diagram of proof strategy 1.3.1, the assumption P (n) is called the induction hypothesis (IH) and the statement to be proven, P (n + 1), is called the induction conclusion (IC). In the base step you must show that the statement P (b) is true. To do so, simply replace n by b everywhere in P (n) and verify that P (b) holds. The inductive step is more challenging. It requires you to reach the conclusion that P (n + 1) is true after assuming P (n) is true. To prove that P (n+1) is true, you should somehow try to rewrite the statement P (n + 1) in terms that relate to the assumption P (n) (as will soon be illustrated), for then you will be able to make use of the assumption P (n). Appealing to the assumption P (n) is referred to as using the induction hypothesis. After establishing that P (n + 1) is true, the proof will be complete. A proof that uses strategy is also called an induction proof or proof by induction. Our next theorem can be proved in more than one way; however, we shall provide a proof that uses mathematical induction. We will first present a proof analysis, and then we will prove the theorem by induction. Theorem For every natural number n 1, the natural number n 2 + n +2 is even.
4 1.3 Proof by Mathematical Induction 39 Proof Analysis. When you are looking for a proof by induction, it is helpful to write down the statement P (n). In this case we have P (n) : n 2 + n +2iseven. In this theorem our base value is b = 1. Next, we construct a proof diagram using the induction proof strategy 1.3.1: Base step: Prove P (1). Inductive step: Let n 1 be arbitrary. Assume P (n). Prove P (n + 1). Now, carefully write out the statements P (1) and P (n+1). Replacing n everywhere in the statement P (n) : n 2 + n +2iseven with 1, we obtain P (1) : iseven. By carefully replacing n with n +1everywhereinP (n), we obtain P (n + 1) : (n + 1) 2 +(n + 1) + 2 is even. Thus, we can rewrite our proof diagram as Base step: Prove iseven. Inductive step: Let n 1 be arbitrary. Assume n 2 + n +2iseven. Prove (n + 1) 2 +(n + 1) + 2 is even. Now, we write out what it means for these values to be even as follows: Base step: Prove =2k for some k 2 Z. Inductive step: Let n 1 be arbitrary. Assume n 2 + n +2=2i where i 2 Z. Prove (n + 1) 2 +(n + 1) + 2 = 2j for some j 2 Z. For the base step we see that =2 2, which is clearly even. For the inductive step, we must use the induction hypothesis, n 2 + n +2=2i where i 2 Z, (IH) to deduce the induction conclusion (n + 1) 2 +(n + 1) + 2 = 2j for some j 2 Z. (IC) To prove this induction conclusion, we will begin with the left hand side of the equality in (IC) and, using algebra, will make some changes so that the left hand side of the equation in (IH) appears. In this case, (n + 1) 2 +(n + 1) + 2 = (n 2 + n + 2) + 2(n + 1). (?) From the induction hypothesis (IH) we have that n 2 + n +2 = 2i. Upon substituting this into equation (?), we will be able to prove (IC) and thus conclude that (n + 1) 2 +(n + 1) + 2 is even.
5 40 Chapter 1. The Integers Our proof diagrams and analysis will now guide the composition of a well-structured proof of the theorem by mathematical induction. Proof of Theorem We prove, by mathematical induction, that n 2 +n+2 is even for all n 1. Base step: For n = 1, we see that =2 2iseven. Inductive step: Let n 1 and assume the induction hypothesis that n 2 + n + 2 is even, that is, n 2 + n +2=2i where i 2 Z. We now show that (n + 1) 2 +(n + 1) + 2 is even as follows: (n + 1) 2 +(n + 1) + 2 = (n 2 + n + 2) + 2(n + 1) by algebra =2i + 2(n + 1) by induction hyp (IH) = 2(i + n + 1) by algebra. Hence, (n + 1) 2 +(n + 1) + 2 = 2j where j = i + n + 1 is an integer. Therefore, (n + 1) 2 +(n + 1) + 2 is even and this completes the proof Strong Mathematical Induction A variation of proof by induction arises when, in the inductive step, you are having di culty relating P (n + 1) to P (n), or when the relationship you discover does not prove fruitful. Suppose, however, that you can relate P (n) top (k) for some (or all) k satisfying b apple k<n,wherebis the base value. In this case, you would like to use the fact that P (k) is true to conclude that P (n) is true; but, can you assume that P (k) is true? The answer is yes and, in fact, you can assume all the statements P (b),p(b + 1),...,P(n 1) are true. It may be helpful, once again, to think of the domino e ect as pictured in Figure 1.2. The base step shows that the first domino will fall. The inductive step ensures that each domino is perfectly aligned with all of the dominos that come before it. Thus, we can be sure that the first domino will fall (base step) and whenever all of the dominoes prior to the n-th domino fall, we know that the n-th domino will also fall (inductive step). Therefore, all of the dominoes must fall. (IH) Base step: Inductive step: b b+1 b+2 n 1 n Figure 1.2: Strong induction forces all of the dominoes to fall. The proof of a statement of the form (8n b)p (n) by strong induction is very much like a proof by mathematical induction. Strong induction just changes the focus slightly. Rather than proving P (n+1), one must prove P (n) by relating P (n) to one (or all) of the statements P (k) wherek<n. Principle of Strong Induction. Let P (n) be a statement about an integer variable n and let b be a fixed integer. Suppose that 1. P (b) is true, and 2. the statements P (b), P (b + 1),..., P (n 1) imply P (n), for all n>b. Then for all integers n b, P (n) istrue.
6 1.3 Proof by Mathematical Induction 41 Remark. A more formal way to say that all the statements P (b),p(b + 1),...,P(n say that 8k(b apple k<n! P (k)). 1) hold is to The principle of strong induction justifies the following proof strategy, which is often used in mathematics. Proof Strategy Let b be a fixed integer. To prove a statement of the form (8n by strong induction, use the diagram b) P (n) In other words, use the diagram Prove P (b). Prove (8n >b)[(8k(b apple k<n! P (k))! P (n)]. Base step: Inductive step: Prove P (b). Let n>bbe arbitrary. Assume P (k) wheneverb apple k<n. Prove P (n). Exercises Using mathematical induction, prove that for every natural number n 0, the natural number n 2 +3n +5isodd. 2. Prove, by mathematical induction, that for every natural number n 0, n is even or n is odd. 3. Using Exercise 2, prove that every integer n is either even or odd. 4. Using Exercise 3, prove that for every integer n we have that n(n + 1) is even. 5. For any natural number n 1, let P (n) be the statement: n = n(n+1) 2. What is the statement P (3)? What is the statement P (1)? What is the statement P (n + 1)? 6. Prove that n = n(n+1) 2 for all natural numbers n 1, by mathematical induction,. 7. Prove that for every natural number n 1, 3 (4 n 1). 8. Prove that for every natural number n 1, 8 (9 n 1). 9. Prove that for every natural number n 2, 2 n >n. 10. Prove that for every natural number n 6, n! > 2 n+2. Exercise Notes: For Exercise 2, use the induction proof strategy Base step: Prove 0 is even or odd. Inductive step: Let n 0 be arbitrary. Assume n is even or n is odd. Prove n + 1 is even or n +1isodd. In the inductive step, since you are assuming an or statement, use a proof by cases. For Exercise 3, there are two cases: (1) n 0; (2) n<0. For Exercise 4, there are two cases: (1) n is odd; (2) n is even.
Climbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationMathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
More informationMATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationThe theory of numbers
1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.
More informationHOW TO WRITE PROOFS. Dr. Min Ru, University of Houston
HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosopy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationCISC-102 Fall 2017 Week 3. Principle of Mathematical Induction
Week 3 1 of 17 CISC-102 Fall 2017 Week 3 Principle of Mathematical Induction A proposition is defined as a statement that is either true or false. We will at times make a declarative statement as a proposition
More informationChapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures
Chapter 2 Section 2.1: Proofs Proof Techniques CS 130 Discrete Structures Some Terminologies Axioms: Statements that are always true. Example: Given two distinct points, there is exactly one line that
More informationCHAPTER 4 SOME METHODS OF PROOF
CHAPTER 4 SOME METHODS OF PROOF In all sciences, general theories usually arise from a number of observations. In the experimental sciences, the validity of the theories can only be tested by carefully
More informationMATHEMATICAL INDUCTION
MATHEMATICAL INDUCTION MATH 3A 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
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationn(n + 1). 2 . If n = 3, then 1+2+3=6= 3(3+1) . If n = 2, then = 3 = 2(2+1)
Chapter 4 Induction In this chapter, we introduce mathematical induction, which is a proof technique that is useful for proving statements of the form (8n N)P(n), or more generally (8n Z)(n a =) P(n)),
More informationSection 4.2: Mathematical Induction 1
Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More information1 Implication and induction
1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,
More informationLecture 3.2: Induction, and Strong Induction
Lecture 3.2: Induction, and Strong Induction CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag Course Admin Mid-Term 1 Graded; to be returned
More informationMathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationLecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More informationMEETING 9 - INDUCTION AND RECURSION
MEETING 9 - INDUCTION AND RECURSION We do some initial Peer Instruction... Predicates Before we get into mathematical induction we will repeat the concept of a predicate. A predicate is a mathematical
More informationAQA Level 2 Further mathematics Further algebra. Section 4: Proof and sequences
AQA Level 2 Further mathematics Further algebra Section 4: Proof and sequences Notes and Examples These notes contain subsections on Algebraic proof Sequences The limit of a sequence Algebraic proof Proof
More informationMat Week 8. Week 8. gcd() Mat Bases. Integers & Computers. Linear Combos. Week 8. Induction Proofs. Fall 2013
Fall 2013 Student Responsibilities Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Proof Worksheets Attendance: Strongly Encouraged Overview 3.6 Integers and Algorithms 3.7
More informationStudent Responsibilities Week 8. Mat Section 3.6 Integers and Algorithms. Algorithm to Find gcd()
Student Responsibilities Week 8 Mat 2345 Week 8 Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Induction Proof Worksheets Attendance: Strongly Encouraged Fall 2013 Week
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationn n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set
1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationINDUCTION AND RECURSION. Lecture 7 - Ch. 4
INDUCTION AND RECURSION Lecture 7 - Ch. 4 4. Introduction Any mathematical statements assert that a property is true for all positive integers Examples: for every positive integer n: n!
More informationHence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n
Appendix A: The Principle of Mathematical Induction We now present an important deductive method widely used in mathematics: the principle of mathematical induction. First, we provide some historical context
More information0.Axioms for the Integers 1
0.Axioms for the Integers 1 Number theory is the study of the arithmetical properties of the integers. You have been doing arithmetic with integers since you were a young child, but these mathematical
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationMATH 55 - HOMEWORK 6 SOLUTIONS. 1. Section = 1 = (n + 1) 3 = 2. + (n + 1) 3. + (n + 1) 3 = n2 (n + 1) 2.
MATH 55 - HOMEWORK 6 SOLUTIONS Exercise Section 5 Proof (a) P () is the statement ( ) 3 (b) P () is true since ( ) 3 (c) The inductive hypothesis is P (n): ( ) n(n + ) 3 + 3 + + n 3 (d) Assuming the inductive
More informationCSC B36 Additional Notes sample induction and well-ordering proofs. c Nick Cheng
CSC B36 Additional Notes sample induction and well-ordering proofs c Nick Cheng Introduction We present examples of induction proofs here in hope that they can be used as models when you write your own
More informationReading and Writing. Mathematical Proofs. Slides by Arthur van Goetham
Reading and Writing Mathematical Proofs Slides by Arthur van Goetham What is a proof? Why explanations are not proofs What is a proof? A method for establishing truth What establishes truth depends on
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More informationDiscrete Mathematics & Mathematical Reasoning Induction
Discrete Mathematics & Mathematical Reasoning Induction Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics (Sections 5.1 & 5.2) Today 1 / 11 Another proof method: Mathematical
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic
11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic Bezout s Lemma Let's look at the values of 4x + 6y when x and y are integers. If x is -6 and y is 4 we
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationDivisibility = 16, = 9, = 2, = 5. (Negative!)
Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationInduction and Recursion
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion
More informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationMath 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10
Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive
More informationUse mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.
Exercises Exercises 1. There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next
More information35 Chapter CHAPTER 4: Mathematical Proof
35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More informationAnnouncements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive
Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationMath Circle: Recursion and Induction
Math Circle: Recursion and Induction Prof. Wickerhauser 1 Recursion What can we compute, using only simple formulas and rules that everyone can understand? 1. Let us use N to denote the set of counting
More informationDay 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.
Day 6 Tuesday May 9, 01 1 Basic Proofs We continue our look at basic proofs. We will do a few examples of different methods of proving. 1.1 Proof Techniques Recall that so far in class we have made two
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationTry the assignment f(1) = 2; f(2) = 1; f(3) = 4; f(4) = 3;.
I. Precisely complete the following definitions: 1. A natural number n is composite whenever... See class notes for the precise definitions 2. Fix n in N. The number s(n) represents... 3. For A and B sets,
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationCS173 Strong Induction and Functions. Tandy Warnow
CS173 Strong Induction and Functions Tandy Warnow CS 173 Introduction to Strong Induction (also Functions) Tandy Warnow Preview of the class today What are functions? Weak induction Strong induction A
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationHomework 1. 10(b) A useful denial of the statement We will win the first game or the second one is We will lose the first two games.
Homework 1 Exercises 1.1 (f) P Q Q Q Q P (Q Q) T T F T T T F T T T F T F T F F F T T F 5(d) The proposition Horses have four legs but three quarters do not equal one dollar is of the form A C. Since A
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationDiscrete Mathematics & Mathematical Reasoning Induction
Discrete Mathematics & Mathematical Reasoning Induction Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics (Sections 5.1 & 5.2) Today 1 / 12 Another proof method: Mathematical
More informationCSC236 Week 2. Larry Zhang
CSC236 Week 2 Larry Zhang 1 Announcements Tutorials start this week. Problem Set 1 will be out by Friday 2 Mathematical Induction 3 Mathematical Induction It s a proof technique It s an old proof technique
More informationCS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
More informationTutorial on Mathematical Induction
Tutorial on Mathematical Induction Roy Overbeek VU University Amsterdam Department of Computer Science r.overbeek@student.vu.nl April 22, 2014 1 Dominoes: from case-by-case to induction Suppose that you
More informationChapter 2. Divisibility. 2.1 Common Divisors
Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationMAS 6217 Number Theory and Cryptography (Yiu) Fall 2017 Exercise B (Solution)
MAS 6217 Number Theory and Cryptography (Yiu) Fall 2017 Exercise B (Solution) Solution to Problem B1. Let(a n ) be a sequence of numbers defined recursively by a n+1 = a 2 n a n +1, a 1 = 2. Show that
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 4
CS 70 Discrete Mathematics for CS Spring 008 David Wagner Note 4 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all natural numbers,
More informationA guide to Proof by Induction
A guide to Proof by Induction Adapted from L. R. A. Casse, A Bridging Course in Mathematics, The Mathematics Learning Centre, University of Adelaide, 1996. Inductive reasoning is where we observe of a
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More information