Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
|
|
- Rolf Fields
- 6 years ago
- Views:
Transcription
1 1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose that A = B. Then A B = B B = B. Also, A B = B B = B. Hence, A B = B = A B and so (1) is proved. Proof of (2): Suppose that A B = A B. We will show that A = B by first proving that A B and second that B A. First, let x A. Then x A B, and since A B = A B this means that we also have x A B. Hence x B, and so A B. Next, let x B. Then x A B, and since A B = A B this means that we also have x A B. Hence x A, and so B A. Since A B and B A, we have proved that A = B. both been proved, A B = A B if and only if A = B. Thus, since (1) and (2) have 2. (4.54) Prove that A B = A B for every two sets A and B (Theorem 4.22(4b)). Solution: We first show A B A B. Let x A B. Then x A B. Thus, x A or x B. Without loss of generality, assume that x A. Then it follows that x A and so x A B. Next, we show that A B A B. Let x A B. Then x A or x B. Without loss of generality, assume that x A. Then it follows that x A and so x A B. Hence, x A B. Thus, A B = A B for every two sets A and B. 3. (4.56) Let A, B, and C be sets. Prove that (A B) (A C) = A (B C). Solution: We first show that (A B) (A C) A (B C). Let x (A B) (A C). Then x A B or x A C. Without loss of generality, assume that x A B. Then x A and x B. Hence, x A and x B C. Therefore, x A (B C). Next, we show that A (B C) (A B) (A C). Let x A (B C). Then Page 1 of 6
2 x A and x B C. Hence, x A, and x B or x C. Without loss of generality, assume that x B. Then, we have x A and x B and so x A B. Hence, x (A B) (A C). Thus, (A B) (A C) = A (B C). 4. (4.64) For sets A and B, find a necessary and sufficient condition for (A B) (B A) =. Verify that this condition is necessary and sufficient. Solution: The necessary and sufficient condition is that A and B are disjoint. That is, A B =. To verify this, we prove the statement For sets A and B, (A B) (B A) = if and only if A B =. We must prove two implications: 1. If A B =, then (A B) (B A) =. 2. If (A B) (B A) =, then A B =. Proof of 1. We prove the contrapositive: if (A B) (B A), then A B Assume that (A B) (B A), and let x (A B) (B A). Then x A B and x B A. Since x A B, there exists c A and d B such that x = (c, d). Also, however, since x B A we also must have c B and d A. Hence, c A B and so A B. Proof of 2. We prove the contrapositive: if A B, then (A B) (B A). Assume that A B and let x A B. Then x A and x B, and hence (x, x) A B and also (x, x) B A. Therefore, (x, x) (A B) (B A), and so (A B) (B A). Since both implications are proved, the statement is true. 5. (4.60) For A = {x, y}, determine A P(A) Solution: Here we have P(A) = {, {x}, {y}, {x, y}}, so A P(A) = {(x, ), (x, {x}), (x, {y}), (x, {x, y}), (y, ), (y, {x}), (y, {y}), (y, {x, y})} 6. (4.62) Let A and B be sets. Prove that A B = if and only if A = or B =. Page 2 of 6
3 Solution: Proof: First, by the definition of Cartesian product, if A = or B = then A B =. So, we need only to prove the converse statement, which is if A B = then A = or B =. To prove this statement, we prove the contrapositive: if A and B, then A B. So, assume that A and B. Since A, there exists an element a A. Since B, there exists an element b B. Thus, (a, b) A B. Hence, A B. 7. (4.66) Result 4.23 states that if A, B, C, and D are sets such that A C and B D, then A B C D. (a) Show that the converse of Result 4.23 is false. Solution: The converse is if A B C D, then A C and B D. We can show a counterexample to this to show it is false. Take, for instance, A =, B = {1}, C = {2} and D = {3}. Then and so A B C D, but B D. A B =, C D = {(2, 3)} (b) Under what added hypothesis is the converse true? Prove your assertion. Solution: The additional hypothesis required for the converse to be true is that A and B must both be non-empty. We can then prove the statement: If A and B are non-empty and A B C D, then A C and B D. Proof: Let C and D be sets and let A and B be non-empty sets such that A B C D. First, we prove that A C. Let a A. Then, since B, there exists b B. Hence, (a, b) A B. Because A B C D, it follows that (a, b) C D and hence a C. Thus, A C. Next, we prove that B D. Let b B. Then, since A, there exists a A. Hence, (a, b) A B. Because A B C D, it follows that (a, b) C D and hence b D. Thus, B D. 8. (4.70) Let A and B be sets. Show, in general, that A B A B. Solution: We need only show that a counterexample exists. For instance, consider the sets A = {1}, B = {2} with the universal set U = {1, 2}. Note that the corresponding universal set for A B is U U = {(1, 1), (1, 2), (2, 1), (2, 2)}. Then we have A B = {(1, 2)}, so A B = {(1, 1), (2, 1), (2, 2)} Page 3 of 6
4 and Here we clearly have A B A B. A = {2}, B = {1}, so A B = {(2, 1)} 9. (4.4) Let x, y Z. Prove that if 3 x and 3 y, then 3 (x 2 y 2 ). Solution: Assume that 3 x and 3 y. Then x = 3p + 1 or x = 3p + 2 for some integer p and y = 3q +1 or y = 3q +2 for some integer q. We then consider the following four cases: Case 1: x = 3p + 1 and y = 3q + 1. Then x 2 y 2 = (3p + 1) 2 (3q + 1) 2 = 3(3p 2 + 2p 3q 2 2q) Since 3p 2 + 2p 3q 2 2q is an integer, 3 (x 2 y 2 ). Case 2: x = 3p + 2 and y = 3q + 2. Then x 2 y 2 = (3p + 2) 2 (3q + 2) 2 = 3(3p 2 + 4p 3q 2 4q) Since 3p 2 + 4p 3q 2 4q is an integer, 3 (x 2 y 2 ). Case 3: x = 3p + 1 and y = 3q + 2. Then x 2 y 2 = (3p + 1) 2 (3q + 2) 2 = 3(3p 2 + 2p 3q 2 4q 1) Since 3p 2 + 2p 3q 2 4q 1 is an integer, 3 (x 2 y 2 ). Case 4: x = 3p + 2 and y = 3q + 1. Then x 2 y 2 = (3p + 2) 2 (3q + 1) 2 = 3(3p 2 + 4p 3q 2 2q + 1) Since 3p 2 + 4p 3q 2 2q + 1 is an integer, 3 (x 2 y 2 ). Since we have shown it is true in all possible cases, if 3 x and 3 y, then 3 (x 2 y 2 ). 10. (4.10) Let n Z. Prove that 2 (n 4 3) if and only if 4 (n 2 + 3). Solution: We first prove the implication If 4 (n 2 + 3), then 2 (n 4 3). Assume that 4 (n 2 + 3). Then n = 4m for some integer m. Hence n 2 = 4m 3 and so n 4 3 = (4m 3) 2 3 = 16m 2 24m + 6 = 2(8m 2 12m + 3). Since 8m 2 12m + 3 is an integer, 2 (n 4 3). Page 4 of 6
5 Next, we prove the implication If 2 (n 4 3), then 4 (n 2 + 3). Assume that 2 (n 4 3). Then n 4 3 = 2m for some integer m. Thus, n 4 = 2m + 3 = 2(m + 1) + 1. Since m + 1 Z, this shows that n 4 is odd. Now, by theorem 3.12 (in fact, by this theorem stated in terms of contrapositives), n 2 is odd. By applying theorem 3.12 again, we have that n is odd. Hence n = 2k + 1 for some integer k, and so n = (2k + 1) = 4k 2 + 4k + 4 = 4(k 2 + k + 1) and since k 2 + k + 1 is an integer, 4 (n 2 + 3), as required. Since both implications have been proved, 2 (n 4 3) if and only if 4 (n 2 + 3). 11. (4.16) Let a, b Z. Prove that if a 2 + 2b 2 0 (mod 3), then either a and b are both congruent to 0 modulo 3 or neither is congruent to 0 modulo 3. Solution: We prove the contrapositive: If one of a or b is congruent to 0 modulo 3 and the other is not congruent to 0 modulo 3, then a 2 + 2b 2 0 (mod 3). We consider 2 cases: Case 1: a 0 (mod 3) and b 0 (mod 3) Since a 0 (mod 3), by Result 4.11 (useful congruence result (3) from class), a 2 0 (mod 3). Since b 0 (mod 3), either b 1 (mod 3) or b 2 (mod 3). We now have 2 subcases: 1. If b 1 (mod 3), then by Result 4.11 b 2 1 (mod 3), and by Result 4.9 (useful congruence result (1) from class) 2b 2 2 (mod 3). Hence, by Result 4.10 (useful congruence result (2) from class) a 2 + 2b 2 2 (mod 3) and so a 2 + 2b 2 0 (mod 3), as required. 2. If b 2 (mod 3), then by Result 4.11 b (mod 3), and by Result 4.9, 2b 2 2 (mod 3). Hence, by Result 4.10, a 2 + 2b 2 2 (mod 3) and so a 2 + 2b 2 0 (mod 3), as required. Case 2: b 0 (mod 3) and a 0 (mod 3) Since b 0 (mod 3), by Result 4.11, b 2 0 (mod 3) and then by Result 4.10 we have 2b 2 0 (mod 3). Since a 0 (mod 3), either a 1 (mod 3) or a 2 (mod 3). We now have 2 subcases: 1. If a 1 (mod 3), then by Result 4.11 a 2 1 (mod 3). Hence, by Result 4.10, a 2 + 2b 2 2 (mod 3) and so a 2 + 2b 2 0 (mod 3), as required. 2. If a 2 (mod 3), then by Result 4.11 a (mod 3). Hence, by Result 4.10, a 2 + 2b 2 2 (mod 3) and so a 2 + 2b 2 0 (mod 3), as required. In all cases, a 2 + 2b 2 0 (mod 3), thus proving the contrapositive and so the original statement is true. Page 5 of 6
6 12. (4.24) Let x and y be even integers. Prove that x 2 y 2 (mod 16) if and only if either (1) x 0 (mod 4) and y 0 (mod 4) or (2) x 2 (mod 4) and y 2 (mod 4). Solution: Proof: Let x and y be even integers. We must prove the two implications: (I) if either (1) x 0 (mod 4) and y 0 (mod 4) or (2) x 2 (mod 4) and y 2 (mod 4), then x 2 y 2 (mod 16) and (II) if x 2 y 2 (mod 16), then either (1) x 0 (mod 4) and y 0 (mod 4) or (2) x 2 (mod 4) and y 2 (mod 4), then x 2 y 2 (mod 16) To prove (I), we consider the two cases: Case 1: Suppose that x 0 (mod 4) and y 0 (mod 4). Then there exist integers p and q such that x = 4p and y = 4q. Hence x 2 y 2 = (4p) 2 (4q) 2 = 16p 2 16q 2 = 16(p 2 q 2 ) and since p, q Z, this shows that x 2 y 2 (mod 16). Case 2: Suppose that x 2 (mod 4) and y 2 (mod 4). Then there exist integers p and q such that x = 4p + 2 and y = 4q + 2. Hence x 2 y 2 = (4p + 2) 2 (4q + 2) 2 = 16p p q 2 16q 4 = 16(p 2 + p q 2 q) and since p, q Z, this shows that x 2 y 2 (mod 16). To prove (II), we prove the contrapositive: if neither (1) nor (2) hold, then x 2 y 2 (mod 16). Assume that neither (1) nor (2) is true. Then, since x and y are even, there are only 2 possible cases: Case 1: Suppose x 0 (mod 4) and y 2 (mod 4). Then, x = 4p and y = 4q + 2 for some p, q Z. Thus, x 2 y 2 = (4p) 2 (4q +2) 2 = 16p 2 16q 2 16q 4 = 16(p 2 q 2 q 1)+12 and so x 2 y 2 (mod 16). Case 2: Suppose x 2 (mod 4) and y 0 (mod 4). Then, x = 4p + 2 and y = 4q for some p, q Z. Thus, x 2 y 2 = (4p + 2) 2 (4q) 2 = 16p p q 2 = 16(p 2 + p q 2 ) + 4 and so x 2 y 2 (mod 16). Since we have proved both (I) and (II), the biconditional is proved. Page 6 of 6
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 informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationPart 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 informationChapter 2 Review. Short Answer Determine whether the biconditional statement about the diagram is true or false.
Chapter 2 Review Short Answer Determine whether the biconditional statement about the diagram is true or false. 1. are supplementary if and only if they form a linear pair. 2. are congruent if and only
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More 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 information2-1 Using Inductive Reasoning to Make Conjectures
CHAPTER 2 Chapter Review 2-1 Using Inductive Reasoning to Make Conjectures Find the next term in each pattern. 1. 6, 12, 18,... 2. January, April, July,... 3. The table shows the score on a reaction time
More informationMore examples of mathematical. Lecture 4 ICOM 4075
More examples of mathematical proofs Lecture 4 ICOM 4075 Proofs by construction A proof by construction is one in which anobjectthat proves the truth value of an statement is built, or found There are
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 informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More 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 information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More information2-4: The Use of Quantifiers
2-4: The Use of Quantifiers The number x + 2 is an even integer is not a statement. When x is replaced by 1, 3 or 5 the resulting statement is false. However, when x is replaced by 2, 4 or 6 the resulting
More informationName: Class: Date: B. The twentieth term is A. D. There is not enough information.
Class: Date: Chapter 2 Review 1. Based on the pattern, what are the next two terms of the sequence? 9, 15, 21, 27,... A. 33, 972 B. 39, 45 C. 162, 972 D. 33, 39 2. What conjecture can you make about the
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationMAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018
MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationRecitation 7: Existence Proofs and Mathematical Induction
Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More information(4) Using results you have studied, show that if x, y are real numbers,
Solutions to Homework 4, Math 310 (1) Give a direct proof to show that if a, b are integers which are squares of integers, then ab is the square of an integer. Proof. We show that if a, b are integers
More informationExample 1: Identifying the Parts of a Conditional Statement
"If p, then q" can also be written... If p, q q, if p p implies q p only if q Example 1: Identifying the Parts of a Conditional Statement Identify the hypothesis and conclusion of each conditional. A.
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationMath 3320 Problem Set 10 Solutions 1
Math 3320 Problem Set 10 Solutions 1 1. For the form Q(x,y)=x 2 +xy+y 2 do the following things: (a) Draw enough of the topograph to show all the values less than 100 that occur in the topograph. You do
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
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 informationMATH 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 informationChapter 2 Test Review 1. Based on the pattern, what are the next two terms of the sequence? 8, 15, 22, 29,...
Number of Customers Geometry Honors Name: Chapter 2 Test Review 1. Based on the pattern, what are the next two terms of the sequence? 8, 15, 22, 29,... 2. Based on the pattern, what is the next figure
More informationGeometry - Chapter 2 Earn-A-Try Test
Name: Geometry - Chapter 2 Earn-A-Try Test Multiple Choice Identify the choice that best completes the statement or answers the question. Use CAPITAL letters only!! Ex: A,B,C,D; Not a,b,c,d. 1. Write a
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More information1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).
1. Prove that the number 123456782 cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3). Solution: First, note that 123456782 2 mod 3. How did we find out?
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
More informationDirect Proof and Proof by Contrapositive
Dr. Nahid Sultana October 14, 2012 Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider x D, p(x) q(x). It can
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
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 informationChapter 2 Practice Test
Name: Class: Date: ID: A Chapter 2 Practice Test 1. What is a counterexample for the conjecture? Conjecture: Any number that is divisible by 4 is also divisible by 8. 2. What is the conclusion of the following
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
More informationCOT3100 SI Final Exam Review
1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many
More informationGeometry: Notes
Geometry: 2.1-2.3 Notes NAME 2.1 Be able to write all types of conditional statements. Date: Define Vocabulary: conditional statement if-then form hypothesis conclusion negation converse inverse contrapositive
More informationConditional Statements
Conditional Statements Lecture 3 Section 2.2 Robb T. Koether Hampden-Sydney College Fri, Jan 17, 2014 Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, 2014 1 / 26 1 Conditional
More informationTOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction
TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More information2-4. Holt McDougal Geometry
Warm Up Write a conditional statement from each of the following. 1. The intersection of two lines is a point. If two lines intersect, then they intersect in a point. 2. An odd number is one more than
More informationSolutions to Section 2.1 Homework Problems S. F. Ellermeyer
Solutions to Section 21 Homework Problems S F Ellermeyer 1 [13] 9 = f13; 22; 31; 40; : : :g [ f4; 5; 14; : : :g [3] 10 = f3; 13; 23; 33; : : :g [ f 7; 17; 27; : : :g [4] 11 = f4; 15; 26; : : :g [ f 7;
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More information2.2 Day 1: Date: Geometry
2.2 Day 1: Date: Geometry A Conditional Statement is an statement. The is the part following if. The is the part following then. Ex 1). What are the hypothesis and the conclusion of the conditional statement?
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
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 informationOrders and Equivalences
and Equivalences Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 9, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) and Equivalences Gazihan Alankuş (Based
More informationADVICE. Since we will need to negate sentences, it is important to review seccons 7 and 11 before proceeding.
20.CONTRADICTION AND CONTRAPOSITIVE We address, once again, the ques2on of how to prove a mathema2cal statement of the form if A, then B. We have used so far the template for a direct proof: unravel A,
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationWhat is a proof? Proofing as a social process, a communication art.
Proof Methods What is a proof? Proofing as a social process, a communication art. Theoretically, a proof of a mathematical statement is no different than a logically valid argument starting with some premises
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationIn 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2
Why non-pictured analysis? CHAPTER 1 Preliminaries f is continuous at x if lim f(x + h) = f(x) h!0 and f(x + h) f(x) f is di erentiable at x if lim h!0 h Then but Di erentiability =) continuity, continuity
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationFoundations 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 informationFERMAT S TEST KEITH CONRAD
FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationCS280, Spring 2004: Prelim Solutions
CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,
More informationComputer Science Foundation Exam
Computer Science Foundation Exam May 6, 2016 Section II A DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question Max Pts Category Passing
More informationMidterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction
Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let
More informationReasoning and Proof Unit
Reasoning and Proof Unit 1 2 2 Conditional Statements Conditional Statement if, then statement the if part is hypothesis the then part is conclusion Conditional Statement How? if, then Example If an angle
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationProblem Set #3 Solutions
Page 3.1 Problem Set #3 Solutions 1. Epp #3.1.: a. Yes: 4rs = (rs) and rs is an integer because r and s are integers and products of integers are integers b. Yes: 6r + 4s + 3 = (3r + s + 1) + 1 and 3r
More informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationA Semester Course in Basic Abstract Algebra
A Semester Course in Basic Abstract Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved December 29, 2011 1 PREFACE This book is an introduction to abstract algebra course for undergraduates
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More information4. Congruence Classes
4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More information(a) Let F be a field, and E F a subfield. Then F can be regarded as a vector space over E (with + and the field operations).
Sample True/False To demonstrate in class (a) If f(x) is an even function, then so i Presentation Math 4310problem 1. Determine whether Prelim the following I Solutions statements (10/09/2015) are (always)
More informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
More informationMathematics 228(Q1), Assignment 3 Solutions
Mathematics 228(Q1), Assignment 3 Solutions Exercise 1.(10 marks)(a) If m is an odd integer, show m 2 1 mod 8. (b) Let m be an odd integer. Show m 2n 1 mod 2 n+2 for all positive natural numbers n. Solution.(a)
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationcse 311: foundations of computing Fall 2015 Lecture 11: Modular arithmetic and applications
cse 311: foundations of computing Fall 2015 Lecture 11: Modular arithmetic and applications arithmetic mod 7 a + 7 b = (a + b) mod 7 a 7 b = (a b) mod 7 5 6 0 1 2 4 3 + 0 1 2 3 4 5 6 0 0 1 2 3 4 5 6 1
More informationLogic. Def. A Proposition is a statement that is either true or false.
Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More information