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

Size: px
Start display at page:

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

Transcription

1 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 3. exercise 1.23 (compute the intersection of two sets) Question 4. exercise 1.24 (compute the union, then the intersection of two sets) Question 5. Give a justification of the claim that N Z. Question 6. Give a justification of the claim that Q Z. Question 7. For the following three questions, answer true or false and justify your answer with a clearly written explanation. Let E be the subset of R 2 that is defined as (i) is the point (1, 3) an element of E? (ii) is the point (1, 5) an element of E? (iii) is the point (0, 0) an element of E? E := {(x, y) R 2 : y x 2 }. Question 8. Let X = {0, 1, 2, 3, 4} and Y = {0, 2, 4}. 1. How many ordered pairs are in X Y, Y X and Y X Y respectively? 2. List the elements of the set {(a, b, c) X Y X a < b < c}. Question 9. For A = {x R : x 1 2} and B = {y R : y 4 2}, give a geometric description of the points in the xy-plane belonging to A B. MSU 1 Due: 5/19/2016

2 MTH299 - Homework 2 Question 1. exercise 1.33 Question 2. exercise 1.34 (i) Question 3. exercise 1.34 (ii) Question 4. exercise 1.34 (iii). Use X = {1, 2, 3, 4,..., 10}, A = {2, 4, 6, 8, 10}, B = {1, 2, 3, 4, 5}, C = {4, 5, 6, 7, 8}. Question 5. exercise 1.34 (iv) Question 6. Define the set, E = {x R : x 2 {1, 2, 3, 7} }. (i) Is E N? Justify your answer. (ii) Is E Z? Justify your answer. Question 7. exercise (i), parts (a) (d). Please note that a function is bijective if it is both injective and surjective. Bijective functions always have inverses, and the inverse is the unique function, f 1 (x), which satisfies both f(f 1 (y)) = y for all y in the range of f (which will be the domain of f 1 ) as well as f 1 (f(x)) = x for all x in the domain of f. You have done this in calculus just think of e x and ln(y) or x 3 and y 1/3. Question 8. Define the operation f(p)(x) := x 0 p(t)dt. Does f define a function from P 4 to P 4? Justify your answer. Does f define a function from P 3 to P 4? Justify your answer. Is f an injective function from P 3 to P 4? Justify your answer. Is f a surjective function from P 3 to P 4? Justify your answer. Question 9. Assume that f(x) = e x is the natural exponential function from calculus and that you know (i) f(x) > 0 for all x R (ii) f(x + y) = f(x)f(y) for all x, y R (iii) f (0) > 0 Use the limit definition of the derivative plus items (i), (ii), and (iii) to carefully and completely justify the following claim that f (x) > 0 for all x R. Please assume that you and your audience are familiar with the limit rules that you learned in MTH 132. MSU 1 Due: 5/24/2016

3 MTH299 - Homework 3 Question 1. There are eight different functions f : {a, b, c} {0, 1}. List them all. Diagrams will suffice. Question 2. Show that the function f : R 2 R 2 defined by the formula f(x, y) = ((x 2 + 1)y, x 3 ) is bijective. Then find its inverse. Carefully justify that your answer does indeed yield the inverse function. Question 3. exercise 5.3 (i) Question 4. exercise 5.3 (ii) Question 5. exercise 5.3 (iii) Question 6. exercise 5.3 (iv) (note, you will skip 5.3(v)) Question 7. exercise 5.3 (vi) Question 8. exercise 6.2 (all) Question 9. exercise 6.11 (i) Question 10. exercise 6.11 (ii) Question 11. exercise 6.11 (iii) Question 12. exercise 6.11 (iv) MSU 1 Due: 5/26/2016

