Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions
|
|
- Louisa Jones
- 5 years ago
- Views:
Transcription
1 Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is a number x such that x + x) = 0. Adding x to the equation x+y = x+z gives x)+x+y) = x)+x+z). By Axiom, this becomes x)+x)+y = x)+x)+z. By Axiom, x)+x = x+ x) = 0, so we have 0 + y = 0 + z, which then becomes y + 0 = z + 0 by Axiom, and then y = z by Axiom 4a). b) x) = x. Solution. By Axiom a), the number x) is the unique number such that x + x)) = 0. But x + x = x + x) b Axiom, and x + x) = 0 by Axiom a), so x + x = 0, so by uniqueness, x = x). c) If x 0, then x ) = x. Solution. By Axiom b), since x 0, there is a unique number x such that x x =. If x = 0, we would have x 0 =. But by Theorem.3.f) this would imply 0 =, which contradicts Axiom 4b). Thus x 0, so by Axiom b) there exists a number x ) such that x x ) =. Multiplying both sides of this by x gives by Axiom 4b). On the other hand, Thus x ) = x. x x x ) ) = x = x x x x ) ) = x x )) x ) Axiom = x ) Axiom b) = x ) Axiom = x ) Axiom 4b). d) x + y) = x) + y) Solution. By Axiom a), x + y) is the unique number such that x + y) + x + y)) = 0. Thus, it suffices to show that x + y) + x) + y)) = 0. To
2 prove this, we write x + y) + x) + y)) = x + y + x) + y))) Axiom = x + y + y) + x))) Axiom = x + y + y)) + x)) Axiom = x x)) Axiom a) = x + x) + 0) Axiom = x + x) Axiom 4a) = 0 Axiom a) e) x y) = x) y. Solution. By Axiom a), x y) is the unique number such that x y+ x y)) = 0. Thus we just need to show that x y + x) y = 0. But x y + x) y = y x + y x) Axiom = y x + x)) Axiom 3 = y 0 Axiom a) = 0 y Axiom = 0 since we proved in class that 0 y = 0 for any y R. f) If x y = 0 then either x = 0 or y = 0. Solution. Suppose x y = 0. If y = 0 then we are done. Otherwise y 0, and Axiom b) implies that there is a real number y such that y y =. Thus x = x = x y y ) Axiom 4b) = x y) y Axiom = 0 y hypothesis = 0 again since 0 x = 0 for any real number x. g) If x > 3 then x 3 + x > 33. Solution. First, since > 0, Axioms and 9 imply x = x > 3 =. Next, since 3 > 0, Axiom 7 implies x > 0. Thus, Axiom 9 implies x > 3 x. But Axiom implies 3 x = x 3 and Axiom 9 implies x 3 > 3 3 = 9. Hence Axiom 7 implies x > 9. Axioms 9 and then imply x 3 > 9 x = x 9 > 3 9, so Axiom 7 implies x 3 > 7. Finally, Axiom 8 implies x 3 + x > 7 + = 33. h) If 0 < x <, then x < x. Solution. Since x > 0, Axiom 9 implies x = x > x x = x.
3 i) xy = x y Solution. If x 0 and y 0, then xy 0, so xy = xy = x y. If x < 0 and y < 0, then 0 = x + x) < 0 + x) = x, so x > 0 and likewise y > 0. Thus x) y) > 0 by Axiom 9. Thus x y = x) y) = x) y) > 0, so xy = xy and x y = x) y) = xy. If x 0 and y < 0, then x = x and y = y. Axiom 9 implies x y < 0, so xy = xy) = x y) = x y. The case x < 0 and y 0 is similar.. Use induction to show that k = Solution. Let S n denote the statement: nn + )n + ) k = In the base case n =, statement S takes the form for all n N. nn + )n + ). k = both sides of the equation equal, the statement S is true. + ) + ). Since Now suppose that S n is true for some integer n. We then need to prove that S n+ n+ must also be true. Now S n+ is the statement k n + )n + )n + 3) =. If we consider the left hand side of this equation, and use the fact that S n is true, we have n+ ) k = k + n + ) nn + )n + ) = + n + ) = n + nn + ) + n + )) = n + n + 7n + ) n + )n + )n + 3) =. Therefore the statement S n+ is true. Hence the implication S n = S n+ holds for all n, so by the principle of induction S n is true for all n. ) nn + ) 3. Use induction to show that k 3 = for all n N. ) nn + ) Solution. Let S n denote the statement: k 3 =. ) + ) In the base case n =, statement S takes the form k 3 =. Since both sides of the equation equal, the statement S is true. 3
4 Now suppose that S n is true for some integer n. We then wish to prove that n+ ) n + )n + ) S n+ must also be true. Now S n+ is the statement k 3 =. If we consider the left hand side of this equation, and use the fact that S n is true, we have n+ ) k 3 = k 3 + n + ) 3 ) nn + ) = + n + ) 3 n + ) = n + 4n + ) ) 4 n + ) = n + ) 4 ) n + )n + ) =. Therefore the statement S n+ is true. Hence the implication S n = S n+ holds for all n, so by the principle of induction S n is true for all n. 4. Use induction to show that Solution. The statement S reads both sides are equal to. kk + ) = n n + for all n N. Now suppose S n is true for some n. Then n+ ) kk + ) = + kk + ) n + )n + ) = n n + + n + )n + ) nn + ) = n + )n + ) + n + )n + ) = n + n + n + )n + ) = n + n +, kk + ) =. This is clearly true since + since S n is true so S n+ is true. Therefore S n = S n+ for all n, and the principle of induction implies S n is true for all n.. Find an integer n 0 such that n < 3 n for all n n 0. Use induction to prove your assertion. 4
5 Solution. Let S n denote the statement n < 3 n. By trial and error, we see that n 3 n if n 0, but that = 0 < 7747 = 3. Thus S n is false if n 0 but S is true. We claim that S n is true for all n. The base case S is true, so now fix some n and suppose S n is true for this n. We want to show that S n+ is true, i.e. that n + ) < 3 n+. Since S n is true we have so multiplying both sides by 3 gives n < 3 n, 3n < 3 3 n = 3 n+. If we can show that n + ) < 3n, then by transitivity we would have n + ) < 3 n+ as desired. But n + ) < 3n n + ) < 3 + < 3. n n) Now since n we have + + = n Thus we have + n) < and therefore ) = < 3. n + ) < 3n < 3 n+ and therefore S n+ is true. Hence the implication S n = S n+ is true for all n so by the principle of induction S n is true for all n.. Let x = 0 and let x n+ = + 3 x n for n. a) Compute x n for n =, 3, 4,. Solution. x = + 3 x = + 3 0) = x 3 = + 3 x = + ) = 0 3 x 4 = + 3 x 3 = ) = 3 3 x = + 3 x 4 = /3) = 3 9 b) Prove by induction that x n < 8 for all n N. Solution. Let S n be the statement x n < 8. Since x = 0 < 8, S is true. Now suppose S n is true for some n. Then x n < 8. Multiplying this inequality by gives x 3 3 n <. Adding to both sides then gives + x 3 n < 8. By definition x n+ = + x 3 n, so x n+ < 8, and thus S n+ is true. Hence S n = S n+ for all n, so by induction S n is true for all n.
6 c) Prove by induction that x n+ > x n for all n N. Solution. Let S n be the statement x n+ > x n. Since x = > 0 = x, S is true. Now suppose S n is true for some n. Then x n+ > x n. Multiplying this inequality by gives x 3 3 n+ > x 3 n. Adding to both sides then gives + x 3 n+ > + x 3 n. By definition x n+ = + x 3 n and x n+ = + x 3 n+, so x n+ > x n+, and thus S n+ is true. Hence S n = S n+ for all n, so by induction S n is true for all n. 7. Let A = { n+3 : n N}. Find luba) and glba), and prove your assertions. Solution. For any n, we have n + 3 4, so, which implies, n+3 4 n+3 4 and thus 3. Thus 3 is a lower bound for A. But 3 A take n = ), so any n number larger than 3 is not a lower bound for A. Thus glba) = Next, since < for all n N, is an upper bound for A. Now suppose x <. n+3 Then x > 0. By the Archimedian Property, there exists some n N such that n > 3. Thus n + 3 >, and since x > 0 this implies x)n + 3) >. x x Since n + 3 > 0, this then implies x >, and thus > x. But is n+3 n+3 n+3 an element of A, so x is not an upper bound for A. Therefore luba) =. 8. Suppose A and B are nonempty subsets of R such that x y for every x A and every y B. Show that luba) glbb). Solution. There are a couple of ways to prove this. First, given x A, since x y for every y B it follows that x is a lower bound for B and thus x glb B. Since this is true for every x A it follows that glb B is an upper bound for A and therefore glb B lub A. Alternately, one could do a proof by contradiction. Suppose lub A > glb B. Then lub A is not a lower bound for B so there exists some y B such that y < lub A. Then this y cannot be an upper bound for A, so there must exist some x A such that x > y. This contradicts the initial assumption that x y for every x A and every y B.
Solutions 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 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 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 informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationRecitation 7: Existence Proofs and Mathematical Induction
Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive
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 informationIn case (1) 1 = 0. Then using and from the previous lecture,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
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 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 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 informationIn 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2
Why non-pictured analysis? CHAPTER 1 Preliminaries f is continuous at x if lim f(x + h) = f(x) h!0 and f(x + h) f(x) f is di erentiable at x if lim h!0 h Then but Di erentiability =) continuity, continuity
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 informationIn case (1) 1 = 0. Then using and from Friday,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
More informationPostulate 2 [Order Axioms] in WRW the usual rules for inequalities
Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
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 informationHomework 5 Solutions
Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu February 8, 019 Exercise 1 a) Show that the following statement is true: If there exist two integers n and m such that n + n + 1
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 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 informationMATH ASSIGNMENT 1 - SOLUTIONS September 11, 2006
MATH 0-090 ASSIGNMENT - September, 00. Using the Trichotomy Law prove that if a and b are real numbers then one and only one of the following is possible: a < b, a b, or a > b. Since a and b are real numbers
More informationMath 283 Spring 2013 Presentation Problems 4 Solutions
Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n
More informationDo not open this exam until you are told to begin. You will have 75 minutes for the exam.
Math 2603 Midterm 1 Spring 2018 Your Name Student ID # Section Do not open this exam until you are told to begin. You will have 75 minutes for the exam. Check that you have a complete exam. There are 5
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationWell-Ordering Principle. Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element.
Well-Ordering Principle Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element. Well-Ordering Principle Example: Use well-ordering property to prove
More informationMidterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong
Midterm Sample Introduction to Higher Math Fall 018 Instructor: Linh Truong Name: Instructions: Print your name in the space above. Show your reasoning. Write complete proofs. You have 75 minutes. No notes,
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
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 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 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 informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
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 informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
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 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 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 informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More information1 The Real Number System
1 The Real Number System The rational numbers are beautiful, but are not big enough for various purposes, and the set R of real numbers was constructed in the late nineteenth century, as a kind of an envelope
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
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 informationMath 3000 Section 003 Intro to Abstract Math Homework 6
Math 000 Section 00 Intro to Abstract Math Homework 6 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 01 Solutions April, 01 Please note that these solutions are
More informationMTH 3318 Solutions to Induction Problems Fall 2009
Pat Rossi Instructions. MTH 338 Solutions to Induction Problems Fall 009 Name Prove the following by mathematical induction. Set (): ++3+...+ n n(n+) i n(n+) Step #: Show that the proposition is true for
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
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 informationPeano Axioms. 1. IfS x S y then x y (we say that S is one to one).
Peano Axioms To present a rigorous introduction to the natural numbers would take us too far afield. We will however, give a short introduction to one axiomatic approach that yields a system that is quite
More informationA DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any
Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
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 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 informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
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 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 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 informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
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 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 informationThe least element is 0000, the greatest element is 1111.
Note: this worksheet has been modified to emphasize the Boolean algebra content. Some problems have been deleted.; this, for instance, is why the first problem is #5 rather than #1. 5. Let A be the set
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationC241 Homework Assignment 7
C24 Homework Assignment 7. Prove that for all whole numbers n, n i 2 = n(n + (2n + The proof is by induction on k with hypothesis H(k i 2 = k(k + (2k + base case: To prove H(, i 2 = = = 2 3 = ( + (2 +
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 informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationMetric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)
Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.
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 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...
CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique
More informationA n = A N = [ N, N] A n = A 1 = [ 1, 1]. n=1
Math 235: Assignment 1 Solutions 1.1: For n N not zero, let A n = [ n, n] (The closed interval in R containing all real numbers x satisfying n x n). It is easy to see that we have the chain of inclusion
More informationMath 220A Complex Analysis Solutions to Homework #2 Prof: Lei Ni TA: Kevin McGown
Math 220A Complex Analysis Solutions to Homework #2 Prof: Lei Ni TA: Kevin McGown Conway, Page 14, Problem 11. Parts of what follows are adapted from the text Modular Functions and Dirichlet Series in
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 informationHomework 5 Solutions
Homework 5 Solutions ECS 0 (Fall 17) Patrice Koehl koehl@cs.ucdavis.edu ovember 1, 017 Exercise 1 a) Show that the following statement is true: If there exists a real number x such that x 4 +1 = 0, then
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 informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
More informationAlgebraic Structures of Numbers. Andrejs Treibergs. September 8, 2009
Math 3210 2. Algebraic Structures of Numbers Andrejs Treibergs University of Utah September 8, 2009 2. Peano Axioms Here are the basic axioms for the Natural Numbers N = {1, 2, 3,...}. N1. There is an
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 informationSolutions for Math 225 Assignment #4 1
Solutions for Math 225 Assignment #4 () Let B {(3, 4), (4, 5)} and C {(, ), (0, )} be two ordered bases of R 2 (a) Find the change-of-basis matrices P C B and P B C (b) Find v] B if v] C ] (c) Find v]
More informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
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 informationSection A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.
Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
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 informationMATH 2400: PRACTICE PROBLEMS FOR EXAM 1
MATH 2400: PRACTICE PROBLEMS FOR EXAM 1 PETE L. CLARK 1) Find all real numbers x such that x 3 = x. Prove your answer! Solution: If x 3 = x, then 0 = x 3 x = x(x + 1)(x 1). Earlier we showed using the
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
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 informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
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 information