Solutions for Homework Assignment 2

Size: px
Start display at page:

Download "Solutions for Homework Assignment 2"

Transcription

1 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 the stated inequality, first note that a = a b)+b, and b = b a)+a. Applying the triangle inequality, we then obtain a a b + b, and b b a + a. Adding b to the first inequality and adding a to the second inequality, and using the fact that b a = b a) = a b, we then obtain a b a b, and b a a b Finally, by definition a b is one of the two numbers a b or a b ). Both numbers are bounded above by a b. Therefore, we have proved that a b a b which is what we wanted to prove. Problem 2. Suppose that a,b R and that a < b. Prove that there exists an irrational number c satisfying a < c < b. Solution. The following result was proved in section 2.5 of our textbook and stated in class. Proposition. Suppose that u,v R and v > u. Then the set Q u,v) is nonempty. Here u,v) = {x x R, u < x < v}. We will use this proposition. However, first we will refine it slightly. According to the proposition, there exists at least one r Q such that 1

2 u < r < v. We can apply the proposition to the interval r,v). It follows that there exists at least one s Q satisfying r < s < v. Note that s r. Note also that s > r > u. Hence we have u < s < v. Therefore, using the above proposition, we have proved that the interval u, v) contains at least two distinct rational numbers. Now consider an interval a,b), where a,b R and a < b. Let u = a/ 2 and let v = b/ 2. Note that u,v R and u < v. Therefore, by the refinement of the above proposition, there exists at least two distinct rational numbers in the interval u, v). At least one of those two rational numbers will be nonzero. Therefore, the interval u, v) contains at least one nonzero rational number. Let r be such a rational number. Hence r 0 and u < r < v. Thus, we have a/ 2 < r < b/ 2 Multiplying by 2 which is a positive real number), we obtain a < r 2 < b Let c = r 2. Then a < c < b. We now prove that c is irrational. The fact that r 0 and r Q will be used. To prove that c is irrational, we give an indirect argument. Suppose that c Q. Since r Q and r 0, we know that r has an inverse in Q under multiplication. We denote that inverse, as usual, by r 1. It is an element of Q. We are using the fact that Q is a field. Thus, since we are assuming that c Q, and we know that r 1 Q, it follows that cr 1 Q. Now cr 1 = r 1 r 2) = 2. Thus, it follows that 2 Q. This is a contradiction because it is known that 2 Q, a fact which was probably proved in your Math 300 course. In the above paragraph, we have used basic facts about Q which are included in the statement that Q is a field. Problem 3. Define a sequence {x n } as follows. Let x 1 = 2. Let x n+1 = 2+x n for all n 1. Use mathematical induction to prove that x n < x n+1 for all n 1. Use mathematical induction to prove that x n < 2 for all n 1. State why you now know that {x n } is a convergent sequence. Determine Lim x n. Solution. First of all, we will prove that x n < x n+1 for all n 1. The Principle of Mathematical Induction tells us that it is sufficient to prove the following two assertions: x 1 < x 2 and x n < x n+1 = x n+1 < x n+2. 2

3 The first statement is true because x 1 = 2, and x 2 = 2+x 1 = 2+ 2 > 2+1 > 2 = x 1 Here we have used the fact that 2 > 1 and also the fact that y = x is an increasing function of x for x > 0. To prove the second assertion, assume that x n < x n+1 for some n 1. It then follows that x n+2 = 2+x n+1 > 2+x n = x n+1. We have again used the fact that y = x is an increasing function of x for x > 0. It follows that x n+1 < x n+2. Therefore, by the Principle of Mathematical Induction, we have proved that x n < x n+1 for all n 1. This means that the sequence {x n } is strictly increasing. It is therefore a nondecreasing sequence. Now we will prove that x n < 2 for all n 1. We will prove this by Mathematical Induction. It suffices to prove x 1 < 2 and x n < 2 = x n+1 < 2 Now x 1 = 2 and so we certainly have x 1 < 2. To prove the above implication, assume that x n < 2. It then follows that x n+1 = 2+x n < 2+2 = 4 = 2 and so it is indeed true that x n < 2 = x n+1 < 2. Therefore, by the Principle of Mathematical Induction, we have proved that x n < 2 for all n 1. The sequence {x n } has been proven to be a nondecreasing sequence which is bounded above. By a theorem proved in class sometimes called the Monotone Convergence Theorem ), we can conclude that {x n } is a convergent sequence. This means that Lim x n = A for some A R. To determine A, we use the equation x n+1 = 2+x n. We have A = Lim x n+1 = Lim 2+xn = 2+ Lim x n = 2+A. 3