4 MTH299 - Homework 4 Question 1. Let A = {x x R and x > 0}. The function f : A R is defined by f(x) = x 2 4x + 5. What is the largest codomain so that f is surjective? Question 2. Let A = {x x R and x 2} and B = {x x R and x 1} and the function f : A B is defined by f(x) = x 2 4x + 5. If there exists an inverse function f 1, then find the inverse function of the function f and specify the domain and codomain of the inverse function. Carefully justify that your answer does indeed yield the inverse function. Question 3. exercise 6.11 (v) Question 4. exercise 7.7 (i) Question 5. exercise 7.7 (ii) Question 6. exercise 7.7 (iii) Question 7. exercise 7.7 (iv) Question 8. exercise 7.7 (v) Question 9. Let us define the following sets: A 0 = {z Z : z = 3k, for some k Z}, A 1 = {z Z : z = 3k + 1, for some k Z}, A 2 = {z Z : z = 3k + 2, for some k Z}. (i) Which set, if any, do each of the integers in the set {3, 5, 2, 8, 24, 19} belong to? (ii) Does Z = A 0 A 1 A 2. Carefully justify your answer. (iii) Show that if a, b A 0, then ab A 0. Carefully justify your answer. (iv) Show that a A 0, and b A 1, what can you say about a + b and ab? Are they in any of these sets, A 0, A 1, or A 2? Carefully justify your answers. Question 10. Is the product of two odd integers odd or even? Justify your answer. Question 11. Consider the statements: P : 2 is rational. Q : 2 3 is rational. R : 3 is rational. Write each of the following statements in words and indicate whether the statement is true or false. (a) (P Q) R (b) (P Q) ( R) (c) (( P ) Q) R (d) (P Q) ( R) MSU 1 Due: 5/31/2016

5 MTH299 - Homework 5 Question 1. exercise 8.13 (i) Question 2. exercise 8.13 (i) Question 3. exercise 8.13 (ii) Question 4. exercise 8.13 (iii) Question 5. exercise 8.13 (iv) Question 6. exercise 8.13 (v) Question 7. exercise 9.9 (i) Question 8. exercise 9.9 (ii) Question 9. exercise 9.9 (iii) Question 10. exercise 9.9 (iv) Question 11. Define the function T : P 2 P 2 via the assignment T (f)(x) := f(x + 3) 6, for all x R. Carefully justify that T is both an injective and surjective function. (Note, the input to T is a function, and the output of T is another function. Therefore, in order to understand what is the new function, T (f), you must describe what the function T (f) does to its input variables. Since T (f) P 2, we know it is a polynomial of degree at most 2, hence a function from R R.) MSU 1 Due: 6/2/2016

6 MTH299 - Homework 6 Question 1. Exercise (i) Question 2. Exercise (ii), (a) (d) Question 3. Exercise (ii), (e) (h) Question 4. Exercise (ii), part (i) Question 5. Exercise (i) Question 6. Exercise (ii) Question 7. Exercise (iii) (b), (c), (f) (you do not need to turn in the other lettered questions in (iii)) Question 8. Exercise (iv) (a), (b) Question 9. Exercise (iv) (c), (d) Question 10. Let D = {E N : E contains a finite number of elements}. Define a function, c : D N, via the assignment c(e) = E. (Recall that the cardinality, E, is defined in the text.) Answer the questions about the function c. (i) Let B = {x N : 107 < x < 136 and x is divisible by 7}. Evaluate c(b). (ii) Let H = {x N : x is a multiple of 10}. Can you evaluate c(h)? (iii) Prove that c is not an injective function. (iv) Prove that c is a surjective function. Question 11. Let the function, I : P 3 R, be defined via the assignment rule I(p) := (i) is I an injective function? Justify your answer. (ii) is I a surjective function? Justify your answer. 1 0 p(x)dx. MSU 1 Due: 6/7/2016

7 MTH299 - Homework 7 Question 1. Define the sets A = {q P 2 : q(x) 0 for all x R}, B = {p P 2 : p(x) = a(x x 0 ) 2 + b, where a, b, x 0 R, and a 0, b 0}. Prove that A = B. Question 2. Let f : R Z be the integer floor function f(x) = x := max{z Z : z x}, that is to say that f(x) is the unique integer which is the largest integer that is smaller than or equal to x. (i) sketch a picture of the graph of f. (ii) evaluate f(550.1), f( 64.7), f(π), f( e). (iii) prove that f is a surjective function from R Z. (iv) prove that f is not an injective function from R Z. Question 3. Define the set U + = {(x 1, x 2 ) R 2 : x 2 0} R 2. Define the function h : R 2 U + via the assignment h(x 1, x 2 ) = (x 1, x x 2 2). Prove that h is not an injective function. Prove that h is a surjective function. Is h a bijective function? Does an inverse function exist for h? MSU 1 Due: 6/9/2016

