Math 300: Final Exam Practice Solutions
|
|
- Garey Wilson
- 6 years ago
- Views:
Transcription
1 Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a i Z such that p(α) = 0} Show that A is countable (Elements of A are called algebraic numbers) The set of transcendental numbers is the set R A Show that the set of transcendental numbers is uncountable Remark To show that A is countable we must either: construct an explicit bijection Z + A, a surjection Z + A, an injection A Z +, find a way to list the elements of A, show that A is a subset of a countable set, or (as will be applicable here) show that A is a countable union of countable sets For relatively complicated sets like A, this last technique is often useful The key is to build up: how many polynomials with integer coefficients of a fixed degree are there, then how many such polynomials are there if we allow any degree, and finally how much roots does each such polynomial have? Proof The first part of this, showing that A is countable, is on the Worked Examples handout so check the proof there If R A were countable, then A (R A) = R would be countable since it would be the union of two countable sets Since R is uncountable, R A must be uncountable (Side question which has nothing to do with the final: do you know any examples of transcendental numbers?) 2 For a set A, A denotes the set of sequences of elements of A: A = {(a 1, a 2, a 3,, a n, ) a i A for all i} (a) (Tricky) Show that R has the same cardinality as R (b) Show directly, without quoting any theorem in the book, that Z is uncountable Remark Part (a) requires the construction of a bijection between R and R As is often the case when dealing with R, it might be easier to focus on numbers between 0 and 1 first and then use the fact that (0, 1) and R have the same cardinality Constructing a bijection (0, 1) (0, 1) is tricky (too tricky for the final), but uses an idea similar to the splicing technique we ve seen for showing that R 2 and R have the same cardinality (This is on the Worked Examples handout) The splicing in this case though is tougher: given an infinite number of decimal expansions, we have to construct a single real number which encodes all of those digits Arranging this all in a table suggests that we can mimic the technique used to show that Q is countable For part (b) we should use Cantor s diagonalization argument, which is a standard tool for showing directly that sets are uncountable The same technique shows up in Problem 5 Proof (a) First we define a bijection (0, 1) (0, 1) Let (x 1, x 2, x 3, ) be an element of (0, 1), so each x i is a real number between 0 and 1 As such, we can write x i according to its decimal expansion: x 1 = x 11 x 12 x 13 x 2 = x 21 x 22 x 23 x 3 = x 31 x 32 x 33
2 We construct out of this a number in (0, 1) as follows: start with 0x 11, then append the digits x 21 and x 12, then x 31, x 22, and x 13, and so on following the successive diagonals moving from lower-left to upper-right Define the function f : (0, 1) (0, 1) by sending the sequence (x 1, x 2, x 3, ) to this number: f(x 1, x 2, x 3, ) = 0x 11 x 21 x 12 x 31 x 22 x 13 This function is bijective since it is invertible with inverse f 1 : (0, 1) (0, 1) defined as follows Take y (0, 1), write it according to its decimal expansion y = 0y 1 y 2 y 3, and then unwind the process from above to create a sequence of numbers: x 1 := 0y 1 y 3 y 6 y 10 x 2 := 0y 2 y 5 y 9 x 3 := 0y 4 y 8 x 4 := 0y 7 where we list y 1 in the upper-left corner, then y 2 and y 3 along the next diagonal down, then y 4, y 5, y 6 along the next diagonal down, and so on The inverse of f is f 1 (y) = (x 1, x 2, x 3, ) Since (0, 1) and R have the same cardinality, there exists a bijection g : (0, 1) R Also, as a result of Exercise 619 in the book (or a generalization of this with a similar proof), (0, 1) and R have the same cardinality so there exists a bijection h : R (0, 1) The composition gfh is then a bijection R R, so R and R have the same cardinality as claimed (b) Take any list of elements of Z : (n 11, n 12, n 13, ) (n 21, n 22, n 23, ) (n 31, n 32, n 33, ) Define an element (m 1, m 2, m 3, ) of Z simply by choosing for m i an integer different from n ii This element is then not in the list above since it differs from the kth element of this list in the kth location Hence any listing of elements of Z cannot possibly contain all elements of Z, so Z is uncountable 3 Consider the relation between sets defined by: A B if A and B have the same cardinality (a) Show that is an equivalence relation (b) Determine which of the following sets are equivalent to which No justification is needed P(Z), Q Q, P(P({ })), F (R), P(Z Z Z), (0, 1) Q, P(P(Z + )), R 2, F ({2, 3}) Remark This is a mixture of older material and newer material In part (a) we must as usual show that R is reflexive, symmetric, and transitive This amounts to using properties of bijective functions In part (b) we use facts about cardinality we ve already built up, and is a good example of how to compare cardinalities Solution (a) For any set A, the identity function i A : A A sending anything in A to itself is bijective so A has the same cardinality as A Thus ARA so R is reflexive Now suppose that ARB Then A and B have the same cardinality, meaning there exists a bijection f : A B Then f 1 : B A is also bijective, so B and A have the same cardinality Hence BRA so R is symmetric 2
3 Finally, suppose that ARB and BRC Then A and B have the same cardinality so there exists a bijection f : A B, and B and C have the same cardinality so there exists a bijection g : B C The composition gf : A C is then also bijective, so A and C have the same cardinality Thus ARC so R is transitive and we conclude that R is an equivalence relation (b) No justification is needed, but we give some anyway Two sets are in the same equivalence classes when they have the same cardinality P(P({ })) and F ({2, 3}) both have 4 elements and thus have the same cardinality These are the only finite sets in this list Q Q and (0, 1) Q are both countably infinite, and so have the same cardinality Since Z Z Z and Z have the same cardinality, their power sets have the same cardinality, which is the same as the cardinality of R Since R 2 and R also have the same cardinality, we get that P(Z), P(Z Z Z), and R 2 all have the same cardinality Finally, an example on the Worked Examples handout shows that F (R) and P(R) have the same cardinality Since R and P(Z + ) have the same cardinality, their power sets do as well so we get that F (R) and P(P(Z + )) have the same cardinality Notice that in none of these did we construct any explicit bijections, but rather used cardinality facts we ve previously built up 4 Show that Z Z + and E O have the same cardinality, where E is the set of even integers and O the set of odd integers, by constructing an explicit bijection between them Remark Since an explicit bijection is what is being asked for, an explicit bijection is what we should give This will require giving a candidate for the bijection f : Z Z + E O and then showing that f is indeed bijective To do all this we use previous bijections we ve seen on homework or in class involving integers, even integers, and odd integers Also, using the same kind of idea as in Exercise 619 in the book, we should really be looking for bijections Z E and Z + O separately Proof Define f : Z Z + E O by f(m, n) = { (2m, n 1) if n is even (2m, n) if n is odd We claim that f is bijective To check injectivity, suppose that f(m, n) = f(a, b) Since whether or not the second component of f(m, n) = f(a, b) is positive or negative depends on whether n, b are even or odd, these can be equal only when n and b are both even or both odd If they are both even, then f(m, n) = f(a, b) becomes (2m, n 1) = (2a, b 1), so 2m = 2a and n 1 = b 1, giving m = n and a = b If n, b are both odd, then f(m, n) = f(a, b) becomes (2m, n) = (2a, b), so 2m = 2a and n = b, again giving m = n and a = b Thus f(m, n) = f(a, b) implies (m, n) = (a, b) in either case, so f is injective 3
4 For surjectivity, suppose that (x, y)e O, so x is even and y is odd Since x is even x 2 is an integer Hence if y < 0 we get f( x 2, y) = (x, y), while if y > 0 we have f(x 2, y + 1) = (x, y) Thus either way there is something in Z Z + mapping to (x, y), so f is surjective Thus f is bijective so Z Z + and E O have the same cardinality as claimed 5 (Possibly Tricky) The Cantor set is defined at the end of Section 23 in the book, under the heading Mathematical Perspective: An Unusual Set Show that the Cantor set is uncountable Remark This is tricky, especially if you ve never seen the Cantor set before My purpose for including this here is to show how one question can be converted into another, which you already know the answer to This is vague, but the point here is that we will show that an element of the Cantor set can be uniquely described by a sequence of 0 s and 1 s, and the set of such sequences can be shown to be uncountable using Cantor s diagonalization argument As for preparing for the final, don t worry so much about the part of this solution having to do with the Cantor set, but you should at least be able to show that the set of sequences of 0 s and 1 s is uncountable Proof We will use the notation the book uses when defining the Cantor set C Let x C We construct an element of {0, 1} associated to this as follows Since C = A n, x A n for all n In particular, x A 1 so x is in one of the two intervals making up A 1 ; take the first element in our sequence to be 0 if x is in the left interval [0, 1/3] and take the first element in our sequence to be 1 if x is in the right interval [2/3, 1] Now, whichever of these intervals x is in will itself split into two smaller intervals in the construction of A 2 Since x A 1, x will be in one of these smaller intervals; take the next element in our sequence to be 0 if it is the left interval x is in and take it to be 1 if x is in the right interval For instance, the interval [0, 1/3] splits into [0, 1/9] and [2/9, 1/3] If x [0, 1/9] the first two terms in the sequence we are constructing will be 0, 0, while if x [2/9, 1/3] we have 0, 1 as the beginning of our sequence Continuing in this manner, whichever interval making up A 2 that x is in will split into two smaller pieces; take 0 as the third term in our sequence if x is in the left piece and 1 if x is in the right piece, and so on By keeping track of which interval x is in at each step in the construction of the Cantor set in this manner we get a sequence of 0 s and 1 s For instance, if we get the sequence 0, 1, 1, 1, 0, 0, 0,, x is in the left interval of A 1, then in the right smaller interval which this interval splits into, then in the right smaller interval this splits into, then right again, then in the left smaller interval that this splits into, and so on (This is easier to imagine if you draw a picture of this splitting into smaller and smaller intervals as we did during the review) This assignment of a sequence of 0 s and 1 s to an element x C defines a function C {0, 1} It is injective since different elements in the Cantor set produces different sequences (at some point in the construction, two different numbers in the Cantor set will belong to two different smaller intervals), and it is surjective since given any sequence we can use it to single out an element of the Cantor set Thus C and {0, 1} have the same cardinality We claim that {0, 1} is uncountable, which then shows that the Cantor set is uncountable Given a listing of elements of {0, 1} : n 11, n 12, n 13, n 21, n 22, n 23, n 31, n 32, n 33, 4
5 where each n ij is either 0 or 1, the sequence defined by declaring m k = m 1, m 2, m 3, { 0 if nkk = 1 1 if n kk = 0 is an element of {0, 1} which is not in the above list Thus no listing of elements of {0, 1} can include every element of {0, 1}, so {0, 1} is uncountable 6 Let S be a set and define the binary operation on P(S) by: A B = (A B) (A B) (a) Show that is commutative, has an identity, and that everything has an inverse (b) Give an example of a subset of P(Z) with four elements which is closed under Remark The point of this problem is to give an example of a binary operation on a set which is not just a set of numbers, like Z, Q, or R Note that I had originally asked in part (a) to also show that is associative, but this turns out to be a lot of messy work which isn t very enlightening, so forget that part Another good example to try is the following Define on F (R) by saying that f g : R R is the function given by (f g)(x) = f(x) + g(x) Is this operation associative? commutative? Does it have an identity? What about inverses? Proof (a) For any subsets A and B of S, we have A B = (A B) (A B) = (B A) (B A) = B A simply because A B = B A and A B = B A Thus is commutative For any A S, A = (A ) (A ) = A = A, so is an identity for Finally, for A S we have: A A = (A A) (A A) = A A =, so A is its own inverse Thus everything in P(S) has an inverse under (b) We claim that the subset {, E, O, Z} of P(Z) is closed under We check that A B is one of these subsets whenever A and B are one of these subsets For sure, A = A for any of these subsets since is the identity of Also, A A = for any of these as shown in part (a) Now: E O = Z, E Z = O, O Z = E, all of which are in the given set {, E, O, Z} is closed under Thus A B {, E, O, Z} whenever A, B {, E, O, Z}, so 7 Define a 1 = 1, a 2 = 1, and a n+2 = a n+1 + a n for n 1 Using induction prove that for all positive integers n, a n φ n 1 where φ = (1 + 5)/2 Hint: φ satisfies φ 2 φ 1 = 0 Remark This is an example of using what the book calls the Second Principle of Mathematical Induction, Theorem 523 The point is that in the induction step we want to use the given inequality to replace both a k and a k 1, so we need to assume that the given inequality holds for all integers smaller than the one we want to establish it for Note in the proof why it would not be enough to only use the usual if it is true for k, then it is true for k + 1 5
6 Proof First, a 1 = 1 1 = φ 0 so the inequality holds for n = 1 For a second base case (we ll see why we need two base cases), we have a 2 = 1 φ 1 so the inequality holds for n = 2 as well Suppose now that for some k, a i φ i 1 for all 1 i k (So, not only for n = k but for all positive integers smaller than k) We want to show that a k+1 φ k Since we ve already check the base cases n = 1 and n = 2, we may assume here that k 3, which we need to do in order to write a k+1 = a k + a k 1 according to the recursive definition Both a k and a k 1 are elements to which the induction hypothesis applies to, so a k φ k 1 and a k 1 φ k 2 Then, noting that φ 2 = φ + 1 as a result of the hint, we have: a k+1 = a k + a k 1 φ k 1 + φ k 2 = φ k 2 (φ + 1) = φ k 2 φ 2 = φ k Thus a k+1 φ k as required, so by induction we conclude that a n φ n 1 for all positive n 6
Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE 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.
More informationMATH 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 informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationLECTURE 22: COUNTABLE AND UNCOUNTABLE SETS
LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS 1. Introduction To end the course we will investigate various notions of size associated to subsets of R. The simplest example is that of cardinality - a very
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationFinal 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 informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 10: Sizes of Infinite Sets 1. Show that the set of all polynomials
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 informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationDate: October 24, 2008, Friday Time: 10:40-12:30. Math 123 Abstract Mathematics I Midterm Exam I Solutions TOTAL
Date: October 24, 2008, Friday Time: 10:40-12:30 Ali Sinan Sertöz Math 123 Abstract Mathematics I Midterm Exam I Solutions 1 2 3 4 5 TOTAL 20 20 20 20 20 100 Please do not write anything inside the above
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationFunctions 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 informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationWe 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 informationMATH 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 informationLecture 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 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 informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationFundamentals 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 informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationSelected 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 informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationNOTE: 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 informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 1.4.2, 1.4.4, 1.4.9, 1.4.11,
More informationIn 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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationSETS 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 informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationIn 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 informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationProf. 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 informationHomework #3: 1.4.1, a & b, 1.5.1, 1.5.3, 1.5.6, 1.5.7, 1.5.8, Prove that the set of all real numbers is uncountable.
Lecture 3 Homework #3: 1.4.1, 1.4.2 a & b, 1.5.1, 1.5.3, 1.5.6, 1.5.7, 1.5.8, Prove that the set of all real numbers is uncountable. Note that this lecture will likely run over but the net one is very
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationSome. AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability
15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability 15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Infinity
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationNotes 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 informationCIS 375 Intro to Discrete Mathematics Exam 2 (Section M001: Yellow) 10 November Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 2 (Section M001: Yellow) 10 November 2016 Question Points Possible Points Received 1 20 2 12 3 14 4 10 5 8 6 12 7 12 8 12 Total 100 Instructions: 1. This
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences
More information1 Partitions and Equivalence Relations
Today we re going to talk about partitions of sets, equivalence relations and how they are equivalent. Then we are going to talk about the size of a set and will see our first example of a diagonalisation
More informationS15 MA 274: Exam 3 Study Questions
S15 MA 274: Exam 3 Study Questions You can find solutions to some of these problems on the next page. These questions only pertain to material covered since Exam 2. The final exam is cumulative, so you
More informationUniversity of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics
University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics Examiners: D. Burbulla, P. Glynn-Adey, S. Homayouni Time: 7-10
More informationReal Variables: Solutions to Homework 3
Real Variables: Solutions to Homework 3 September 3, 011 Exercise 0.1. Chapter 3, # : Show that the cantor set C consists of all x such that x has some triadic expansion for which every is either 0 or.
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationMATH 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 informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going
More information6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 1 Fall 2014 I. Foundational material I.1 : Basic set theory Problems from Munkres, 9, p. 64 2. (a (c For each of the first three parts, choose a 1 1 correspondence
More informationChapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.
Chapter 20 Countability This chapter covers infinite sets and countability. 20.1 The rationals and the reals You re familiar with three basic sets of numbers: the integers, the rationals, and the reals.
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationMA 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 informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More information1 Introduction. 2 Categories. Mitchell Faulk June 22, 2014 Equivalence of Categories for Affine Varieties
Mitchell Faulk June 22, 2014 Equivalence of Categories for Affine Varieties 1 Introduction Recall from last time that every affine algebraic variety V A n determines a unique finitely generated, reduced
More informationMath 762 Spring h Y (Z 1 ) (1) h X (Z 2 ) h X (Z 1 ) Φ Z 1. h Y (Z 2 )
Math 762 Spring 2016 Homework 3 Drew Armstrong Problem 1. Yoneda s Lemma. We have seen that the bifunctor Hom C (, ) : C C Set is analogous to a bilinear form on a K-vector space, : V V K. Recall that
More informationGreat Theoretical Ideas in Computer Science. Lecture 5: Cantor s Legacy
15-251 Great Theoretical Ideas in Computer Science Lecture 5: Cantor s Legacy September 15th, 2015 Poll Select the ones that apply to you: - I know what an uncountable set means. - I know Cantor s diagonalization
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationChapter 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 informationDiscussion Summary 10/16/2018
Discussion Summary 10/16/018 1 Quiz 4 1.1 Q1 Let r R and r > 1. Prove the following by induction for every n N, assuming that 0 N as in the book. r 1 + r + r 3 + + r n = rn+1 r r 1 Proof. Let S n = Σ n
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
More information1 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 informationADVANCED 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 informationMath /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs
Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.
More informationSome Basic Notations Of Set Theory
Some Basic Notations Of Set Theory References There are some good books about set theory; we write them down. We wish the reader can get more. 1. Set Theory and Related Topics by Seymour Lipschutz. 2.
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solving in Math (Math 43900) Fall 203 Week six (October ) problems recurrences Instructor: David Galvin Definition of a recurrence relation We met recurrences in the induction hand-out. Sometimes
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
More informationLecture Notes on Discrete Mathematics. October 15, 2018 DRAFT
Lecture Notes on Discrete Mathematics October 15, 2018 2 Contents 1 Basic Set Theory 5 1.1 Basic Set Theory....................................... 5 1.1.1 Union and Intersection of Sets...........................
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationMathematics 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 informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December 2016 Question Points Possible Points Received 1 12 2 14 3 14 4 12 5 16 6 16 7 16 Total 100 Instructions: 1. This exam
More informationReal 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 informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationWriting 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 informationCS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3
CS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3 This third problem set explores graphs, relations, functions, cardinalities, and the pigeonhole principle. This should be a great way to get a
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationSolutions to Homework Problems
Solutions to Homework Problems November 11, 2017 1 Problems II: Sets and Functions (Page 117-118) 11. Give a proof or a counterexample of the following statements: (vi) x R, y R, xy 0; (x) ( x R, y R,
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More information