Homework 5 Solutions

Size: px
Start display at page:

Download "Homework 5 Solutions"

Transcription

1 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 x = 1. Let x be a real number and let P be the statement considered. P is an implication of the form p q with p defined as x is a real number with x = 0 and q defined as x = 1. We note that p is false, the proposition P is therefore always true. b) If x and y are real numbers such that x < y, show that there exists a real number z with x < z < y. This is an existence proof: we only need to find one example. Let us define z = x+y. We show that x < z and z < y. z x = x+y x = y x > 0 as x < y. Similarly, y z = y x+y = y x > 0 as x < y. x < z < y: we found one real number z that satisfies x < z < y: this concludes the proof. Exercise Let x be a real number. Show that 4x = x + x x x Let us write x = n + ɛ, where n is an integer and ɛ is a real number and 0 ɛ < 1. n is the largest integer that is smaller than x; by definition, n = x. We use a proof by case (similar to the proof used in class for x ): a) : If 0 ɛ < 1/4, then 0 4ɛ < 1, 0 < ɛ + 1/4 < 1, 0 < ɛ + /4 < 1 and 0 < ɛ + 3/4 < 1., 4x = 4n + 4ɛ = 4n 1

2 and x + x + 1/4 + x + /4 + x + 3/4 = n + ɛ + n + ɛ + 1/4 + n + ɛ + /4 + n + ɛ + 3/4 = n + n + n + n = 4n b) If 1/4 ɛ < /4, then 1 4ɛ <, 0 < ɛ + 1/4 < 1, 0 ɛ + /4 < 1, and 1 ɛ + 3/4 <., and 4x = 4n + 4ɛ = 4n + 1 x + x + 1/4 + x + /4 + x + 3/4 = n + ɛ + n + ɛ + 1/4 + n + ɛ + /4 + n + ɛ + 3/4 = n + n + n + n + 1 = 4n + 1 c) If /4 ɛ < 3/4, then 4ɛ < 3, 0 < ɛ + 1/4 < 1, 1 ɛ + /4 <, and 1 ɛ + 3/4 <., 4x = 4n + 4ɛ = 4n + x + x + 1/4 + x + /4 + x + 3/4 = n + ɛ + n + ɛ + 1/4 + n + ɛ + /4 + n + ɛ + 3/4 = n + n + n n + 1 = 4n + d) If 3/4 ɛ < 1, then 3 4ɛ < 4, 1 < ɛ + 1/4 <, 1 ɛ + /4 <, and 1 ɛ + 3/4 <., 4x = 4n + 4ɛ = 4n + 3 x + x + 1/4 + x + /4 + x + 3/4 = n + ɛ + n + ɛ + 1/4 + n + ɛ + /4 + n + ɛ + 3/4 = n + n n n + 1 = 4n + 3 Based on the method of proof by case, we conclude that 4x = x + x x x is true for all x.

3 Exercise 3 This is a generalization of exercise 3: Let x be a real number and an integer greater or equal to 3. Show that x = x + x x x +. We could use a proof by case that generalizes the solution described for exercise, using case; there is however a faster and maybe more elegant solution. Let us define: f(x) = x x x + 1 x x + We show first that f(x) is periodic, with 1 being one period. For this, we need to show that: x R, f ( x + 1 ) = f(x) Let x be a real number. otice that: ( f x + 1 ) = (x + 1 ) x + 1 x +... x x = x + 1 x x + 1 x + 1 = x + 1 x x + 1 x 1 = f(x) Since this is true with no conditions on x, it is true for all x, and therefore f is periodic, with 1/ being one period. A periodic function needs to be defined only on one period, here in the interval [ 0, 1 ). Let x be in this interval. : f(x) = 0. 0 x < 1 < 1 0 x + 1 < = < x + 1 < = = 1 0 x < 1 = 1 Since f(x) = 0 on one of its period, we have f(x) = 0 x = x + x x x + x R. : Exercise 4 Let x be a real number. Show that x + x+1 = x. Let x = n, where n is an integer. By definition of floor, we have: n x < n + 1. We consider two cases: 3

4 1) n is even: there exists an integer k such that n = k. We can rewrite the inequality above as: Similarly, k x < k + 1 k x < k + 1 < k + 1 x = k. (1) k + 1 x + 1 < k + k < k + 1 x + 1 < k + 1 x + 1 = k () Combining equations (1) and (), we get x + x+1 = k = n = x ) n is odd: there exists an integer k such that n = k +1. We can rewrite the inequality above as: Similarly, k + 1 x < k + k < k + 1 < x < k + 1 x = k. (3) k + x + 1 < k + 3 k + 1 x + 1 < k + 3 < k + x + 1 = k + 1 (4) Combining equations (3) and (4), we get x + x+1 = k + k + 1 = n = x 4