8 MTH299 - Homework 8 Question 1. Define the function, f : R R via the assignment f(x) = (x 5) 2 + 9, and define the set E as Prove that the set E is bounded. E := {x R : f(x) 5}. Question 2. Let A r = ( r, r). What is r I A r and r I A r, where I = {1, 2, 10}? Repeat with I = {x R : x > 0}. Question 3. Define the set A = [ 5, 5] {x R : sin((π/2)x) = 0}. Prove that A = { 4, 2, 0, 2, 4}. (See p of the text on the method by which you show two sets are equal, especially Proposition ) Question 4. Come up with a simpler expression for the following sets i) P = ( n=1 5 1, n n). ii) Q = [ n=1 5 1, n n]. iii) R = [ 1 n=1, 1]. n Question 5. Determine which of the following sets are open: i) A 0 = (0, 1). ii) A 2 = ( 10, 5) (3, 23). iii) A 4 = (, 0]. If you claim a set is not open, then give an example of an element of the set which fails the requirement of the definition of open. Question 6. Prove that the sequence { n + 1 n} is convergent. Question 7. Define the set Prove that E is an open set. E = (2i, 2i + 1) R. i=1,2 MSU 1 Due: 6/14/2016

9 MTH299 - Homework 9 Question 1. Assume that E R. Let A be the statement E is not an open set. Let B be the statement E is a closed set. Give an example of E which demonstrates that the implication A = B is FALSE. (This is a very important thing to keep in mind when you go on to further analysis and topology courses!!!) Question 2. Guess the value lim n a n = L, and prove that {a n } n N converges to L in the case that a n = sin(n) 20n + 1. Question 3. Write down the negated definition of convergent. That is, write down what it means when a sequence is not convergent. Question 4. Prove that for a k = ln(k), {a k } k N is not a convergent sequence. (You will need to recall from calculus that ln is the natural logarithm, and it is the unique function such that e ln(x) = x and ln(e x ) = x x R. Furthermore, you will need to use the fact that e x is an increasing function. See the supplementary material in section 4 for a couple of things about increasing functions. ) Question 5. Write down bounded sequence, {c n } n N, such that {c n } n N is not convergent. Try to prove that it is not convergent (this is actually harder than it sounds!). Question 6. Prove the following implication: If x, y R and 0 < x < y, then (x + y) x + y. (Hint... it may be very helpful to try a proof by contradiction.) Question 7. Use a contradiction argument to justify that [n, n + 2] = is a true statement. Question 8 (BONUS AND CHALLENGE!!!). Define the set E as E = {1, 12, 13, 14 },... = n N{ 1 n }. n Z Prove that E is not open. Also prove that E is not closed. MSU 1 Due: 6/16/2016

10 MTH299 - Homework 10 Question 1. Prove that P 4 is a vector space over R. Question 2. Define the set V = {x R 2 : x 2 = 1x 2 1}. Sketch a picture of the set V inside of the plane, R 2. Is V a vector space over the scalar field R? Use the usual addition structure given to you by R 2. Justify your answer! Question 3. Prove that the function L : P 4 P 4, defined via L(p)(x) = p (x) is a linear function. (Go either to your old calculus book or to wikipedia to look up the properties of the derivative to find the things you will need to show that this is a linear function.) Question 4. Define the function f : N N, with f(n) = n 2 + n + 1. Use the following two different methods to prove that f is injective. (i) By contradiction. Suppose it is not injective and find a contradiction. I would suggest a good first line is Assume that n m, n, m N, and f(n) = f(m). We note that it is OK to assume, without loss of generality, that m < n. Then continue along and find a contradiction. (ii) By proving that f is in fact a strictly increasing function. Also prove a separate deduction that any function which is strictly increasing MUST ALSO be injective. The combination of these two steps would conclude your argument. Question 5. f(1) = 2, f(n + 1) = (3 + f(n)). Prove that f(n) < 2.4 for all n 1. You may use a calculator to check what are the values of some square roots. Question 6. Prove the following proposition: For each n N, it follows that 2 n 2 n+1 2 n 1 1. Question 7. Prove that there is no positive integer, x, that satisfies (Hint... try a proof by contradiction.) 2x < x 2 < 3x. MSU 1 Due: 6/21/2016

