MATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
|
|
- Jodie Black
- 5 years ago
- Views:
Transcription
1 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 often think of taking cases in dealing with asolute values. We have 2y + 2 if 2y y + 2 = (2y + 2) if 2y + 2 < 0. Now 2y means 2y 2, so y 1. Likewise, and 2y + 2 < 0 means 2y < 2, i.e. y < 1. So 2y + 2 if y 1 2y + 2 = 2y 2 if y < 1. In the same way, 2y 5 if 2y 5 0 2y 5 = (2y 5) if 2y 5 < 0. Now 2y 5 0 means 2y 5, so y 5 2. Likewise, and 2y 5 < 0 means 2y < 5, i.e. y < 5 2. So 2y 5 if y 5 2y 5 = 2 2y + 5 if y < 5 2. Given the way the functions are roken apart, there are three cases: y < 1, 1 y < 5 2, and y 5 2. Notice that all real numers are in one of the three cases. (Continued on next page) 1
2 Case 1. y < 1. In this case, 2y + 2 2y 5 = (2y + 2) [ 2y + 5] = 2y 2 + 2y 5 = 7. Therefore, 7 2y + 2 2y 5 7 holds in this case. Case 2. 1 y < 5 2. In this case, 2y + 2 2y 5 = (2y + 2) [ 2y + 5] = 4y 3. We have to do some additional work to see whether the target inequality holds. We have 1 y < 5, so 4 < 4x 10, and 7 < 4y Therefore, 7 2y + 2 2y 5 7 holds in this case. Case 3. y 5 2. In this case, 2y + 2 2y 5 = (2y + 2) (2y 5) = 7. Therefore, 7 2y + 2 2y 5 7 holds in this case. Since 7 2y + 2 2y 5 7 holds all three cases, it is true for all y R. QED 2
3 Chapter 3 handout page 8 numer 3: Let n Z. If n 2 +n is odd then n 4 3n < 0. Proof: Let n Z. We have n 2 + n = n(n + 1). Now every integer n is either even or odd. We need two cases. n is even: Then n = 2k for some k Z, so n 2 +n = (2k) 2 +(2k) = 4k 2 +2k = 2(2k 2 +k). Let l = 2k 2 + k. Note that l Z ecause 2, k Z (y axioms). Thus n 2 + n = 2l where l is an integer, so n 2 + n is even. Thus in this case the hypothesis is false. The statement is therefore vacuously true in this case. n is odd: Then n = 2k + 1 for some k Z, so n 2 + n = (2k + 1) 2 + (2k + 1) = 4k 2 + 4k k + 1 = 4k 2 + 6k + 2 = 2(2k 2 + 3k + 1). Let l = 2k 2 + 3k + 1. Note that l Z ecause 2, k, 3, 1 Z (y axioms). Thus n 2 + n = 2l where l is an integer, so n 2 + n is even. Thus in this case the hypothesis is false. The statement is therefore vacuously true in this case. In all cases the hypothesis is false, thus the theorem is true for all n Z. QED Chapter 3 handout page 8 prolem 4: Prove: If x is an integer, then x 2 x. Proof: By cases: Case 1: If x = 0, then x 2 = 0 2 = 0 = x, so x 2 x, in this case. Case 2: If x = 1, then x 2 = 1 2 = 1 = x, so x 2 x, in this case. Case 3: If x > 1, then x 2 = x x > x 1 = x (y axioms). Thus x 2 x, in this case. Case 4: If x < 0, then x 2 > 0 > x (again, y axioms). Thus x 2 x, in this case. This accounts for all integer values of x. 3
4 Chapter 3 handout page 8 prolem 7: Let a, Z. Prove that if a + and a are of the same parity, then a and are oth even. We prove the contrapositive: Let a, Z. If at least one of a, is odd then a + and a are of opposite parity. We need three cases. Case 1: a, are oth odd Case 2: a is even and is odd. Case 3: a is odd and is even. Note, though that cases 2 and 3 can e comined as oth a + and a are symmetric etween a and. So we will have two cases. Proof: (of Contrapositive): Case 1: a, are oth odd. Then there exist k, l Z such that a = 2k + 1, = 2l + 1. Then a + = (2k + 1) + (2l + 1) = 2k + 2k + 2 = 2(k + l + 1) and a = (2k + 1) (2l + 1) = 4kl + 2k + 2l + 1 = 2(2kl +k +l) +1. Let m = k +l +1 and n = 2kl +k +l. Then m, n Z as k, l, 1, 2 Z (axioms). Thus a + = 2m, a = 2n + 1 where m, n Z, so a + is even, a is odd, and they have opposite parity in this case. Case 2: One of a, is even. Without loss of generality, assume a is even and is odd. Then there exist k, l Z such that a = 2k, = 2l + 1. Then a + = (2k) + (2l + 1) = 2k +2k +1 = 2(k +l)+1 and a = (2k) (2l+1) = 4kl+2k = 2(2kl+k). Let m = k +l and n = 2kl+k. Then m, n Z as k, l, 1, 2 Z (axioms). Thus a+ = 2m+1, a = 2n where m, n Z, so a + is odd, a is even, and they have opposite parity in this case. Thus in oth cases, a and a + have opposite parity. QED 4
5 Chapter 3 handout page 8 prolem 9: Prove that if a and are real numers, where 0, then a = a. Proof: Assume that a and are real numers and 0. We will consider the following cases. CASE 1 : Assume that a 0 and > 0, so that a 0 (y axioms). Then a = a, =, and a = a = a. CASE 2 : Assume that a 0 and < 0, so that a 0 (y axioms). Then a = a, =, and a = a = a = a. CASE 3 : Assume that a < 0 and > 0, so that a < 0 (y axioms). Then a = a, =, and a = a = a = a. CASE 4 : Assume that a < 0 and < 0, so that a > 0 (y axioms). Then a = a, =, and a = a = a = a. Thus, for all possile cases, it has een proven that a = a. QED Chapter 3 handout page 8 prolem 10: Prove that for all real values of a and, a = a. Proof: Assume that a and are real numers. We will consider the following cases. CASE 1 : Assume that a 0 and 0, so that a 0 (y axioms). Then a = a, =, and a = a = a. CASE 2 : One of a, 0 and one of a, < 0. Without loss of generality, assume that a 0 and < 0, so that a 0 (y axioms). Then a = a, =, and a = a = a = a. CASE 3 : Assume that a < 0 and < 0, so that a > 0 (y axioms). Then a = a, =, and a = a = a = a. Thus, for all possile cases, it has een proven that a = a. QED 5
6 Page 10 Chapter 3 handout, prolem 2: Discuss the following proof: The difference etween any odd integer and any even integer is odd. Proof: Suppose n is any odd integer and m is any even integer. By definition of odd, n = 2k + 1 where k is an integer, and y definition of even m = 2k where k is an integer. Then n m = 2k + 1 2k = 1. But 1 is odd. Therefore, the difference etween any odd integer and any even integer is odd. Solution: This proof uses k to define oth m and n, which relates them. But they were supposed to e general integers. They should have used n = 2k + 1, m = 2l where k, l Z. Page 10 Chapter 3 handout, prolem 3: Discuss the following proof: The product of an even integer and an odd integer is even. Proof: Suppose m is an even integer and n is an odd integer. If m n is even, then y definition of even, there exists an integer r such that m n = 2r. Also, since m is even, there exists an integer p such that m = 2p, and since n is odd, there exists an integer q such that n = 2q + 1. Thus m n = (2p) (2q + 1) = 2r where r is an integer. Thus, y definition of even, m n is even, as was to e shown. Solution: This proof starts out y assuming that the product is even, which is what was supposed to e proved, not assumed! Page 10 Chapter 3 handout, prolem 4: Discuss the following proof: The sum of any two even integers equals 4k for some integer k. Proof: Suppose m, n are any two even integers. By definition of even, m = 2k for some integer k and n = 2k for some integer k. By sustitution, m + n = 2k + 2k = 4k. This is what was to e shown. Solution: Again, this proof uses the same variale to define m and n. (Note: This theorem is false: 2+4=6, which is not a multiple of 4.) Page 10 Chapter 3 handout, prolem 5: Discuss the following proof: If m + n is even, then m and n are even. Proof: Suppose m, n are even. Then m = 2k, n = 2l where k, l Z. Then m + n = 2k + 2l = 2(k + l). Let p = k + l. Note that p Z ecause k, l Z. Thus m + n = 2p where p Z, so m + n is even. Solution: This proof proved the converse of the statement, which is not logically equivalent to the original statement. Whereas the converse is true, the original statement is false (for example, 1+3=4 is even, ut neither 1 nor 3 is even.) 6
Section 2.1: Reduce Rational Expressions
CHAPTER Section.: Reduce Rational Expressions Section.: Reduce Rational Expressions Ojective: Reduce rational expressions y dividing out common factors. A rational expression is a quotient of polynomials.
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 informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
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 informationUNIT 5 QUADRATIC FUNCTIONS Lesson 2: Creating and Solving Quadratic Equations in One Variable Instruction
Lesson : Creating and Solving Quadratic Equations in One Variale Prerequisite Skills This lesson requires the use of the following skills: understanding real numers and complex numers understanding rational
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 informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationMath 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 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 informationCh 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 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 information(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 informationRED. Name: Math 290 Fall 2016 Sample Exam 3
RED Name: Math 290 Fall 2016 Sample Exam 3 Note that the first 10 questions are true false. Mark A for true, B for false. Questions 11 through 20 are multiple choice. Mark the correct answer on your ule
More informationMathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
More informationDirect Proof and Proof by Contrapositive
Dr. Nahid Sultana October 14, 2012 Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider x D, p(x) q(x). It can
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 informationMath 581 Problem Set 9
Math 581 Prolem Set 9 1. Let m and n e relatively prime positive integers. (a) Prove that Z/mnZ = Z/mZ Z/nZ as RINGS. (Hint: First Isomorphism Theorem) Proof: Define ϕz Z/mZ Z/nZ y ϕ(x) = ([x] m, [x] n
More information1. Define the following terms (1 point each): alternative hypothesis
1 1. Define the following terms (1 point each): alternative hypothesis One of three hypotheses indicating that the parameter is not zero; one states the parameter is not equal to zero, one states the parameter
More informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationMath 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 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 informationSection 1.2: Conditional Statements
Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More 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 informationPROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
More informationERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA)
ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA) General information Availale time: 2.5 hours (150 minutes).
More informationSchool of Business. Blank Page
Equations 5 The aim of this unit is to equip the learners with the concept of equations. The principal foci of this unit are degree of an equation, inequalities, quadratic equations, simultaneous linear
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 informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationMidterm: 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 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 informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More information(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 informationSolving Systems of Linear Equations Symbolically
" Solving Systems of Linear Equations Symolically Every day of the year, thousands of airline flights crisscross the United States to connect large and small cities. Each flight follows a plan filed with
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 informationDEFINITE INTEGRALS & NUMERIC INTEGRATION
DEFINITE INTEGRALS & NUMERIC INTEGRATION Calculus answers two very important questions. The first, how to find the instantaneous rate of change, we answered with our study of the derivative. We are now
More informationERASMUS UNIVERSITY ROTTERDAM
Information concerning Colloquium doctum Mathematics level 2 for International Business Administration (IBA) and International Bachelor Economics & Business Economics (IBEB) General information ERASMUS
More informationCopyrighted by Gabriel Tang B.Ed., B.Sc. Page 111.
Algera Chapter : Polnomial and Rational Functions Chapter : Polnomial and Rational Functions - Polnomial Functions and Their Graphs Polnomial Functions: - a function that consists of a polnomial epression
More information7-4 Field Calculations Using Ampere s Law
11/21/24 section 7_4 Field Calculations using Amperes Law lank 1/1 7-4 Field Calculations Using Ampere s Law Q: Using the iot-savart Law is even more difficult than using Coloum s law. Is there an easier
More informationFoundations 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 informationEgyptian Fractions: Part II
Egyptian Fractions: Part II Prepared y: Eli Jaffe Octoer 15, 2017 1 Will It End 1. Consider the following algorithm for eating some initial amount of cake. Step 1: Eat 1 of the remaining amount of cake.
More informationThe Final Exam is comprehensive but identifying the topics covered by it should be simple.
Math 10 Final Eam Study Guide The Final Eam is comprehensive ut identifying the topics covered y it should e simple. Use the previous eams as your primary reviewing tool! This document is to help provide
More information1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS
1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing
More informationStrategies for Proofs
G. Carl Evans University of Illinois Summer 2013 Today Practice with proofs Become familiar with various strategies for proofs Review: proving universal statements Claim: For any integer a, if a is odd,
More informationLecture 6 January 15, 2014
Advanced Graph Algorithms Jan-Apr 2014 Lecture 6 January 15, 2014 Lecturer: Saket Sourah Scrie: Prafullkumar P Tale 1 Overview In the last lecture we defined simple tree decomposition and stated that for
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationMath 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 informationPROOF WITHOUT WORDS MATH CIRCLE (BEGINNERS) 05/06/2012
PROOF WITHOUT WORDS MATH CIRCLE (BEGINNERS) 05/06/2012 If you ve been with us for a little while, you ve already seen some examples of proofs without words. Remember a proof is just an airtight argument
More informationQUADRATIC EQUATIONS EXPECTED BACKGROUND KNOWLEDGE
6 QUADRATIC EQUATIONS In this lesson, you will study aout quadratic equations. You will learn to identify quadratic equations from a collection of given equations and write them in standard form. You will
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationAnswers to the Exercises -- Chapter 1
Answers to the Exercises -- Chapter 1 SECTION 1 1. a Sentence, official notation ~~~P ~~P ~P P Sentence, informal notation ~Q ~R /\ ~Q ~R Q R c d e Not a sentence; it is impossile to construct "~ " Not
More informationIntroduction to Basic Proof Techniques Mathew A. Johnson
Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class,
More informationName CMSC203 Fall2008 Exam 2 Solution Key Show All Work!!! Page (16 points) Circle T if the corresponding statement is True or F if it is False.
Name CMSC203 Fall2008 Exam 2 Solution Key Show All Work!!! Page ( points) Circle T if the corresponding statement is True or F if it is False T F GCD(,0) = 0 T F For every recursive algorithm, there is
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 informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
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 informationThe Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line
Chapter 27: Inferences for Regression And so, there is one more thing which might vary one more thing aout which we might want to make some inference: the slope of the least squares regression line. The
More informationWorked solutions. 1 Algebra and functions 1: Manipulating algebraic expressions. Prior knowledge 1 page 2. Exercise 1.2A page 8. Exercise 1.
WORKED SOLUTIONS Worked solutions Algera and functions : Manipulating algeraic epressions Prior knowledge page a (a + ) a + c( d) c cd c e ( f g + eh) e f e g + e h d i( + j) + 7(k j) i + ij + 7k j e l(l
More informationQuiz 1, Mon CS 2050, Intro Discrete Math for Computer Science
Quiz 1, Mon 09-6-11 CS 050, Intro Discrete Math for Computer Science This quiz has 10 pages (including this cover page) and 5 Problems: Problems 1,, 3 and 4 are mandatory ( pages each.) Problem 5 is optional,
More informationSTUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form
More informationSec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs
Section 1.7 Sec$on Summary Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction 2 Proofs of Mathema$cal Statements
More informationFinQuiz Notes
Reading 9 A time series is any series of data that varies over time e.g. the quarterly sales for a company during the past five years or daily returns of a security. When assumptions of the regression
More informationMath 3000 Section 003 Intro to Abstract Math Midterm 1
Math 3000 Section 003 Intro to Abstract Math Midterm 1 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Name: Points: Read all problems carefully and write
More informationLogarithms. For example:
Math Review Summation Formulas Let >, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant ± ± g f g f ) ) )) ) S: separate summed terms C C ) 6 ) ) Computer
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 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 informationPolynomial Degree and Finite Differences
CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial
More informationAt first numbers were used only for counting, and 1, 2, 3,... were all that was needed. These are called positive integers.
1 Numers One thread in the history of mathematics has een the extension of what is meant y a numer. This has led to the invention of new symols and techniques of calculation. When you have completed this
More informationa b a b ab b b b Math 154B Elementary Algebra Spring 2012
Math 154B Elementar Algera Spring 01 Stud Guide for Eam 4 Eam 4 is scheduled for Thursda, Ma rd. You ma use a " 5" note card (oth sides) and a scientific calculator. You are epected to know (or have written
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationLet N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1)
Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: k Cf ( k) C k S: factor out constant f ( k) k ( f ( k) ± g( k)) k S: separate summed terms f ( k) ± k g(
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationProofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.
Section 1.7 Proofs of Mathema-cal Statements A proof is a valid argument that establishes the truth of a statement. Terminology A theorem is a statement that can be shown to be true using: definitions
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationIn 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 informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationJWKB QUANTIZATION CONDITION. exp ± i x. wiggly-variable k(x) Logical Structure of pages 6-11 to 6-14 (not covered in lecture):
7-1 JWKB QUANTIZATION CONDITION Last time: ( ) i 3 1. V ( ) = α φ( p) = Nep Ep p 6m hα ψ( ) = Ai( z) zeroes of Ai, Ai tales of Ai (and Bi) asymptotic forms far from turning points 2. Semi-Classical Approimation
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationMath Analysis CP WS 4.X- Section Review A
Math Analysis CP WS 4.X- Section 4.-4.4 Review Complete each question without the use of a graphing calculator.. Compare the meaning of the words: roots, zeros and factors.. Determine whether - is a root
More informationHigher. Polynomials and Quadratics. Polynomials and Quadratics 1
Higher Mathematics Polnomials and Quadratics Contents Polnomials and Quadratics 1 1 Quadratics EF 1 The Discriminant EF Completing the Square EF Sketching Paraolas EF 7 5 Determining the Equation of a
More informationMCS 115 Exam 2 Solutions Apr 26, 2018
MCS 11 Exam Solutions Apr 6, 018 1 (10 pts) Suppose you have an infinitely large arrel and a pile of infinitely many ping-pong alls, laeled with the positive integers 1,,3,, much like in the ping-pong
More information1. (16 points) Circle T if the corresponding statement is True or F if it is False.
Name Solution Key Show All Work!!! Page 1 1. (16 points) Circle T if the corresponding statement is True or F if it is False. T F The sequence {1, 1, 1, 1, 1, 1...} is an example of an Alternating sequence.
More informationCHAPTER 5. Linear Operators, Span, Linear Independence, Basis Sets, and Dimension
A SERIES OF CLASS NOTES TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS LINEAR CLASS NOTES: A COLLECTION OF HANDOUTS FOR REVIEW AND PREVIEW OF LINEAR THEORY
More informationThe first property listed above is an incredibly useful tool in divisibility problems. We ll prove that it holds below.
1 Divisiility Definition 1 We say an integer is divisile y a nonzero integer a denoted a - read as a divides if there is an integer n such that = an If no such n exists, we say is not divisile y a denoted
More informationMeaning of Proof Methods of Proof
Mathematical Proof Meaning of Proof Methods of Proof 1 Dr. Priya Mathew SJCE Mysore Mathematics Education 4/7/2016 2 Introduction Proposition: Proposition or a Statement is a grammatically correct declarative
More informationRobot Position from Wheel Odometry
Root Position from Wheel Odometry Christopher Marshall 26 Fe 2008 Astract This document develops equations of motion for root position as a function of the distance traveled y each wheel as a function
More informationIntroduction to proofs. Niloufar Shafiei
Introduction to proofs Niloufar Shafiei proofs Proofs are essential in mathematics and computer science. Some applications of proof methods Proving mathematical theorems Designing algorithms and proving
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 2 NOVEMBER 2016
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY NOVEMBER 06 Mark Scheme: Each part of Question is worth 4 marks which are awarded solely for the correct answer.
More informationEgyptian Fractions: Part II
Egyptian Fractions: Part II Prepared y: Eli Jaffe Octoer 15, 2017 1 Will It End 1. Consider the following algorithm for eating some initial amount of cake. Step 1: Eat 1 of the remaining amount of cake.
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 informationCS173 Lecture B, September 10, 2015
CS173 Lecture B, September 10, 2015 Tandy Warnow September 11, 2015 CS 173, Lecture B September 10, 2015 Tandy Warnow Examlet Today Four problems: One induction proof One problem on simplifying a logical
More informationChapter III. Basic Proof Techniques. Proving the obvious has never been easy. Marty Rubin
Chapter III Basic Proof Techniques Proving the obvious has never been easy. Marty Rubin The last two chapters were an introduction to the language of mathematics. Knowing the definitions and concepts of
More informationSTEP Support Programme. Hints and Partial Solutions for Assignment 2
STEP Support Programme Hints and Partial Solutions for Assignment 2 Warm-up 1 (i) You could either expand the rackets and then factorise, or use the difference of two squares to get [(2x 3) + (x 1)][(2x
More informationProof Techniques 1. Math Camp n = (1 = n) + (2 + (n 1)) ( n 1. = (n + 1) + (n + 1) (n + 1) + n + 1.
Math Camp 1 Prove the following by direct proof. Proof Techniques 1 Math Camp 01 Take any n N, then n is either even or odd. Suppose n is even n m for some m n(n + 1) m(n + 1) n(n + 1) is even. Suppose
More informationProblem Set 2 Solutions Math 311, Spring 2016
Problem Set 2 Solutions Math 311, Spring 2016 Directions: Name: You must complete (at least) a total of 8 problems, some of which have multiple parts. You may complete more than 8 problems, for possible
More information