5 Exercise 5 Let x be a real number. Solve the following equations: a) 3x 16 = x Let x be a real number. We notice first that 3x 16 is an integer., if x is a solution of the equation 3x 16 = x, then x has to be an integer. Since x is an integer, 3x 16 is also an integer, and therefore 3x 16 = 3x 16. The equation then becomes 3x 16 = x where x is an integer, therefore x = 8. This is the only solution. b) x 3x = 6 Let x be a real number. We notice first that x 3x + 5 is an integer, which we write as k. If there exists a solution x to the equation, then k 1 = 6, where k is the integer defined before, and therefore k = 5. However, k is even, and 5 is odd. We have reached a contradiction. the proposition, there exists a solution x to the equation, is false, and the equation does not have a solution. Extra Credit Let x and y be two real numbers such that 0 < x y. We define: a) The arithmetic mean m of x and y: m = x + y b) The geometric mean g of x and y: g = xy c) The harmonic mean h of x and y: Show that: h = ( 1 x + 1 y ) x h g m y We will proceed by steps: a) Let us show first that: i) x m y otice that: m x = x+y x = y x 0 since y x; therefore m x. Similarly, y m = y x y = y x 0; therefore y m. ii) x g y otice that g x = xy x x = x ( ) y x. Since x y and square root is an increasing function, g x 0; therefore g x. Similarly, y g = y y x y = y ( ) y x ; therefore y g 0 and y g. iii) x h y otice that 1 h is the arithmetic mean of 1 x and 1 y. From above, we can say that 1 y 1 h 1 x from which we deduce that x h y. 5

6 b) g m ote that m g = x+y x y = x+y x y = ( x y) 0; therefore m g. c) h g We note again that 1 h is the arithmetic mean of 1 x and 1 y. The geometric mean of 1 x and 1 y is 1 x 1 y, i.e. 1 g. From b) above, we have 1 g 1 h, therefore h g. From a), b), and c), we can conclude that x h g m y. 6

Homework 5 Solutions

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

Homework 2: Solutions

Homework 2: Solutions Homework 2: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 7, 2014 Exercise 1 Construct a truth table for each of these compound propositions: a) (p q) (p q) p q p q p q (p q)

More information

Homework 4 Solutions

Homework 4 Solutions Homework 4 Solutions ECS 20 (Fall 14) Patrice Koehl koehl@cs.ucdavis.edu November 1, 2017 Exercise 1 Let n be an integer. Give a direct proof, an indirect proof, and a proof by contradiction of the statement

More information

Problem Set 7 Solutions

Problem Set 7 Solutions Problem Set 7 Solutions ECS 20 (Fall 2016) Patrice Koehl koehl@cs.ucdavis.edu November 15, 2017 Exercise 1 a) Let a be a natural number strictly greater than 1. Show that gcd(a, a 1) = 1. b) Use the result

More information

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let

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

MTHSC 3190 Section 2.9 Sets a first look

MTHSC 3190 Section 2.9 Sets a first look MTHSC 3190 Section 2.9 Sets a first look Definition A set is a repetition free unordered collection of objects called elements. Definition A set is a repetition free unordered collection of objects called

More information

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6

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

Ch 3.2: Direct proofs

Ch 3.2: Direct proofs Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations

More information

Research Methods in Mathematics Homework 4 solutions

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

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f

More information

Graphing Linear Equations: Warm Up: Brainstorm what you know about Graphing Lines: (Try to fill the whole page) Graphing

Graphing Linear Equations: Warm Up: Brainstorm what you know about Graphing Lines: (Try to fill the whole page) Graphing Graphing Linear Equations: Warm Up: Brainstorm what you know about Graphing Lines: (Try to fill the whole page) Graphing Notes: The three types of ways to graph a line and when to use each: Slope intercept

More information

COT 2104 Homework Assignment 1 (Answers)

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

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

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

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

Math Real Analysis

Math Real Analysis 1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

More information

Basic properties of the Integers

Basic properties of the Integers Basic properties of the Integers Branko Ćurgus May 2, 2017 1 Axioms for the Integers In the axioms below we use the standard logical operators: conjunction, disjunction, exclusive disjunction, implication,

More information

Homework 1 Solutions

Homework 1 Solutions MATH 171 Spring 2016 Problem 1 Homework 1 Solutions (If you find any errors, please send an e-mail to farana at stanford dot edu) Presenting your arguments in steps, using only axioms of an ordered field,

More information

Solutions to Homework 9

Solutions to Homework 9 Solutions to Homework 9 Read the proof of proposition 1.7 on p. 271 (section 7.1). Write a more detailed proof. In particular, state the defintion of uniformly continuous and explain the comment whose

