Proofs Not Based On POMI
|
|
- Leslie Cameron Norton
- 5 years ago
- Views:
Transcription
1 s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle Inequalities
2 is not a rational number We will prove this technque using a technique called contradiction. Let s assume we can find positive integers p and q so that = (p/q with p and q having no common factors. When this happens we say p and q are relatively prime. This tells us p = q which also tells us p is divisible by. Thus, p is even. Does this mean p itself is even? Well, if p was odd, we could write p = l + 1 for some integer l. Then, we would know p = (l + 1 = 4l + 4l + 1. The first two terms, 4l and 4l are even, so this implies p would be odd. So we see p odd implies p is odd. Thus, we see p must be even when p is even. So we now know p = k for some integer k as it is even. But since p = q, we must have 4k = q. But this says q must be even. The same reasoning we just used to show p odd implies p is odd, then tells us q odd implies q is odd. Thus q is even too. Now here is the contradiction. We assumed p and q were relatively prime; i.e. they had no common factors. But if they are both even, they share the factor. This is the contradiction we seek. Hence, our original assumption must be incorrect and we can not find positive integers p and q so that = (p/q.
3 3 is not a rational number Let s assume we can find positive integers p and q so that 3 = (p/q with p and q being relatively prime. This tells us p = 3q which also tells us p is divisible by 3. Does this mean p itself is divisible by 3? Well, if p was not divisible by 3, we could write p = 3l + 1 or 3l + for some integer l. Then, we would know or p = (3l + 1 = 9l + 6l + 1. p = (3l + = 9l + 1l + 4. The first two terms in both choices are divisible by 3 and the last terms are not. So we see p is not divisible by 3 in both cases. Thus, we see p must be divisible by 3 when p is divisible by 3. So we now know p = 3k for some integer k as it is divisible by 3. But since p = 3q, we must have 9k = 3q. But this says q must be divisible by 3. The same reasoning we just used to show p divisible by 3 implies p is divisible by 3, then tells us q divisible by 3 implies q is divisible by 3. Now here is the contradiction. We assumed p and q were relatively prime; i.e. they had no common factors. But if they are both divisible by 3, they share the factor 3. This is the contradiction we seek. Hence, our original assumption must be incorrect and we can not find positive integers p and q so that 3 = (p/q.
4 Let s introduce some notation: 1. if p and q are relatively prime integers, we say (p, q = 1.. if the integer k divides p, we say k p. Now let s modify the two proofs we have seen to attack the more general problem of showing n is not rational if n is prime. n is not a rational number when n is a prime number Let s assume there are integers u and v with (u, v = 1 so the n = (u/v which implies nv = u. This tells us n u. Now we will invoke a theorem from number theory or abstract albebra which tells us every integer u has a prime factor decomposition: u = (p 1 r1 (p r (p s rs for some prime numbers p 1 to p s and positive integers r 1 to r s. For example, here are two such prime decompositions. 66 = = 4 5 It is easy to see what the integers p 1 to p s and r 1 to r s are in each of these two examples and we leave that to you!
5 Thus, we can say u = (p1 r1 (p r (ps rs Since n u, n must divide one of the terms in the prime factor decomposition: i.e. we can say n divides the term p ri i. Now the term p ri i is a prime number to a positive integer power ri. The only number that can divide into that evenly are appropriate powers of pi. But, we know n is a prime number too, so n must divide pi itself. Hence, we can conclude n = pi. But this tells us immediately that n divides u too. Hence, we know now u = nw for some integer w. This tells us (nw = nv or nw = v. Thus, n v. The previous argument applied to v then tells us n v too. Hence u and v share the factor n which is a contradiction. Thus we conclude n is irrational.
6 Definition Absolute Values Let x be any real number. We define the absolute value of x, denoted by x, by x = { x, if x 0 x, if x < 0. For example, 3 = 3 and 4 = 4. Theorem Triangle Inequality Let x and y be any two real numbers. Then and for any number z. x + y x + y x y x + y x y x z + z y
7 We know ( x + y = (x + y which implies But xy x y impyling ( x + y = x + xy + y. ( x + y x + x y + y = x + x y + y = ( x + y. Taking square roots, we find x + y x + y. Of course, the argument for x y is similar as x y = x + ( y. To do the next part, we know a + b a + b for any a and b. Let a = x z and b = z y. Then (x z + (z y x z + z y. Comment The technique where we do x y = (x z + (z y is called the Add and Subtract Trick and we will use it a lot! Comment Also note x c is the same as c x c and we use this other way of saying it a lot too. Theorem Backwards Triangle Inequality Let x and y be any two real numbers. Then x y x y y x x y x y x y
8 Let x and y be any real numbers. Then by the Triangle Inequality Similary, x = (x y + y x y + y x y x y y = (y x + x y x + x y x x y Combining these two cases we see x y x y x y But this is the same as saying x y x y. Lemma Proving a Number x is Zero via Estimates Let x be a real number that satisfies x < ɛ, ɛ > 0. Then, x = 0. We will prove this by contradiction. Let s assume x is not zero. Then x > 0 and x / is a valid choice for ɛ. The assumption then tells us that x < x / or x / < 0 which is not possible. So our assumption is wrong and x = 0.
9 Theorem Extended Triangle Inequality Let x1 to xn be a finite collection of real numbers with n 1. Then x1 + xn x1 + + xn or using summation notation n n xi xi. BASIS : P(1 is the statement x1 x1 ; so the basis step is verified. INDUCTIVE : We assume P(k is true for an arbitrary k > 1. Hence, we know xi xi. Now look at P(k + 1. We note by the triangle inequality applied to a = k xi and b = xk+1, we have a + b a + b or ( k+1 xi xi + xk+1 Now apply the induction hypothesis to see k+1 k+1 xi xi + xk+1 = xi This shows P(k + 1 is true and by the POMI, P(n is true for all n 1.
10 Theorem l Norm Inequality Let {a1,..., an} and {b1,..., bn} be finite collections of real numbers with n 1. Then ( n n ( n ai bi BASIS : P(1 is the statement a1b1 a1 b 1 ; the basis step is true. INDUCTIVE : We assume P(k is true for k > 1. Hence, we know ( ( ai bi Now look at P(k + 1. k+1 = + ak+1bk+1 Let A denote the first piece; i.e. A = k. Then expanding the term A + ak+1bk+1, we have k+1 = = ( k+1 = A + Aak+1bk+1 + ak+1 bk+1 ( + ak+1bk+1 + ak+1 bk+1
11 or k+1 + ai bi ak+1bk+1 + a k+1 bk+1 Now use the induction hypothesis to see k+1 ai bi + k ai k bi ak+1bk+1 (1 +ak+1 bk+1 k k Now let α = a i bk+1 and β = b i ak+1. We know for any real numbers α and β that (α β 0. Thus, α + β α β. We can use this in our complicated sum above. We have α β = k k α + β = ai bi ak+1 bk+1 ( ( ai bk+1 + bi ak+1
12 Hence, the middle part of Equation 1 can be replaced by the αβ α + β inequality above to get k+1 = ai ( bi + ai bk+1 ( ( + bi ak+1 + ak+1 bk+1 ( ( ai + ak+1 bi + bk+1 But this says k+1 ( k+1 ( k+1 ai bi This shows P(k + 1 is true and by the POMI, P(n is true for all n 1.
13 Comment This is a famous type of theorem. For two vectors [ ] [ ] a1 b1 V = and W = a the inner product of V and W, < V, W > is a1b1 + ab and the norm or length of the vectors is V = a 1 + a and W = b1 + b The Theorem above then says < V, W > V W. This is called the Cauchy - Schwartz Inequality also. Comment This works for three and n dimensional vectors too. b Homework 3 Prove the following propositions is not a rational number using the same sort of argument we used in the proof of 3 is not rational is not a rational number using the same sort of argument we used in the proof of 3 is not rational. 3.3 On the interval [1, 10], use factoring and the triangle inequality to prove x y 10 x y.
Proofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
More informationDirchlet s Function and Limit and Continuity Arguments
Dirchlet s Function and Limit and Continuity Arguments James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 23, 2018 Outline 1 Dirichlet
More informationDirchlet s Function and Limit and Continuity Arguments
Dirchlet s Function and Limit and Continuity Arguments James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 2, 2018 Outline Dirichlet
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 informationThe Limit Inferior and Limit Superior of a Sequence
The Limit Inferior and Limit Superior of a Sequence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 13, 2018 Outline The Limit Inferior
More informationBolzano Weierstrass Theorems I
Bolzano Weierstrass Theorems I James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 8, 2017 Outline The Bolzano Weierstrass Theorem Extensions
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples
More informationThe Existence of the Riemann Integral
The Existence of the Riemann Integral James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 18, 2018 Outline The Darboux Integral Upper
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples
More informationFourier Sin and Cos Series and Least Squares Convergence
Fourier and east Squares Convergence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University May 7, 28 Outline et s look at the original Fourier sin
More informationConvergence of Sequences
James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 2 Homework Definition Let (a n ) n k be a sequence of real numbers.
More informationConvergence of Sequences
Convergence of Sequences James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline Convergence of Sequences Definition Let
More informationGeneral Power Series
General Power Series James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University March 29, 2018 Outline Power Series Consequences With all these preliminaries
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 informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2017 Outline Geometric Series The
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 informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationResearch Methods in Mathematics Homework 4 solutions
Research Methods in Mathematics Homework 4 solutions T. PERUTZ (1) Solution. (a) Since x 2 = 2, we have (p/q) 2 = 2, so p 2 = 2q 2. By definition, an integer is even if it is twice another integer. Since
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationHölder s and Minkowski s Inequality
Hölder s and Minkowski s Inequality James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 1, 218 Outline Conjugate Exponents Hölder s
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationSolving Diophantine Equations With Unique Factorization
Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions
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 informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline Domains of Continuous Functions The Intermediate
More informationLecture 2: Proof Techniques Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 2: Proof Techniques Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete Mathematics and App. cs.colostate.edu/
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 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 informationMathematical Induction
Mathematical Induction James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Introduction to the Class Mathematical Induction
More informationUpper and Lower Bounds
James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University August 30, 2017 Outline 1 2 s 3 Basic Results 4 Homework Let S be a set of real numbers. We
More informationSummer HSSP Week 1 Homework. Lane Gunderman, Victor Lopez, James Rowan
Summer HSSP Week 1 Homework Lane Gunderman, Victor Lopez, James Rowan July 9, 2014 Questions 1 Chapter 1 Homework Questions These are the questions that should be turned in as homework. As mentioned in
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
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 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 informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
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 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 informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
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 informationPower Series Solutions of Ordinary Differential Equations
Power Series Solutions for Ordinary Differential Equations James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University December 4, 2017 Outline Power
More informationFourier Sin and Cos Series and Least Squares Convergence
Fourier Sin and Cos Series and east Squares Convergence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University December 4, 208 Outline Sin and Cos
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 informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
More informationMath 104: Homework 1 solutions
Math 10: Homework 1 solutions 1. The basis for induction, P 1, is true, since 1 3 = 1. Now consider the induction step, assuming P n is true and examining P n+1. By making use of the result (1 + +... +
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationMath 410 Homework 6 Due Monday, October 26
Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all
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 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 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 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 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 informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More informationNotes: Pythagorean Triples
Math 5330 Spring 2018 Notes: Pythagorean Triples Many people know that 3 2 + 4 2 = 5 2. Less commonly known are 5 2 + 12 2 = 13 2 and 7 2 + 24 2 = 25 2. Such a set of integers is called a Pythagorean Triple.
More informationDue date: Monday, February 6, 2017.
Modern Analysis Homework 3 Solutions Due date: Monday, February 6, 2017. 1. If A R define A = {x R : x A}. Let A be a nonempty set of real numbers, assume A is bounded above. Prove that A is bounded below
More informationHomework 3: Solutions
Homework 3: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 16, 2014 Exercise 1 Show that this implication is a tautology, by using a table of truth: [(p q) (p r) (q r)] r. p q
More informationUniform Convergence and Series of Functions
Uniform Convergence and Series of Functions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 7, 017 Outline Uniform Convergence Tests
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
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 informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationMathematics 220 Midterm Practice problems from old exams Page 1 of 8
Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then
More informationHOMEWORK #2 - MA 504
HOMEWORK #2 - MA 504 PAULINHO TCHATCHATCHA Chapter 1, problem 6. Fix b > 1. (a) If m, n, p, q are integers, n > 0, q > 0, and r = m/n = p/q, prove that (b m ) 1/n = (b p ) 1/q. Hence it makes sense to
More informationProof by Induction. Andreas Klappenecker
Proof by Induction Andreas Klappenecker 1 Motivation Induction is an axiom which allows us to prove that certain properties are true for all positive integers (or for all nonnegative integers, or all integers
More informationSECTION Types of Real Numbers The natural numbers, positive integers, or counting numbers, are
SECTION.-.3. Types of Real Numbers The natural numbers, positive integers, or counting numbers, are The negative integers are N = {, 2, 3,...}. {..., 4, 3, 2, } The integers are the positive integers,
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 informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationSOLUTIONS FOR 2012 APMO PROBLEMS
Problem. SOLUTIONS FOR 0 APMO PROBLEMS Solution: Let us denote by XY Z the area of the triangle XY Z. Let x = P AB, y = P BC and z = P CA. From y : z = BCP : ACP = BF : AF = BP F : AP F = x : follows that
More informationStudying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008
Studying Rudin s Principles of Mathematical Analysis Through Questions Mesut B. Çakır c August 4, 2008 ii Contents 1 The Real and Complex Number Systems 3 1.1 Introduction............................................
More informationSeunghee Ye Ma 8: Week 2 Oct 6
Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means
More informationBMOS MENTORING SCHEME (Senior Level) February 2011 (Sheet 5) Solutions
MOS MENTORING SCHEME (Senior Level) February 011 (Sheet 5) Solutions These solutions represent one way of solving the questions. They are not the only way, and just because your solution is different does
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More informationProjection Theorem 1
Projection Theorem 1 Cauchy-Schwarz Inequality Lemma. (Cauchy-Schwarz Inequality) For all x, y in an inner product space, [ xy, ] x y. Equality holds if and only if x y or y θ. Proof. If y θ, the inequality
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 informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationMore On Exponential Functions, Inverse Functions and Derivative Consequences
More On Exponential Functions, Inverse Functions and Derivative Consequences James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 10, 2019
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More informationIntroduction to Analysis Constructing R from Q
Introduction to Analysis Constructing R from Q Definition. A subset A Q is called a cut if it posses the following three properties. A and A Q. 2. If r A, then also A contains every rational q < r. 3.
More informationExample: Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple
Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple of 2, that is, an integer x is even if x = 2y for some integer
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
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 informationa 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,
5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.
More informationAntiderivatives! Outline. James K. Peterson. January 28, Antiderivatives. Simple Fractional Power Antiderivatives
Antiderivatives! James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 28, 2014 Outline Antiderivatives Simple Fractional Power Antiderivatives
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More informationIntroduction to proofs. Niloufar Shafiei
Introduction to proofs Niloufar Shafiei proofs Proofs are essential in mathematics and computer science. Some applications of proof methods Proving mathematical theorems Designing algorithms and proving
More informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
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 informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More information