11 MTH299 - Homework 11 Question 1. Define the function L : R R as L(x) = x 2. Is L a linear function? Justify your answer!!! Question 2. Let L : R R be defined via L(x) = ax + b, where a, b R. Is L a linear function? (Note!!!! Don t confuse what you may have called the graph of a line with L being linear. Check the definitions of linear map.) Question 3. Assume that V and W are both vector spaces over R and that L : V W is a linear map. Define the set N = {v V : L(v) = 0} V. Prove that N is itself another vector space. Please state that you understand that N V, and that you will accordingly use definition 5.4 and proposition 5.5 instead of checking all 10 properties in definition 5.1. Question 4. Suppose L : V W is a linear map. Prove that L is injective if and only if {v V : Lv = 0} = {0}. Hint: Use the fact that you know that L(v + w) = L(v) + L(w) for all v, w V. ( 3 10 Question 5. Define the matrix, A = c 0 as ) ( ) x1 L(x) = Ax = ), and define the map L : R 2 R 2 via matrix multiplication ( 3 10 c 0 Prove that L is injective if and only if c 0. (Please utilize the results in previous HW questions to help support your justification.) Question 6. For each of the following L, answer yes or no, and briefly justify your answer: (i) Is L : P 4 R, with L(p) = p (1), a linear function? (ii) Is L : P 4 R, with L(p) = p (0), a linear function? (iii) Is L : P 4 R, with L(p) = 1 p(x)dx, a linear function? 0 (iv) Is L : P 4 P 5, with L(p)(x) = x p(s)ds, a linear function? 0 (v) Is L : P 4 P 5, with L(p)(x) = 7 + x p(s)ds, a linear function? 0 Question 7. Assume that you already know that D(p)(x) = p (x) and I(p)(x) = x p(s)ds are linear 0 functions from P 4 P 5. Use a previous question to deduce that D is not injective and that I is injective. Question 8. V = {p P 2 Is V a vector space over R? : x R p(x) = ax 2 + bx + c, with c > 0, and a, b, c R}. Question 9. Let X be a finite set with n elements. Show that X has 2 n distinct subsets. Question 10. Of the following two statements, one is true and one is false. Determine which one is which, prove why the true one is true, and give an example that shows the false one is false. (i) x R, y R, such that y 2 3x + 5. (ii) y R, x R, such that y 2 3x + 5. x 2. MSU 1 Due: 6/23/2016

12 MTH299 - Homework 12 Question 1. Answer true or false and completely justify. If p is prime, then p + 2 is prime. Question 2. Prove that if a divides b and a divides c, then a divides (b + c). Question 3. Answer true or false, and completely justify. If a, b N and a < b, then b is divisible by a. Question 4. Answer true or false, and completely justify. If a divides b and b divides c, then a divides c. Question 5. Answer true or false, and completely justify. If a divides b and b divides a, then a = b. Question 6. Answer true or false, and completely justify. If a divides (b + c), then a divides b and a divides c. Question 7. Prove that if x, y Z are consecutive integers, then xy is even. Question 8. Prove that if z Z, x 1 mod z, and y 1 mod z, then xy 1 mod z. Question 9. Prove that there exists an integer, x, such that x 0 mod 4, but x 2 0 mod 4. Question 10. Prove there are no integers, x, y Z, such that x + y = 100 and gcd(x, y) = 3. Question 11. Prove that there is no integer, x Z, such that if y 2 mod 4 then xy 1 mod 4. Question 12. Prove that if n N, then n 4 + 2n 3 + n 2 is divisible by 4. Question 13. Illustrate the division algorithm for the two numbers x = 1011, y = 37. Question 14. Show all the steps of the Euclidean Algorithm (p.200 of the text) to find the gcd of x = 525 and 770. Question 15. Show that n 2 1 is divisible by 8 when n is an odd natural number. Question 16 (Challenge and Bonus). An integer n > 1 has the properties that n (35m + 26) and n (7m + 3) for some integer m. What is n? MSU 1 Due: 6/28/2016

MTH 299 In Class and Recitation Problems SUMMER 2016

MTH 299 In Class and Recitation Problems SUMMER 2016 MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation

More information

About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018

About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018 About This Document This is the examples document for MTH 299. Basically it is a loosely organized universe of questions (examples) that we think are interesting, helpful, useful for practice, and serve

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

Supplementary Material for MTH 299 Online Edition

Supplementary Material for MTH 299 Online Edition Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think

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

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

More information

SETS AND FUNCTIONS JOSHUA BALLEW

SETS AND FUNCTIONS JOSHUA BALLEW SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,

More information

MATH 3300 Test 1. Name: Student Id:

MATH 3300 Test 1. Name: Student Id: Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

The final is cumulative, but with more emphasis on chapters 3 and 4. There will be two parts.

The final is cumulative, but with more emphasis on chapters 3 and 4. There will be two parts. Math 141 Review for Final The final is cumulative, but with more emphasis on chapters 3 and 4. There will be two parts. Part 1 (no calculator) graphing (polynomial, rational, linear, exponential, and logarithmic

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant). Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

Math 5a Reading Assignments for Sections

Math 5a Reading Assignments for Sections Math 5a Reading Assignments for Sections 4.1 4.5 Due Dates for Reading Assignments Note: There will be a very short online reading quiz (WebWork) on each reading assignment due one hour before class on

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

Math 110, Spring 2015: Midterm Solutions

Math 110, Spring 2015: Midterm Solutions Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make

More information

Cartesian Products and Relations

Cartesian Products and Relations Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) : (a A) and (b B)}. The following points are worth special

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 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