More information

Finals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016

Finals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016 Finals: Solutions ECS 20 (Fall 2009) Patrice Koehl koehl@cs.ucdavis.edu May 20, 2016 Part I: Logic Exercise 1 On a distant island, every inhabitant is either a Knight or Knave. Knights only tell the truth.

More information

Computer Science Section 1.6

Computer Science Section 1.6 Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,

More information

We want to show P (n) is true for all integers

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

Math 3000 Section 003 Intro to Abstract Math Homework 6

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

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

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

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

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

The Law of Averages. MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin

The Law of Averages. MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin The Law of Averages MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin Basic Principle of Inequalities: For any real number x, we have 3 x 2 0, with

More information

Solutions to Homework 2

Solutions to Homework 2 Solutions to Homewor Due Tuesday, July 6,. Chapter. Problem solution. If the series for ln+z and ln z both converge, +z then we can find the series for ln z by term-by-term subtraction of the two series:

More information

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division

More information

Math Homework # 4

Math Homework # 4 Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible

More information

PRACTICE PROBLEM SET

PRACTICE PROBLEM SET PRACTICE PROBLEM SET NOTE: On the exam, you will have to show all your work (unless told otherwise), so write down all your steps and justify them. Exercise. Solve the following inequalities: () x < 3

More information

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

Discrete Math I Exam II (2/9/12) Page 1

Discrete Math I Exam II (2/9/12) Page 1 Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression

More information

Sequences, their sums and Induction

Sequences, their sums and Induction Sequences, their sums and Induction Example (1) Calculate the 15th term of arithmetic progression, whose initial term is 2 and common differnce is 5. And its n-th term? Find the sum of this sequence from

More information

MA 301 Test 4, Spring 2007

MA 301 Test 4, Spring 2007 MA 0 Test 4, Spring 007 hours, calculator allowed, no notes. Provide paper for the students to do work on. Students should not write answers on test sheet. TA Grades, 5, 6, 7 All answers must be justified.

More information

C241 Homework Assignment 7

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

ANALYSIS EXERCISE 1 SOLUTIONS

ANALYSIS EXERCISE 1 SOLUTIONS ANALYSIS EXERCISE 1 SOLUTIONS 1. (a) Let B The main course will be beef. F The main course will be fish. P The vegetable will be peas. C The vegetable will be corn. The logical form of the argument is

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

Numerical Sequences and Series

Numerical Sequences and Series Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is

More information

Homework 1. 10(b) A useful denial of the statement We will win the first game or the second one is We will lose the first two games.

Homework 1. 10(b) A useful denial of the statement We will win the first game or the second one is We will lose the first two games. Homework 1 Exercises 1.1 (f) P Q Q Q Q P (Q Q) T T F T T T F T T T F T F T F F F T T F 5(d) The proposition Horses have four legs but three quarters do not equal one dollar is of the form A C. Since A

More information

Homework I, Solutions

Homework I, Solutions Homework I, Solutions I: (15 points) Exercise on lower semi-continuity: Let X be a normed space and f : X R be a function. We say that f is lower semi - continuous at x 0 if for every ε > 0 there exists

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

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2 MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

Discrete Mathematics. Spring 2017

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

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

MAT 243 Test 1 SOLUTIONS, FORM A

MAT 243 Test 1 SOLUTIONS, FORM A t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,

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

Sequence. A list of numbers written in a definite order.

Sequence. A list of numbers written in a definite order. Sequence A list of numbers written in a definite order. Terms of a Sequence a n = 2 n 2 1, 2 2, 2 3, 2 4, 2 n, 2, 4, 8, 16, 2 n We are going to be mainly concerned with infinite sequences. This means we

More information

Proof by Contradiction

Proof by Contradiction Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving

More information

Real Analysis - Notes and After Notes Fall 2008

Real Analysis - Notes and After Notes Fall 2008 Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start

More information

2. Introduction to commutative rings (continued)

2. Introduction to commutative rings (continued) 2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of

More information

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday. Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid

More information

Climbing an Infinite Ladder

Climbing an Infinite Ladder Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite

More information

1 Take-home exam and final exam study guide

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

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

9/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 information

Exercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <

Exercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 < Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable

More information

Mathematical Induction

Mathematical Induction Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values

More information

Due date: Monday, February 6, 2017.

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

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also

More information

MAT115A-21 COMPLETE LECTURE NOTES

MAT115A-21 COMPLETE LECTURE NOTES MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes

More information

Ch 4.2 Divisibility Properties

Ch 4.2 Divisibility Properties Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:

More information

(4) Using results you have studied, show that if x, y are real numbers,