4 We have used the fact that the function Fx) = 2+x is continuous at x = A. Note that A 2 and Fx) is actually continuous for all x > 2. ) Therefore, A satisfies the equation A = 2+A. This equation implies that A 2 = 2+A and hence A is a root of the quadratic polynomial x 2 x 2. The roots are x = 2 and x = 1. The x n are positive and so Lim x n 1. Therefore, we have Lim x n = 2. Problem 4. Suppose that a > 0. Define a sequence {x n } as follows. Let x 1 = a. Let x n+1 = a+x n for all n 1. Prove that {x n } is a convergent sequence. Determine Lim x n. Solution. First of all, we will prove that x n < x n+1 for all n 1. The Principle of Mathematical Induction tells us that it is sufficient to prove the following two assertions: x 1 < x 2 and x n < x n+1 = x n+1 < x n+2. The first statement is true because x 1 = a, and x 2 = a+x 1 = a+ a > a+0 = a = x 1 Here we have used the fact that a > 0 and also the fact that y = x is an increasing function of x for x > 0. To prove the second assertion, assume that x n < x n+1 for some value of n 1. It then follows that x n+2 = a+x n+1 > a+x n = x n+1. We have again used the fact that y = x is an increasing function of x for x > 0. It follows that x n+1 < x n+2. Therefore, by the Principle of Mathematical Induction, we have proved that x n < x n+1 for all n 1. This means that the sequence {x n } is strictly increasing. It is therefore a nondecreasing sequence. Now we will prove that the sequence {x n } is bounded above. Let B = Max{2,a}. We will actually prove that x n < B for all n 1. We will use Mathematical Induction. It suffices to prove that x 1 < B and x n < B = x n+1 < B. 4

5 Note that B = 2 if a 2 and B = a if a > 2. Now x 1 = a. If a 2, then we have x 1 = a 2 < 2 = B. and so x 1 < B if a 2. Now consider a > 2. If a > 2, we have x 1 = a < a = B and so we have x 1 < B if a > 2. In all cases, we have proved that x 1 < B. Now we will prove the implication x n < B = x n+1 < B. For this purpose, suppose that x n < B for some n 1. We then have x n+1 = a+x n < a+b B +B = 2B BB = B which implies that x n+1 < B. In the above inequalities, we have used the facts that a B and that 2 B. These inequalities are true because B = Max{a,2}. We have proved the implication x n < B = x n+1 < B. By the Principle of Mathematical Induction, we have proved that x n < B for all n 1. It follows that the sequence {x n } is bounded above. We have also proved that {x n } is a nondecreasing sequence. Therefore, the Monotone Convergence Theorem implies that {x n } is a convergent sequence. Thus, we know that Lim x n = A for some A R. Furthermore, we have A = Lim x n+1 = Lim a+xn = a+a. We have used the fact that Fx) = a+x is a continuous function for all x > 0. Note that A x 1 = a > 0 and so Fx) is continuous at x = A. And so we must have A = a+a. It follows that A 2 = a+a. Hence A is a root of the polynomial x 2 x a. There are two roots of that polynomial, and hence two possibilities for A, namely A = a 2 or A = 1 1+4a 2 We have used the famous formula for the roots of a quadratic polynomial. Now a is positive and therefore we 1+4a > 1 = 1. Therefore, 1 1+4a < 0. The second possibility for A mentioned above is actually negative. But we must have A x 1 = a > 0. Therefore, it is the first possibility which is the correct value of A. We have proved that Lim x n = a 2..