Homework 12; Due Monday, 4/9/2018

Homework 12; Due Monday, 4/9/2018 Homework 2; Due Monday, 4/9/28 Answer-Only Questions Credit based solely on the answer Question For each of the following relations, determine whether each one is symmetric, transitive, or refleive If

More information

Solutions to Tutorial for Week 4

Solutions to Tutorial for Week 4 The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

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

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable?

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable? Name: Instructions. Show all work in the space provided. Indicate clearly if you continue on the back side, and write your name at the top of the scratch sheet if you will turn it in for grading. No books

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

Selected problems from past exams

Selected problems from past exams Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence

More information

Fundamentals of Pure Mathematics - Problem Sheet

Fundamentals of Pure Mathematics - Problem Sheet Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions

More 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

Weekly Activities Ma 110

Weekly Activities Ma 110 Weekly Activities Ma 110 Fall 2008 As of October 27, 2008 We give detailed suggestions of what to learn during each week. This includes a reading assignment as well as a brief description of the main points

More information

Solutions to Practice Final

Solutions to Practice Final s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (

More information

Name: Mathematics 1C03

Name: Mathematics 1C03 Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam

More information

MAS114: Solutions to Exercises

MAS114: Solutions to Exercises MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

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

MATH 201 Solutions: TEST 3-A (in class)

MATH 201 Solutions: TEST 3-A (in class) MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define

More information

FOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling

FOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling FOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling Note: You are expected to spend 3-4 hours per week working on this course outside of the lectures and tutorials. In this time you are expected to review

More information

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

1.2 Functions What is a Function? 1.2. FUNCTIONS 11

1.2 Functions What is a Function? 1.2. FUNCTIONS 11 1.2. FUNCTIONS 11 1.2 Functions 1.2.1 What is a Function? In this section, we only consider functions of one variable. Loosely speaking, a function is a special relation which exists between two variables.

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

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

x x 1 x 2 + x 2 1 > 0. HW5. Text defines:

x x 1 x 2 + x 2 1 > 0. HW5. Text defines: Lecture 15: Last time: MVT. Special case: Rolle s Theorem (when f(a) = f(b)). Recall: Defn: Let f be defined on an interval I. f is increasing (or strictly increasing) if whenever x 1, x 2 I and x 2 >

More information

Week Some Warm-up Questions

Week Some Warm-up Questions 1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after

More information

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S. Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

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

Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1

Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 22M:132 Fall 07 J. Simon Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 Chapter 1 contains material on sets, functions, relations, and cardinality that

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

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

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even. 1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and

More information

1. Continuous Functions between Euclidean spaces

1. Continuous Functions between Euclidean spaces Math 441 Topology Fall 2012 Metric Spaces by John M. Lee This handout should be read between Chapters 1 and 2 of the text. It incorporates material from notes originally prepared by Steve Mitchell and

More information

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition. Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the

More information

1 Functions, Graphs and Limits

1 Functions, Graphs and Limits 1 Functions, Graphs and Limits 1.1 The Cartesian Plane In this course we will be dealing a lot with the Cartesian plane (also called the xy-plane), so this section should serve as a review of it and its

More information

( 3) ( ) ( ) ( ) ( ) ( )

( 3) ( ) ( ) ( ) ( ) ( ) 81 Instruction: Determining the Possible Rational Roots using the Rational Root Theorem Consider the theorem stated below. Rational Root Theorem: If the rational number b / c, in lowest terms, is a root

More information

Sets, Functions and Relations

Sets, Functions and Relations Chapter 2 Sets, Functions and Relations A set is any collection of distinct objects. Here is some notation for some special sets of numbers: Z denotes the set of integers (whole numbers), that is, Z =

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Notes on generating functions in automata theory

Notes on generating functions in automata theory Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is

More information

1 The distributive law

1 The distributive law THINGS TO KNOW BEFORE GOING INTO DISCRETE MATHEMATICS The distributive law The distributive law is this: a(b + c) = ab + bc This can be generalized to any number of terms between parenthesis; for instance:

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

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

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

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014 Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some

More information

Notes on Quadratic Extension Fields

Notes on Quadratic Extension Fields Notes on Quadratic Extension Fields 1 Standing notation Q denotes the field of rational numbers. R denotes the field of real numbers. F always denotes a subfield of R. The symbol k is always a positive

More information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

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

UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS

UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS 1. Relations Recall the concept of a function f from a source set X to a target set Y. It is a rule for mapping

More information

Use the Rational Zero Theorem to list all the possible rational zeros of the following polynomials. (1-2) 4 3 2

Use the Rational Zero Theorem to list all the possible rational zeros of the following polynomials. (1-2) 4 3 2 Name: Math 114 Activity 1(Due by EOC Apr. 17) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own. Please

More information

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions Solutions to 2015 Entrance Examination for BSc Programmes at CMI Part A Solutions 1. Ten people sitting around a circular table decide to donate some money for charity. You are told that the amount donated

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

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

MATH PRACTICE EXAM 1 SOLUTIONS

MATH PRACTICE EXAM 1 SOLUTIONS MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is

More information

NOTES ON DIOPHANTINE APPROXIMATION

NOTES ON DIOPHANTINE APPROXIMATION NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics

More information

Part V. Chapter 19. Congruence of integers

Part V. Chapter 19. Congruence of integers Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277

More information

Solutions to Math 41 First Exam October 18, 2012

Solutions to Math 41 First Exam October 18, 2012 Solutions to Math 4 First Exam October 8, 202. (2 points) Find each of the following its, with justification. If the it does not exist, explain why. If there is an infinite it, then explain whether it

More information

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

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

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

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

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating

More information

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...

More information

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended

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

a factors The exponential 0 is a special case. If b is any nonzero real number, then

a factors The exponential 0 is a special case. If b is any nonzero real number, then 0.1 Exponents The expression x a is an exponential expression with base x and exponent a. If the exponent a is a positive integer, then the expression is simply notation that counts how many times the

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule Notations I will use the symbols N, Z, Q and R to denote the set of all natural numbers, the set of all integers, the

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

7.1. Calculus of inverse functions. Text Section 7.1 Exercise:

7.1. Calculus of inverse functions. Text Section 7.1 Exercise: Contents 7. Inverse functions 1 7.1. Calculus of inverse functions 2 7.2. Derivatives of exponential function 4 7.3. Logarithmic function 6 7.4. Derivatives of logarithmic functions 7 7.5. Exponential

More information

Equations and Inequalities

Equations and Inequalities Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:

More information

REVIEW FOR THIRD 3200 MIDTERM

REVIEW FOR THIRD 3200 MIDTERM REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =

More information

For all For every For each For any There exists at least one There exists There is Some

For all For every For each For any There exists at least one There exists There is Some Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

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 13 FINAL EXAM SOLUTIONS

MATH 13 FINAL EXAM SOLUTIONS MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F

More information

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 113 Winter 2013 Prof. Church Midterm Solutions Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis

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

Introduction to Proofs

Introduction to Proofs Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions

More information