(4) Using results you have studied, show that if x, y are real numbers, Solutions to Homework 4, Math 310 (1) Give a direct proof to show that if a, b are integers which are squares of integers, then ab is the square of an integer. Proof. We show that if a, b are integers

More information

(3,1) Methods of Proof

(3,1) Methods of Proof King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek

More information

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

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

Some Review Problems for Exam 1: Solutions

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

HOMEWORK ASSIGNMENT 5

HOMEWORK ASSIGNMENT 5 HOMEWORK ASSIGNMENT 5 ACCELERATED PROOFS AND PROBLEM SOLVING [MATH08071] Each problem will be marked out of 4 points. Exercise 1 [1, Exercise 10.4]). Show that for all positive integers n, hcf6n + 8, 4n

More information

POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents

POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) SALMA KUHLMANN Contents 1. Proof of Hilbert s Theorem (continued) 1 2. The Motzkin Form 2 3. Robinson Method (1970) 3 3. The Robinson Form 4 1. PROOF OF

More information

4 A Catalogue of Functions and Inequalities 8. SECTION E Modulus Function

4 A Catalogue of Functions and Inequalities 8. SECTION E Modulus Function 4 A Catalogue of Functions and Inequalities 8 SECTION E Modulus Function By the end of this section you will be able to visualize the geometric interpretation of the modulus function derive some inequalities

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

Testing Series with Mixed Terms

Testing Series with Mixed Terms Testing Series with Mixed Terms Philippe B. Laval KSU Today Philippe B. Laval (KSU) Series with Mixed Terms Today 1 / 17 Outline 1 Introduction 2 Absolute v.s. Conditional Convergence 3 Alternating Series

More information

1. Propositions: Contrapositives and Converses

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

Prelim Examination 2010 / 2011 (Assessing Units 1 & 2) MATHEMATICS. Advanced Higher Grade. Time allowed - 2 hours

Prelim Examination 2010 / 2011 (Assessing Units 1 & 2) MATHEMATICS. Advanced Higher Grade. Time allowed - 2 hours Prelim Examination 00 / 0 (Assessing Units & ) MATHEMATICS Advanced Higher Grade Time allowed - hours Read Carefully. Calculators may be used in this paper.. Candidates should answer all questions. Full

More information

Solutions to Sample Problems for Midterm

Solutions to Sample Problems for Midterm Solutions to Sample Problems for Midterm Problem 1. The dual of a proposition is defined for which contains only,,. It is For a compound proposition that only uses,, as operators, we obtained the dual

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

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

Math 361: Homework 1 Solutions

Math 361: Homework 1 Solutions January 3, 4 Math 36: Homework Solutions. We say that two norms and on a vector space V are equivalent or comparable if the topology they define on V are the same, i.e., for any sequence of vectors {x

More information

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

Math 104: Homework 7 solutions

Math 104: Homework 7 solutions Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for

More information

1 Solving Algebraic Equations

1 Solving Algebraic Equations Arkansas Tech University MATH 1203: Trigonometry Dr. Marcel B. Finan 1 Solving Algebraic Equations This section illustrates the processes of solving linear and quadratic equations. The Geometry of Real

More information

1 Implication and induction

1 Implication and induction 1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,

More information

Example 2: Let R be any commutative ring with 1, fix a R, and let. I = ar = {ar : r R},

Example 2: Let R be any commutative ring with 1, fix a R, and let. I = ar = {ar : r R}, 25. Ideals and quotient rings We continue our study of rings by making analogies with groups. The next concept we introduce is that of an ideal of a ring. Ideals are ring-theoretic counterparts of normal

More information

Solutions for Homework Assignment 2

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 information

p = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is

p = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that

More information

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. (x 1) 2 > 0.

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

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n). MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

4.1 Real-valued functions of a real variable

4.1 Real-valued functions of a real variable Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from

More information

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018 University of California, San Diego Department of Computer Science and Engineering CSE 20 Solutions to Midterm Exam Winter 2018 Problem 1 (30 points) a. The boolean function f(p, q) = (q p) ( q p) is specified

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

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

In mathematics (and physics...) such quantities are called vectors and are represented by a directed line segment.

In mathematics (and physics...) such quantities are called vectors and are represented by a directed line segment. 12.2 1 12.2 Vectors Some things that we measure are determined simply by their magnitude, e.g., length, time, mass, etc. Others require more information. For example, to describe velocity one needs the

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

Natural Numbers: Also called the counting numbers The set of natural numbers is represented by the symbol,.

Natural Numbers: Also called the counting numbers The set of natural numbers is represented by the symbol,. Name Period Date: Topic: Real Numbers and Their Graphs Standard: 9-12.A.1.3 Objective: Essential Question: What is the significance of a point on a number line? Determine the relative position on the number

More information