6 Problem 5. Let s n = nn for all n 1. Prove that Lim n!e s n n exists. Do not try to determine this limit. Solution. Note that s n > 0 for all n 1. Thus, the sequence is bounded below. We will prove that {s n } is a strictly decreasing sequence. Therefore, the hypotheses in the Monotone Convergence Theorem more specifically, theorem 2 listed under the completeness properties of R) are satisfied. It will therefore follow that {s n } is a convergent sequence. This means that Lim s n exists. To prove that the sequence {s n } is strictly decreasing, it will be helpful to consider the ratio s n+1 /s n. We have s n+1 /s n = n+1)n+1 n+1)!e n+1 / n n n!e n = Now n+1)! = n+1) n! and therefore We also have n+1) n+1 n n The above remarks imply that = n+1)n n n n+1) = s n+1 /s n = n+1) n+1) n! ) n n n+1)! e n e n+1 ) n! n+1)! = 1 n+1. Also, it is clear that e n e n+1 = 1 e n) n n+1) ) n 1 n+1) n n+1 1 e and therefore we have s n+1 /s n = 1+ 1 ) n / e n This is true for all n 1. Finally, recall a result proved in chapter 1, namely that 1+ 1 n) n < e. for all n 1. It follows that s n+1 /s n < 1. Since s n > 0, it now follows that s n+1 < s n for all n 1. We have proved that {s n } is indeed a strictly decreasing sequence. 6

7 Problem 6. Determine the least upper bound and the greatest lower bound for the following subsets of R. No explanation is necessary. a) S = { a a Q, 2 < a < 100 }. b) S = { a a Q, 2 a < 100 } { a a Z, 50 < a < 105 }. c) S = { 1) n 2 n) 2 n N }. d) S = { 1) n + 1 n N }. n Solutions. The question does not require explanations. Nevertheless we will give explanations below. Solution for part a). It is clear that 100 is an upper bound for S. Suppose that A < 100. Let B = Max{ 2,A}. Then B < 100. According to problem 2, there is an irrational number c such that B < c < 100. Then c 2,100) and c Q. Hence c S. But we also have A < c. Hence A is not an upper bound for S. It follows that every upper bound on S is 100 and hence 100 is the LUB for S. It is clear that 2is alower boundfor S. Wewill showthat 2 istheglbofs. Suppose that A > 2. Let B = Min{100,A}. Then B > 2. According to problem 2, there is an irrational number c such that 2 < c < B. Then c 2,100) and c Q. Hence c S. But we also have c < A. Hence A is not a lower bound for S. It follows that every lower bound for S is 2 and hence 2 is the GLB for S. Solution for part b). The set S is the union of two sets, namely the sets { a a Q, 2 a < 100 } and { a a Z, 50 < a < 105 } The second set is just a finite set. The largest element of that finite set is 104. Note that 104 is an upper bound on both of the above sets. Since 104 S, no upper bound for S can be smaller than 104. Thus, the LUB of S is 104. Note that 2 is a lower bound for S. Just as in part a), one can see that 2 is the GLB of S. Instead of using problem 2, one uses the fact that any interval a,b), where b > a, must contain a rational number. 7

8 Solution for part c). The numbers 1) n 2 n) 2 are zero or negative when n is odd, and hence they are < 2. But if n is even, then n = 2k, where k N, and the number 2 1 is in k the set S. That number is also < 2. It follows that 2 is an upper bound for S. However, Lim 2 1 ) k k and hence it follows that 2 is the LUB for the set S. For even n, the numbers 1) n 2 n) 2 are positive. For n = 1, we obtain the number 0. But for an odd integer n > 1, we can write n = 2k + 1, where k N. The numbers 2 2k+1) 2 are in the set S. All of these numbers are > 2. It follows that 2 is a lower bound for S. Furthermore, Lim 2 2 ) k 2k +1 It follows that 2 is the GLB for the set S. = 2 = 2 Solution for part d). The set S contains 0, 3/2. 2/3, and 5/4. It is clear that 1) n + 1 n 3/2 for all n N and hence 3/2 is an upper bound for S. Since 3/2 S, it follows that 3/2 is the LUB for S. If n is even, then 1) n + 1 = 1+ 1 is positive. But if n is odd and n > 1, n n then n = 2k +1, where k N, and the corresponding number in S is k +1 which is > 1. It follows that 1 is a lower bound for S. Furthermore, and hence the GLB for S is 1. Lim 1+ 1 ) k 2k +1 = 1 7. For each of the sets S in problem 6, determine if the least upper bound is actually in S. Determine if the greatest lower bound is actually in S. No explanation is necessary. 8

