Multiple Choice Questions for Review
|
|
|
- Verity Turner
- 6 years ago
- Views:
Transcription
1 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 both why the correct answer is correct and why the other answers are wrong. 1. Let S = {0,1,2,3,4,5,6,7,8,9}. What is the smallest integer K such that any subset of S of size K contains two disjoint subsets of size two, {x 1,x 2 } and {y 1,y 2 }, such that x 1 +x 2 = y 1 +y 2 = 9? (a) 8 (b) 9 (c) 7 (d) 6 (e) 5 2. There are K people in a room, each person picks a day of the year to get a free dinner at a fancy restaurant. K is such that there must be at least one group of six people who select the same day. What is the smallest such K if the year is a leap year (366 days)? (a) 1829 (b) 1831 (c) 1830 (d) 1832 (e) A mineral collection contains twelve samples of Calomel, seven samples of Magnesite, and N samples of Siderite. Suppose that the smallest K such that choosing K samples from the collection guarantees that you have six samples of the same type of mineral is K = 15. What is N? (a) 6 (b) 2 (c) 3 (d) 5 (e) 4 4. What is the smallest N > 0 such that any set of N nonnegative integers must have two distinct integers whose sum or difference is divisible by 1000? (a) 502 (b) 520 (c) 5002 (d) 5020 (e) Let S = {1,3,5,7,9,11,13,15,17,19,21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must be two distinct integers that divide each other? (a) 10 (b) 7 (c) 9 (d) 8 (e) The binary relation R = {(0,0),(1,1)} on A = {0,1,2,3,} is (a) Reflexive, Not Symmetric, Transitive (b) Not Reflexive, Symmetric, Transitive (c) Reflexive, Symmetric, Not Transitive (d) Reflexive, Not Symmetric, Not Transitive (e) Not Reflexive, Not Symmetric, Not Transitive 7. Define a binary relation R = {(0,1),(1,2),(2,3),(3,2),(2,0)} on A = {0,1,2,3}. The directed graph (including loops) of the transitive closure of this relation has EO-34
2 (a) 16 arrows (b) 12 arrows (c) 8 arrows (d) 6 arrows (e) 4 arrows Review Questions 8. Let N + denote the nonzero natural numbers. Define a binary relation R on N + N + by (m,n)r(s,t) if gcd(m,n) = gcd(s,t). The binary relation R is (a) Reflexive, Not Symmetric, Transitive (b) Reflexive, Symmetric, Transitive (c) Reflexive, Symmetric, Not Transitive (d) Reflexive, Not Symmetric, Not Transitive (e) Not Reflexive, Not Symmetric, Not Transitive 9. LetN + 2 denotethenaturalnumbersgreaterthanorequalto2. LetmRn if gcd(m,n) > 1. The binary relation R on N 2 is (a) Reflexive, Symmetric, Not Transitive (b) Reflexive, Not Symmetric, Transitive (c) Reflexive, Symmetric, Transitive (d) Reflexive, Not Symmetric, Not Transitive (e) Not Reflexive, Symmetric, Not Transitive 10. Define a binary relation R on a set A to be antireflexive if xrx doesn t hold for any x A. Thenumberofsymmetric, antireflexivebinaryrelationsonasetoftenelements is (a) 2 10 (b) 2 50 (c) 2 45 (d) 2 90 (e) Let R and S be binary relations on a set A. Suppose that R is reflexive, symmetric, and transitive and that S is symmetric, and transitive but is not reflexive. Which statement is always true for any such R and S? (a) R S is symmetric but not reflexive and not transitive. (b) R S is symmetric but not reflexive. (c) R S is transitive and symmetric but not reflexive (d) R S is reflexive and symmetric. (e) R S is symmetric but not transitive. 12. Definean equivalencerelationr on thepositive integersa = {2,3,4,...,20} by m R n if the largest prime divisor of m is the same as the largest prime divisor of n. The number of equivalence classes of R is (a) 8 (b) 10 (c) 9 (d) 11 (e) 7 EO-35
3 Equivalence and Order 13. Let R = {(a,a),(a,b),(b,b),(a,c),(c,c)} be a partial order relation on Σ = {a,b,c}. Let be the corresponding lexicographic order on Σ. Which of the following is true? (a) bc ba (b) abbaaacc abbaab (c) abbac abb (d) abbac abbab (e) abbac abbaac 14. Consider the divides relation, m n, on the set A = {2,3,4,5,6,7,8,9,10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is (a) 4 (b) 6 (c) 5 (d) 8 (e) Consider the divides relation, m n, on the set A = {2,3,4,5,6,7,8,9,10}. Which of the following permutations of A is not a topological sort of this partial order relation? (a) 7,2,3,6,9,5,4,10,8 (b) 2,3,7,6,9,5,4,10,8 (c) 2,6,3,9,5,7,4,10,8 (d) 3,7,2,9,5,4,10,8,6 (e) 3,2,6,9,5,7,4,10,8 16. Let A = {2,3,4,5,6,7,8,9,10,11,12,13,14,15,16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true? (a) C = 3, M = 8, m = 6 (b) C = 4, M = 8, m = 6 (c) C = 3, M = 6, m = 6 (d) C = 4, M = 6, m = 4 (e) C = 3, M = 6, m = 4 Answers: 1 (c), 2 (b), 3 (e), 4 (a), 5 (d), 6 (b), 7 (a), 8 (b), 9 (a), 10 (c), 11 (d), 12 (a), 13 (b), 14 (e), 15 (c), 16 (a). EO-36
4 Notation Index x y (equivalence relation) EO-1 x C y (covering relation) EO-28 x y (order relation) EO-12 Index-1
5
6 Index Subject Index Antisymmetric relation EO-13 Binary relation EO-3 direct product of EO-18 Boolean product (= ) EO-27 sum (= ) EO-27 Bucket sort EO-22 Chain (= linear order) EO-14 length of EO-29 Comparable elements EO-14 Comparison sort EO-22 Coordinate order (= direct product) EO-17 Covering relation EO-28 Diagram, Hasse EO-28 Direct product of binary relations EO-18 Direct product of posets EO-17 Directed graph diagrams EO-26 Domino coverings EO-24 Element in poset greatest EO-29 least EO-29 maximal EO-30 minimal EO-30 Elements (of a poset) comparable EO-14 incomparable EO-14 Equivalence class EO-1 Equivalence relation EO-1 Extension, linear EO-30 Graph diagrams, directed EO-26 Greatest element in poset EO-29 Hasse diagram EO-28 Incidence matrix EO-14 Incomparable elements EO-14 Incomparable subsets EO-14 Lattice of subsets EO-13 Least element in poset EO-29 Length-first lex order EO-21 Lexicographic bucket sort EO-22 Lexicographic order (= lex order) EO-19 length-first (= short) EO-21 Linear extension EO-30 Linear order EO-14 Matrix, incidence EO-14 Maximal element in poset EO-30 Minimal element in poset EO-30 Monotone subsequences EO-8 Order coordinate (= direct product) EO-17 lexicographic EO-19 Order relation EO-12 Partially ordered set see poset Pigeonhole principle EO-5 extended EO-7 Index-3
7 Index Poset EO-13 comparable elements EO-14 coordinate (= direct product) order EO-17 covering relation EO-28 direct product of EO-17 divisibility EO-14, EO-19 greatest element EO-29 incomparable elements EO-14 isomorphic EO-18 least element EO-29 lex order EO-19 linear (= total) order EO-14 maximal element EO-30 minimal element EO-30 restriction of (= subposet) EO-17 subset lattice EO-13, EO-17 Power set EO-13 Principle extended pigeonhole EO-7 pigeonhole EO-5 Refinement of set partition EO-16 Reflexive relation EO-3, EO-13 Relation antisymmetric EO-13 binary EO-3 covering EO-28 equivalence EO-1 number of EO-15 order EO-12 reflexive EO-3, EO-13 symmetric EO-3 transitive EO-3, EO-13 transitive closure of EO-26 Restriction of a poset (= subposet) EO-17 Sort bucket EO-22 comparison EO-22 topological (= linear extension) EO-30 Subposet EO-17 Subset lattice EO-13 Subset sums EO-6 Sums equal EO-6 equal subset EO-6 Symmetric relation EO-3 Theorem Pigeonhole Principle EO-5 Pigeonhole Principle, extended EO-7 Tiling problem EO-24 Topological sort EO-30 Total order (= linear order) EO-14 Transitive closure EO-26 Transitive relation EO-3, EO-13 Set partially ordered EO-13 power EO-13 Set inclusion order EO-13 Set partition refinement poset EO-16 Index-4
Equivalence 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
Notation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
Section 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
COMP 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
Definition: 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.
3. 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
Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
Discrete Mathematics. 2. Relations
Discrete Mathematics 2. Relations Binary Relations Let A, B be any two sets. A binary relation R from A to B is a subset of A B. E.g., Let < : N N : {(n,m) n < m} The notation a R b or arb means (a,b)îr.
Diskrete 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
Exam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
Selected Solutions to Even Problems, Part 3
Selected Solutions to Even Problems, Part 3 March 14, 005 Page 77 6. If one selects 101 integers from among {1,,..., 00}, then at least two of these numbers must be consecutive, and therefore coprime (which
Packet #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
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Quiz 1 Appendix Appendix Contents 1 Induction 2 2 Relations
Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
Sets 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
a + 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
Properties 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
Discrete Structures: Solutions to Sample Questions, Exam 2
Discrete Structures: Solutions to Sample Questions, Exam 2 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
Chapter 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
Simplification by Truth Table and without Truth Table
Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of
2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices
CS Discrete Mathematics Dr. D. Manivannan (Mani)
CS 275 - Discrete Mathematics Dr. D. Manivannan (Mani) Department of Computer Science University of Kentucky Lexington, KY 40506 Course Website: www.cs.uky.edu/~manivann/cs275 Notes based on Discrete Mathematics
1. 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
Do not open this exam until you are told to begin. You will have 75 minutes for the exam.
Math 2603 Midterm 1 Spring 2018 Your Name Student ID # Section Do not open this exam until you are told to begin. You will have 75 minutes for the exam. Check that you have a complete exam. There are 5
Divisor Problems HAROLD B. REITER.
Divisor Problems HAROLD B REITER UNIVERSITY OF NORTH CAROLINA CHARLOTTE http://wwwmathunccedu/~hbreiter The purpose of this note is to find and study a method for determining and counting all the positive
Relations. 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
Strange Combinatorial Connections. Tom Trotter
Strange Combinatorial Connections Tom Trotter Georgia Institute of Technology trotter@math.gatech.edu February 13, 2003 Proper Graph Colorings Definition. A proper r- coloring of a graph G is a map φ from
CSC 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:
Just the Factors, Ma am HAROLD B. REITER.
Just the Factors, Ma am HAROLD B REITER UNIVERSITY OF NORTH CAROLINA CHARLOTTE http://wwwmathunccedu/~hbreiter The purpose of this note is to find and study a method for determining and counting all the
Week 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
Generating 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
What 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
MA 524 Final Fall 2015 Solutions
MA 54 Final Fall 05 Solutions Name: Question Points Score 0 0 3 5 4 0 5 5 6 5 7 0 8 5 Total: 60 MA 54 Solutions Final, Page of 8. Let L be a finite lattice. (a) (5 points) Show that p ( (p r)) (p ) (p
MULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
Symmetric chain decompositions of partially ordered sets
Symmetric chain decompositions of partially ordered sets A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Ondrej Zjevik IN PARTIAL FULFILLMENT OF THE REQUIREMENTS
Ranking Score Vectors of Tournaments
Utah State University DigitalCommons@USU All Graduate Plan B and other Reports Graduate Studies 5-2011 Ranking Score Vectors of Tournaments Sebrina Ruth Cropper Utah State University Follow this and additional
{a, b, c} {a, b} {a, c} {b, c} {a}
Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also say, S is a partially ordered set or S is a poset.
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Fifth Semester. Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Fifth Semester Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS (Regulation 2008) Time : Three hours Maximum : 100 Marks Answer ALL
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements
Rela%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,
Writing Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
CIS 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
The Topology of k Equal Partial Decomposition Lattices
University of Miami Scholarly Repository Open Access Dissertations Electronic Theses and Dissertations 2012-06-02 The Topology of k Equal Partial Decomposition Lattices Julian A. Moorehead University of
Discrete 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
Orders 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
MATH 420 FINAL EXAM J. Beachy, 5/7/97
MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.
On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras
On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras Peter Freyd pjf@upenn.edu July 17, 2017 The theory of Heyting Semi-Lattices, hsls for short, is obtained by adding to the theory
Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
MAD 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.
CIS 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
Answer: A. Answer: C. 3. If (G,.) is a group such that a2 = e, a G, then G is A. abelian group B. non-abelian group C. semi group D.
1. The set of all real numbers under the usual multiplication operation is not a group since A. zero has no inverse B. identity element does not exist C. multiplication is not associative D. multiplication
REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
Discrete Structures, Final Exam
Discrete Structures, Final Exam Monday, May 11, 2009 SOLUTIONS 1. (40 pts) Short answer. Put your answer in the box. No partial credit. [ ] 0 1 (a) If A = and B = 1 0 [ ] 0 0 1. 0 1 1 [ 0 1 1 0 0 1 ],
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,
Lecture Notes: Selected Topics in Discrete Structures. Ulf Nilsson
Lecture Notes: Selected Topics in Discrete Structures Ulf Nilsson Dept of Computer and Information Science Linköping University 581 83 Linköping, Sweden ulfni@ida.liu.se 2004-03-09 Contents Chapter 1.
Discrete Structures: Sample Questions, Exam 2, SOLUTIONS
Discrete Structures: Sample Questions, Exam, SOLUTIONS This is longer than the actual test.) 1. List all the strings over X = {a, b, c} of length or less. λ, a, b, c, aa, ab, ac, ba, bb, bc, ca, cb, cc..
Commutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
Chapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions
1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
Assignment #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
Reading 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
18.312: Algebraic Combinatorics Lionel Levine. Lecture 11
18.312: Algebraic Combinatorics Lionel Levine Lecture date: March 15, 2011 Lecture 11 Notes by: Ben Bond Today: Mobius Algebras, µ( n ). Test: The average was 17. If you got < 15, you have the option to
and e 2 ~ e 2 iff e 1
Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x
Math 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
Goal. Partially-ordered set. Game plan 2/2/2013. Solving fixpoint equations
Goal Solving fixpoint equations Many problems in programming languages can be formulated as the solution of a set of mutually recursive equations: D: set, f,g:dxd D x = f(x,y) y = g(x,y) Examples Parsing:
Constructions of Derived Equivalences of Finite Posets
Constructions of Derived Equivalences of Finite Posets Sefi Ladkani Einstein Institute of Mathematics The Hebrew University of Jerusalem http://www.ma.huji.ac.il/~sefil/ 1 Notions X Poset (finite partially
1.2 Posets and Zorn s Lemma
1.2 Posets and Zorn s Lemma A set Σ is called partially ordered or a poset with respect to a relation if (i) (reflexivity) ( σ Σ) σ σ ; (ii) (antisymmetry) ( σ,τ Σ) σ τ σ = σ = τ ; 66 (iii) (transitivity)
Unit I (Logic and Proofs)
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018
Relations Alice E. Fischer April, 2018 1 Inverse of a Relation 2 Properties of Relations The Inverse of a Relation Let R be a relation from A to B. Define the inverse relation, R 1 from B to A as follows.
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS
1 MA6566 - DISCRETE MATHEMATICS UNIT I - LOGIC AND PROOFS Propositional Logic Propositional equivalences-predicates and quantifiers-nested Quantifiers- Rules of inference-introduction to Proofs-Proof Methods
Discrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
Answer: Answer: 37! 3 How many five card hands are there that contain at least one club? Answer: How many one pair poker hands are there? Etc.
Practice Final, M325K, 12/13/2014 PRINTED NAME: EID: No books, notes, calculators, or telephones are allowed. Every problem is worth an equal number of points. You must show your work; answers without
B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards.
B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards. 1. TITLE: Subject Mathematics 2. YEAR OF IMPLEMENTATION : Revised Syllabus will be implemented from June 2013
1. (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
Simplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
Lecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
MATH1240 Definitions and Theorems
MATH1240 Definitions and Theorems 1 Fundamental Principles of Counting For an integer n 0, n factorial (denoted n!) is defined by 0! = 1, n! = (n)(n 1)(n 2) (3)(2)(1), for n 1. Given a collection of n
32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
List of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory
Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory Part 1: Prime Factorization A prime number is an integer greater than 1 whose only positive divisors are 1 and itself. An integer
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
Chapter 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
Simplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh
Set Basics. P. Danziger
- 5 Set Basics P. Danziger 1 Set Basics Definition 1 (Cantor) A set is a collection into a whole of definite and separate objects of our intuition or thought. (Russell) Such that given an object x and
Name: Solutions Final Exam
Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of
Associative property
Addition Associative property Closure property Commutative property Composite number Natural numbers (counting numbers) Distributive property for multiplication over addition Divisibility Divisor Factor
Polynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010
MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high
The Saturation Number of Induced Subposets of the Boolean Lattice
The Saturation Number of Induced Subposets of the Boolean Lattice Michael Ferrara a, Bill Kay b, Lucas Kramer c,1, Ryan R. Martin d, Benjamin Reiniger e, Heather C. Smith f,, Eric Sullivan a a Department
Boolean Algebra. Sungho Kang. Yonsei University
Boolean Algebra Sungho Kang Yonsei University Outline Set, Relations, and Functions Partial Orders Boolean Functions Don t Care Conditions Incomplete Specifications 2 Set Notation $09,3/#0,9 438 v V Element
PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.
PGSS Discrete Math Solutions to Problem Set #4 Note: signifies the end of a problem, and signifies the end of a proof. 1. Prove that for any k N, there are k consecutive composite numbers. (Hint: (k +
Definitions. 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
Introduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)