Selected Solutions to Even Problems, Part 3
|
|
- Rosamund Morgan
- 5 years ago
- Views:
Transcription
1 Selected Solutions to Even Problems, Part 3 March 14, 005 Page If one selects 101 integers from among {1,,..., 00}, then at least two of these numbers must be consecutive, and therefore coprime (which means that gcd(m, n) = 1). To see that there must be such a consecutive pair, we write the integers {1,,..., 00} as a union of 100 disjoint sets {1, } {3, 4} {5, 6} {199, 00}. Then, if we select 101 numbers, since there are only 100 such sets, we must have selected two numbers from the same set; that is, we must have selected a pair of consecutive numbers. 8. a. If S is a subset of the positive integers having at least 3 elements, we may write S = S e S o, where S e is the set of even elements belonging to S, and S o is the set of odd elements belonging to S. One or the other of these sets S e or S o must have at least two elements; else, S has at most elements. If S e has at least two elements, say x and y, then x + y is even; and, if S o has at least two elements, say x and y, then x + y is even. So, S contains at least two elements x and y such that x + y is even when S 3. b. If S has at least 5 elements, then there exists such a pair (x 1, y 1 ), (x, y ) S with (x 1, y 1 ) + (x, y ) = (z 1, z ), where z 1 and z are both even. To see that S must have at least 5 elements, consider the set S = {(1, 1), (1, ), (, ), (, 1)}. No sum of a pair of distinct elements of S will produce an ordered pair with both coordinates even. In general, any such set S may be partitioned as S = S e,e S e,o S o,e S o,o, 1
2 where S e,e is the set of ordered pairs (x 1, x ) S where both x 1 and x are even. The other sets are defined analogously. Now, if S has at least 5 elements, by the pigeonhole principle, one of these four disjoint sets will contain at least two elements. For example, S e,o may contain at least two elements (x 1, x ), (x 3, x 4 ). If so, then (x 1, x ) + (x 3, x 4 ) will have both coordinates even. The same is true for the sum of two elements from the other three sets S e,e, S o,e, ands o,o. So, if S has at least 5 elements, there is a pair of distinct elements of S who sum has even coordinates. c. Extending the idea from part b, if S Z + Z + Z +, and if S 9, then S has a pair who sum has even coordinates. Page 88.. a. On the interval (, 7], g(x) = x 8 x + = (x )(x + ) x + = (x ) = f(x). b. If we change A to ( 7, ], then f(x) g(x); in fact, f(x) is not even defined at x =. 10. a. f is invertible with inverse f 1 = {(x, y) : y + 3x = 7}. b. f is not invertible in general. For example, if a = c = 0 and b = 1, then f(x) = 0, which is not injective, so cannot be invertible (invertible bijection). c. f is invertible with inverse f 1 = {(x, y) : y = x 1/3 }. d. f is not invertible, since f(0) = f( 1) = 0, which implies f is not injective. (Recall f invertible f is a bijection) Page If R is an antisymmetric relation on a set with n elements, then for any pair of distinct elements a, b A we cannot have that both (a, b) and (b, a) belong to R, else a = b (so, they were not distinct elements after all.) Thus, the largest that R can be is if it contains all the pairs (a, a), together with one or the other of (a, b) or (b, a) for all pairs of distinct elements a, b A; so, ( ) n R n +.
3 An example of an antisymmetric relation where this bound on R is attained is A = {1,,..., n} and where the relation R is less-than-or-equal; that is, (a, b) R if and only if a b. Page If R is reflexive, then (a, a) R for all a A. Now, sice for every a A we have that there exists b A such that (a, b) A and (b, a) A, namely b = a, we have that (a, a) R, by the definition of the composition of two relations. It follows that R is also reflexive. 1. a and b. Suppose that R is a relation on a set A having n elements, which we can suppose are A = {1,,..., n}. Then, M(R) will be the matrix whose i, j entry is 1 if and only if (i, j) R; otherwise, the i, j entry is 0. So, this matrix is the 0 matrix if and only if R is empty. Part b is now obvious. c. From problem 11 we deduce that M(R n )M(R) = M(R n+1 ). Thus, for n =, M(R) = M(R ). Assume, for proof by induction, that M(R) k = M(R k ). Then, M(R k+1 ) = M(R k R) = M(R k )M(R) = M(R) k M(R) = M(R) k+1. The induction step is proved, and so the claim follows by mathematical induction. Here, note that the product of two matrices is defined in a funny way: M 1 M is the matrix whose i, j entry is 1 if and only if the i, j entry in the usual product of the matrices M 1 and M is 1; and the i, j entry in M 1 M is 0 otherwise. Page Suppose the poset (A, R) has two least elements, a 1 and a. Thus, a 1 b and a b for all b A. In particular, a 1 a and a a 1. Now, since partial orders are antisymmetric, it follows that a 1 = a, and therefore the least element, if it exists, is unique. 1. If R is a total relation if and only if the graph G has n + ( n ) edges. The term n comes from the edges corresponding to (a, a) R; and, the term ( ) n corresponds to the fact that the graph G contains edges corresponding to all 3
4 pairs of distinct vertices. Note that this directed graph G is not the Hasse diagram corresponding the the poset. Page a. The only element not accouted for in the conditions 1, A 1, 3, 4 A, 5, 6, 7 A 3 is the element 8, which can be in any of the three sets A 1, A or A 3. So, there are 3 possibilities for A 1, A, and A 3. b. If A 1 = 3, then A 1 contains either 7 or 8, but not both. One of the remaining sets A or A 3 must contain the remaining element. So, there are 4 possibilities (7 A 1, 8 A ; or 7 A 1, 8 A 3 ; or 8 A 1, 7 A ; or 8 A 1, 7 A 3 ). c. Either 7, 8 are both in the same set, which accounts for three possibilities for A 1, A, A 3 ; or, 7 is in one set, and 8 is in the other, which accouts for 6 more possibilies for A 1, A, A 3. So, there are 9 possibilities in all. Page We let c 1, c, c 3, c 4 be the conditions that a person brings hot dogs, chicken, salads, and dessert, respectively. So, we are given N = 65, N(c 1 ) = 1, N(c ) = 35, N(c 3 ) = 8, N(c 4 ) = 3, N(c 1 c ) = 13, N(c 1 c 3 ) = 10, N(c 1 c 4 ) = 9, N(c c 3 ) = 1, N(c c 4 ) = 17, N(c 3 c 4 ) = 14, N(c 1 c c 3 ) = 4, N(c 1 c c 4 ) = 6, N(c 1 c 3 c 4 ) = 5, N(c c 3 c 4 ) = 7, and N(c 1 c c 3 c 4 ) =. a. The people who set up and clean is N(c 1 c c 3 c 4 ), which is = 4. b. Those that bring only hotdogs are N(c 1 c c 3 c 4 ), which is N(c 1 ) N(c 1 c ) N(c 1 c 3 ) N(c 1 c 4 )+N(c 1 c c 3 )+N(c 1 c c 4 )+N(c 1 c 3 c 4 ) N(c 1 c c 3 c 4 ), which is c. Let =. S m = {c i1,...,c im } {c 1,...,c 4 } N(c i1 c im ); that is, for example if m =, then S m is N(c 1 c ) + N(c 1 c 3 ) + + N(c 3 c 4 ). We have that S 1 = 116, S = 75, S 3 =, S 4 =. 4
5 Then, the number of people who serve exactly one item is S 1 S + 3S 3 4S 4 = = 4. 5
MATH 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 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 informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 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 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 informationEquivalence relations
Equivalence relations R A A is an equivalence relation if R is 1. reflexive (a, a) R 2. symmetric, and (a, b) R (b, a) R 3. transitive. (a, b), (b, c) R (a, c) R Example: Let S be a relation on people
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationSets, 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 informationREVIEW 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 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 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 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 informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More information1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.
20 [161016-1020 ] 3.3 Binary relations In mathematics, as in everyday situations, we often speak about a relationship between objects, which means an idea of two objects being related or associated one
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
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 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 informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Let R be the relation defined below. Determine which properties, reflexive, irreflexive, symmetric, antisymmetric, transitive, the relation satisfies. Prove each answer.
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
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 informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationGenerating Permutations and Combinations
Generating Permutations and Combinations March 0, 005 Generating Permutations We have learned that there are n! permutations of {,,, n} It is important in many instances to generate a list of such permutations
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More information0 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 informationProblems for Putnam Training
Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
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 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 informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationMultiple Choice Questions for Review
Equivalence and Order Multiple Choice Questions for Review In each case there is one correct answer (given at the end of the problem set). Try to work the problem first without looking at the answer. Understand
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationWILLIAM LOWELL PUTNAM MATHEMATICAL COMPETITION. (3k(k + 1) + 1), for n 1.
Problem A1. Find the sum n (3k(k + 1) + 1), for n 1. k=0 The simplest way to solve this problem is to use the fact that the terms of the sum are differences of consecutive cubes: 3k(k + 1) + 1 = 3k 2 +
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 informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationSupplementary 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 informationSets 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 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 informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationMaximal Symmetric Difference-Free Families of Subsets of [n]
arxiv:1010.2711v1 [math.co] 13 Oct 2010 Maximal Symmetric Difference-Free Families of Subsets of [n] Travis G. Buck and Anant P. Godbole Department of Mathematics and Statistics East Tennessee State University
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 informationDiscrete Structures: Sample Questions, Exam 2, SOLUTIONS
Discrete Structures: Sample Questions, Exam 2, SOLUTIONS (This is longer than the actual test.) 1. Show that any postage of 8 cents or more can be achieved by using only -cent and 5-cent stamps. We proceed
More informationMidterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of
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 informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationPractice Exam 1 CIS/CSE 607, Spring 2009
Practice Exam 1 CIS/CSE 607, Spring 2009 Problem 1) Let R be a reflexive binary relation on a set A. Prove that R is transitive if, and only if, R = R R. Problem 2) Give an example of a transitive binary
More informationRela%ons and Their Proper%es. Slides by A. Bloomfield
Rela%ons and Their Proper%es Slides by A. Bloomfield What is a rela%on Let A and B be sets. A binary rela%on R is a subset of A B Example Let A be the students in a the CS major A = {Alice, Bob, Claire,
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
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 informationCMPSCI 250: Introduction to Computation. Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013
CMPSCI 250: Introduction to Computation Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013 Equivalence Relations Definition of Equivalence Relations Two More Examples: Universal
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 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 informationMath 205 April 28, 2009 Final Exam Review
1 Definitions 1. Some question will ask you to statea a definition and/or give an example of a defined term. The terms are: subset proper subset intersection union power set cartesian product relation
More information1.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 informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationCOMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Relations Luay Nakhleh Computer Science Rice University Chapter 9, Section 1-6 Reading Material When we defined the Sorting Problem, we stated that to sort the list, the elements
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More informationSolutions for Chapter Solutions for Chapter 17. Section 17.1 Exercises
Solutions for Chapter 17 403 17.6 Solutions for Chapter 17 Section 17.1 Exercises 1. Suppose A = {0,1,2,3,4}, B = {2,3,4,5} and f = {(0,3),(1,3),(2,4),(3,2),(4,2)}. State the domain and range of f. Find
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More information3. R = = on Z. R, S, A, T.
6 Relations Let R be a relation on a set A, i.e., a subset of AxA. Notation: xry iff (x, y) R AxA. Recall: A relation need not be a function. Example: The relation R 1 = {(x, y) RxR x 2 + y 2 = 1} is not
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 informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationSTUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150?
STUDY GUIDE FOR THE WRECKONING. Combinatorics Go over combinatorics examples in the text. Review all the combinatorics problems from homework. Do at least a couple of extra problems given below. () How
More informationFOUNDATIONS & 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 informationWeek 4-5: Generating Permutations and Combinations
Week 4-5: Generating Permutations and Combinations February 27, 2017 1 Generating Permutations We have learned that there are n! permutations of {1, 2,...,n}. It is important in many instances to generate
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
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 informationIntroduction 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 informationMobius Inversion on Partially Ordered Sets
Mobius Inversion on Partially Ordered Sets 1 Introduction The theory of Möbius inversion gives us a unified way to look at many different results in combinatorics that involve inverting the relation between
More informationTo hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.
Homework #6. Due Thursday, October 14th Reading: For this homework assignment: Sections 3.3 and 3.4 (up to page 167) Before the class next Thursday: Sections 3.5 and 3.4 (pp. 168-171). Also review the
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationExample: Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple
Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple of 2, that is, an integer x is even if x = 2y for some integer
More informationDiskrete Mathematik Solution 6
ETH Zürich, D-INFK HS 2018, 30. October 2018 Prof. Ueli Maurer Marta Mularczyk Diskrete Mathematik Solution 6 6.1 Partial Order Relations a) i) 11 and 12 are incomparable, since 11 12 and 12 11. ii) 4
More informationSF2729 GROUPS AND RINGS LECTURE NOTES
SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationInduced subgraphs of graphs with large chromatic number. III. Long holes
Induced subgraphs of graphs with large chromatic number. III. Long holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford
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 informationWhat are relations? f: A B
What are relations? Ch 9.1 What are relations? Notation Informally, a relation is a set of pairs of objects (or in general, set of n-tuples) that are related to each other by some rule. We will focus first
More informationSets. 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 informationMATH XYZ. 1. Basics: Sets, Maps, Relations,...
MATH XYZ 1. Basics: Sets, Maps, Relations,... The axiomatic point of view: All entities are sets. For any sets X, A one has: - Either X A [read X belongs to A or X is element of A ]. - Or X / A [read X
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationPacket #5: Binary Relations. Applied Discrete Mathematics
Packet #5: Binary Relations Applied Discrete Mathematics Table of Contents Binary Relations Summary Page 1 Binary Relations Examples Page 2 Properties of Relations Page 3 Examples Pages 4-5 Representations
More informationxy xyy 1 = ey 1 = y 1 i.e.
Homework 2 solutions. Problem 4.4. Let g be an element of the group G. Keep g fixed and let x vary through G. Prove that the products gx are all distinct and fill out G. Do the same for the products xg.
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationMore Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com
More informationRELATIONS AND FUNCTIONS
For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)
More information