9 Solution. For the set in part a), the LUB and the GLB are 100 and 2, respectively. Neither of those numbers is in S. For the set in part b), the LUB and the GLB are 104 and 2, respectively. In fact, 104 is in the set S. But 2 Q and so 2 is not in the set S. For the set in part c), the LUB and the GLB are 2 and 2, respectively. Neither of those numbers is in S. For the set in part a), the LUB is 3/2 and this is in S. However, the GLB is 1 and this is not in S. 9

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions 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

More information

Solutions to Homework Set 1

Solutions 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 information

Math 104: Homework 1 solutions

Math 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 information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

Homework 3 Solutions, Math 55

Homework 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 information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

Simplifying Rational Expressions and Functions

Simplifying Rational Expressions and Functions Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

Supremum and Infimum

Supremum 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 information

Structure of R. Chapter Algebraic and Order Properties of R

Structure 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 information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 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 information

M17 MAT25-21 HOMEWORK 6

M17 MAT25-21 HOMEWORK 6 M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute

More information

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous: MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

More information

2-7 Solving Quadratic Inequalities. ax 2 + bx + c > 0 (a 0)

2-7 Solving Quadratic Inequalities. ax 2 + bx + c > 0 (a 0) Quadratic Inequalities In One Variable LOOKS LIKE a quadratic equation but Doesn t have an equal sign (=) Has an inequality sign (>,

More information

PRACTICE PROBLEMS: SET 1

PRACTICE 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 information

MATH 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. 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 information

Axioms for the Real Number System

Axioms 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 information

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

Copyright 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 information

The Real Number System

The Real Number System MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely

More information

MATH 1A, Complete Lecture Notes. Fedor Duzhin

MATH 1A, Complete Lecture Notes. Fedor Duzhin MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a

More information

5 Set Operations, Functions, and Counting

5 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 information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Part 2 Continuous functions and their properties

Part 2 Continuous functions and their properties Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice

More information

Writing 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 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 information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final 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 information

In case (1) 1 = 0. Then using and from the previous lecture,

In 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 information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: 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 information

Foundations of Discrete Mathematics

Foundations of Discrete Mathematics Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true

More information

MIDTERM REVIEW FOR MATH The limit

MIDTERM REVIEW FOR MATH The limit MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of

More information

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1. Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

More information

Proofs Not Based On POMI

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 information

Math 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. 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 information

Math 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.

Math 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement. Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations

More information

Math 109 HW 9 Solutions

Math 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 information

Math 24 Spring 2012 Questions (mostly) from the Textbook

Math 24 Spring 2012 Questions (mostly) from the Textbook Math 24 Spring 2012 Questions (mostly) from the Textbook 1. TRUE OR FALSE? (a) The zero vector space has no basis. (F) (b) Every vector space that is generated by a finite set has a basis. (c) Every vector

More information

Math 421, Homework #9 Solutions

Math 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 information

Solutions, 2004 NCS/MAA TEAM COMPETITION

Solutions, 2004 NCS/MAA TEAM COMPETITION Solutions, 004 NCS/MAA TEAM COMPETITION Each problem number is followed by an 11-tuple (a 10, a 9, a 8, a 7, a 6, a 5, a 4, a 3, a, a 1, a 0 ), where a k is the number of teams that scored k points on

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 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

Math1a Set 1 Solutions

Math1a 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 information

MATH 301 INTRO TO ANALYSIS FALL 2016

MATH 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 information

a + 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.

a + 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 information

Properties of the Integers

Properties 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 information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real 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 information

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

More information

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

means 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 information

Math 3450 Homework Solutions

Math 3450 Homework Solutions Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the

More information

A lower bound for X is an element z F such that

A 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 information

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa 1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

MATH 2400: PRACTICE PROBLEMS FOR EXAM 1

MATH 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 information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.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 information

Math 61CM - Solutions to homework 2

Math 61CM - Solutions to homework 2 Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of

More information

Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition

Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition 1 Appendix A : Numbers, Inequalities, and Absolute Values Sets A set is a collection of objects with an important

More information

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Recitation 7: Existence Proofs and Mathematical Induction

Recitation 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 information

Chapter 1 The Real Numbers

Chapter 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 information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

MT804 Analysis Homework II

MT804 Analysis Homework II MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real

More information

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

Math 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 information

Scalar multiplication and addition of sequences 9

Scalar multiplication and addition of sequences 9 8 Sequences 1.2.7. Proposition. Every subsequence of a convergent sequence (a n ) n N converges to lim n a n. Proof. If (a nk ) k N is a subsequence of (a n ) n N, then n k k for every k. Hence if ε >

More information

Proofs Not Based On POMI

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 1, 018 Outline Non POMI Based s Some Contradiction s Triangle

More information

Math 410 Homework 6 Due Monday, October 26

Math 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 information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Basic Notation The following is standard notation for proofs: A B. A implies B. A B.

More information

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee 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 information

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set

n 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 information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 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 information

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice

More information

MATH CSE20 Homework 5 Due Monday November 4

MATH 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 information

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3 APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than

More information

Some Results Concerning Uniqueness of Triangle Sequences

Some Results Concerning Uniqueness of Triangle Sequences Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We

More information

MATH 271 Summer 2016 Practice problem solutions Week 1

MATH 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 information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

UNC Charlotte 2004 Algebra with solutions

UNC Charlotte 2004 Algebra with solutions with solutions March 8, 2004 1. Let z denote the real number solution to of the digits of z? (A) 13 (B) 14 (C) 15 (D) 16 (E) 17 3 + x 1 = 5. What is the sum Solution: E. Square both sides twice to get

More information

Principles of Real Analysis I Fall I. The Real Number System

Principles 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 information

MATH3283W LECTURE NOTES: WEEK 6 = 5 13, = 2 5, 1 13

MATH3283W LECTURE NOTES: WEEK 6 = 5 13, = 2 5, 1 13 MATH383W LECTURE NOTES: WEEK 6 //00 Recursive sequences (cont.) Examples: () a =, a n+ = 3 a n. The first few terms are,,, 5 = 5, 3 5 = 5 3, Since 5

More information

Introduction to Abstract Mathematics

Introduction to Abstract Mathematics Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of

More information

MATH 31BH Homework 1 Solutions

MATH 31BH Homework 1 Solutions MATH 3BH Homework Solutions January 0, 04 Problem.5. (a) (x, y)-plane in R 3 is closed and not open. To see that this plane is not open, notice that any ball around the origin (0, 0, 0) will contain points

More information

A Short Review of Cardinality

A Short Review of Cardinality Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the

More information

Practice Test III, Math 314, Spring 2016

Practice Test III, Math 314, Spring 2016 Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections

More information

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018 First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.

More information

1 The Well Ordering Principle, Induction, and Equivalence Relations

1 The Well Ordering Principle, Induction, and Equivalence Relations 1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number

More information

Postulate 2 [Order Axioms] in WRW the usual rules for inequalities

Postulate 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 information

Maths 212: Homework Solutions

Maths 212: Homework Solutions Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

More information

Homework 11. Solutions

Homework 11. Solutions Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue

More information

Solutions to Assignment 1

Solutions 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 information

Homework 3: Solutions

Homework 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 information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 131A: REAL ANALYSIS (BIG IDEAS) MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.

More information

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with

More information

1 Homework. Recommended Reading:

1 Homework. Recommended Reading: Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis

More information

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets) MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question

More information

Math 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 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 information

Basic Proof Examples

Basic 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 information

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with

More information

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0 8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n

More information

is equal to = 3 2 x, if x < 0 f (0) = lim h = 0. Therefore f exists and is continuous at 0.

is equal to = 3 2 x, if x < 0 f (0) = lim h = 0. Therefore f exists and is continuous at 0. Madhava Mathematics Competition January 6, 2013 Solutions and scheme of marking Part I N.B. Each question in Part I carries 2 marks. p(k + 1) 1. If p(x) is a non-constant polynomial, then lim k p(k) (a)

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Math 535: Topology Homework 1. Mueen Nawaz

Math 535: Topology Homework 1. Mueen Nawaz Math 535: Topology Homework 1 Mueen Nawaz Mueen Nawaz Math 535 Topology Homework 1 Problem 1 Problem 1 Find all topologies on the set X = {0, 1, 2}. In the list below, a, b, c X and it is assumed that

More information