Binary Relation Review Questions

Size: px
Start display at page:

Download "Binary Relation Review Questions"

Transcription

1 CSE 191 Discrete Structures Fall 2016 Recursive sets Binary Relation Review Questions 1. For each of the relations below, answer the following three questions: Is the relation reflexive? Is the relation symmetric, anti-symmetric or neither? Is the relation transitive? Is the relation a partial order? Is the relation a total order? Is the relation an equivalence relation? If the relation does not have one of the properties, give an example illustrating this or explain why. 1(a). The domain is the set of UB students. xry if and only if person x is taller than person y. Is the relation reflexive? No. A person is not taller than him/herself. If person a is taller than person b, then person b is not taller than person a. Yes, anti-symmetric. There are no times where arb and bra so anti-symmetry is not violated. Is the relation transitive? Yes. If a is taller than b and b is taller than c then a must be taller than c. Is the relation a partial order? No. The relation is not reflexive. Is the relation an equivalence relation? No. Not reflexive or symmetric. 1(b). The domain is the set of UB students. xry is in the relation if person x is a first cousin of person y (i.e., a parent of person x is a sibling of a parent of person y). Is the relation reflexive? No. Your parents are not a sibling of themselves.

2 Is the relation symmetric, anti-symmetric or neither? Yes, symmetric. If x has a parent who is a sibling of a parent of person y, then the opposite is true. No, not anti-symmetric. Any two people who are first cousins violate this rule. Is the relation transitive? No. If you have two different people x and y where x is a first cousin of y and y is a first cousin of x, is is never the case that x is a first cousin of x. Is the relation a partial order? No. The relation is not transitive. Is the relation an equivalence relation? No. Not reflexive or transitive. 1(c). The domain is a set of UB students. xry is in the relation if person x knows the student ID number for person y. You can assume that every student knows his or her own student ID number. Is the relation reflexive? Yes. Everyone knows their own person number (in an ideal world). If I tell everyone my person number that doesn t mean they will tell me their person number. No, not anti-symmetric. It could be the case that two people share their person number with one another. Is the relation transitive? No. If you have three different people a, b, c and a knows b s person number and b knows c s person number, it s possible that a doesn t even know person c so they wouldn t know their person number either. Is the relation a partial order? No. The relation is not antisymmetric or transitive. Is the relation an equivalence relation? No. Not symmetric or transitive. 1(d). The domain is the set of real numbers. xry if and only if x + y = 0. Is the relation reflexive? No

3 Is the relation symmetric, anti-symmetric or neither? Yes, symmetric. If x + y = 0 then y + x = 0. No, not anti-symmetric. 5+( 5) = 0 and ( 5)+5 = 0 but 5 5. Is the relation transitive? No. 5 + ( 5) = 0 and ( 5) + 5 = 0 but Is the relation a partial order? No. The relation is not reflexive, anti-symmetric, or transitive. Is the relation an equivalence relation? No. Not reflexive or transitive. 1(e). The domain is the set of real numbers. xry if and only if x = 2y. Is the relation reflexive? No. 2 2(2) = 4. 2 = 2(1) but 1 2(2). Yes, anti-symmetric. The only time that x = 2y and y = 2(x) are both true is when x = y = 0. Is the relation transitive? No. 4 = 2(2) and 2 = 2(1) but 4 2(1) = 2 Is the relation a partial order? No. The relation is not reflexive or transitive. Is the relation an equivalence relation? No. Not reflexive or symmetric. 1(f). The domain is the set of real numbers. xry if and only if x y is a rational number. Is the relation reflexive? Yes. x x = 0 for all real numbers and 0 is rational. Is the relation symmetric, anti-symmetric or neither? Yes, symmetric. If x y is rational, then y x is that rational number multiplied by 1, which would still be rational. No, not anti-symmetric. 5 3 = 2 is rational and 3 5 = 2 is rational but 5 3.

4 Is the relation transitive? Yes. If x y is rational and y z is rational then x z must also be rational. Is the relation a partial order? No. The relation is not antisymmetric. Is the relation an equivalence relation? Yes. The relation is reflexive, symmetric, and transitive. 1(g). The domain is the set of real numbers. xry if and only if x y is a non-negative number. Is the relation reflexive? Yes. x x = 0 is always non-negative. Is the relation symmetric, anti-symmetric or neither? Not symmetric. 5 3 = 2 is non-negative but 3 5 = 2 is not non-negative. Yes, anti-symmetric. The only time that x y and y x are both non-negative is when x = y. Is the relation transitive? Yes. If x y is non-negative and y z is non-negative then x z must be non-negative. Is the relation a partial order? Yes. The relation is reflexive, antisymmetric, and transitive. Is the relation a total order? Yes. It is a total order since any two real numbers can be subtracted from one another and their difference will either be negative or non-negative. Is the relation an equivalence relation? No. Not symmetric. 1(h). The domain is A = {a, b, c, d}. The relation is {(a, b), (a, a), (b, b), (b, a), (c, d), (d, c)}. Is the relation reflexive? No. d is not related to d. Is the relation symmetric, anti-symmetric or neither? Yes, symmetric. For each pair (x, y) in the relation, we always have (y, x). No, not anti-symmetric. a is related to b and b is related to a but a b. Is the relation transitive? No. c is related to d and d is related to c but c is not related to c. Is the relation a partial order? No. The relation is not reflexive, anti-symmetric, or transitive.

5 Is the relation an equivalence relation? No. Not reflexive.

Reading 11 : Relations and Functions

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

More information

Lecture 7: Relations

Lecture 7: Relations Lecture 7: Relations 1 Relation Relation between two objects signify some connection between them. For example, relation of one person being biological parent of another. If we take any two people at random,

More information

Relationships between elements of sets occur in many contexts. Every day we deal with

Relationships between elements of sets occur in many contexts. Every day we deal with C H A P T E R 9 Relations 9.1 Relations and Their Properties 9.2 n-ary Relations and Their Applications 9.3 Representing Relations 9.4 Closures of Relations 9.5 Equivalence Relations 9.6 Partial Orderings

More information

Today. Binary relations establish a relationship between elements of two sets

Today. Binary relations establish a relationship between elements of two sets Today Relations Binary relations and properties Relationship to functions n-ary relations Definitions Binary relations establish a relationship between elements of two sets Definition: Let A and B be two

More information

MAD 3105 PRACTICE TEST 2 SOLUTIONS

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.

More information

RED. Fall 2016 Student Submitted Sample Questions

RED. Fall 2016 Student Submitted Sample Questions RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions

More information

Notes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.

Notes. 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 information

CSC Discrete Math I, Spring Relations

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:

More information

Relations Graphical View

Relations 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 information

Relations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related.

Relations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related. - 10 Relations P. Danziger 1 Relations (10.1) Definition 1 1. A relation from a set A to a set B is a subset R of A B. 2. Given (x, y) R we say that x is related to y and write xry. 3. If (x, y) R we say

More information

Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)

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

More information

Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018

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.

More information

The main limitation of the concept of a. function

The main limitation of the concept of a. function Relations The main limitation of the concept of a A function, by definition, assigns one output to each input. This means that a function cannot model relationships between sets where some objects on each

More information

Linear Equations and Functions

Linear Equations and Functions Linear Equations and Functions Finding the Slope and Equation of a Line. ans-00-0.... x y y x b c c b Finding Slope.... undefined. 6. - 7. - 8. 0 9. 0. undefined.. 6... 6. (, -) Finding the Equation of

More information

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS

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

More information

Properties of Real Numbers. Unit 1 Lesson 4

Properties of Real Numbers. Unit 1 Lesson 4 Properties of Real Numbers Unit 1 Lesson 4 Students will be able to: Recognize and use the properties of real numbers. Key Vocabulary: Identity Property Inverse Property Equality Property Associative Property

More information

Problem Set #1 solutions

Problem Set #1 solutions Problem Set # solutions... This number trick involves your favorite three-digit number and your age. Multiply your age by 7. Subtract from the result. Multiply by. Add 8. Multiply by 3. Add your favorite

More information

A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A. A B means A is a proper subset of B

A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A. A B means A is a proper subset of B Subsets C-N Math 207 - Massey, 71 / 125 Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B

More information

Sets. Subsets. for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C. C-N Math Massey, 72 / 125

Sets. Subsets. for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C. C-N Math Massey, 72 / 125 Subsets Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B A B but A B, so x B x / A Illustrate

More information

Chapter 6. Relations. 6.1 Relations

Chapter 6. Relations. 6.1 Relations Chapter 6 Relations Mathematical relations are an extremely general framework for specifying relationships between pairs of objects. This chapter surveys the types of relations that can be constructed

More information

Relations. Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B.

Relations. Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B. Chapter 5 Relations Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B. If A = B then a relation from A to B is called is called a relation on A. Examples A relation

More information

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set?

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set? Assignment 4 Solutions Problem1: (Section 2.1 Exercise 9) (a.) List all the subsets of the set {a, b, c, d} which contain: (i.) four elements (ii.) three elements (iii.) two elements (iv.) one element

More information

121. y = Each solution is 32 units from = 2. > 3. < 4. > 5. > 6. > 1. x < q no 9. yes 10.

121. y = Each solution is 32 units from = 2. > 3. < 4. > 5. > 6. > 1. x < q no 9. yes 10. . y =,. y =. y = x. x =, Each solution is units from... y x =. x m x =. C = ; months; months x = w u + r. no solution. n =,. no solution Each solution is units from. Each solution is units from. Chapter.

More information

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements. 1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p

More information

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 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

More information

COMP232 - Mathematics for Computer Science

COMP232 - Mathematics for Computer Science COMP232 - Mathematics for Computer Science Tutorial 11 Ali Moallemi moa ali@encs.concordia.ca Iraj Hedayati h iraj@encs.concordia.ca Concordia University, Fall 2015 Ali Moallemi, Iraj Hedayati COMP232

More information

Relations MATH Relations. Benjamin V.C. Collins, James A. Swenson MATH 2730

Relations MATH Relations. Benjamin V.C. Collins, James A. Swenson MATH 2730 MATH 2730 Benjamin V.C. Collins James A. Swenson among integers equals a = b is true for some pairs (a, b) Z Z, but not for all pairs. is less than a < b is true for some pairs (a, b) Z Z, but not for

More information

Discrete Structures: Sample Questions, Exam 2, SOLUTIONS

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

More information

Definitions: A binary relation R on a set X is (a) reflexive if x X : xrx; (f) asymmetric if x, x X : [x Rx xr c x ]

Definitions: A binary relation R on a set X is (a) reflexive if x X : xrx; (f) asymmetric if x, x X : [x Rx xr c x ] Binary Relations Definition: A binary relation between two sets X and Y (or between the elements of X and Y ) is a subset of X Y i.e., is a set of ordered pairs (x, y) X Y. If R is a relation between X

More information

CSE 20 DISCRETE MATH. Winter

CSE 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 information

CSE 20 DISCRETE MATH. Fall

CSE 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 information

3. R = = on Z. R, S, A, T.

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

More information

6-3 Solving Systems by Elimination

6-3 Solving Systems by Elimination Another method for solving systems of equations is elimination. Like substitution, the goal of elimination is to get one equation that has only one variable. To do this by elimination, you add the two

More information

PreCalculus: Semester 1 Final Exam Review

PreCalculus: Semester 1 Final Exam Review Name: Class: Date: ID: A PreCalculus: Semester 1 Final Exam Review Short Answer 1. Determine whether the relation represents a function. If it is a function, state the domain and range. 9. Find the domain

More information

Assignment #2 COMP 3200 Spring 2012 Prof. Stucki

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

More information

At least one of us is a knave. What are A and B?

At least one of us is a knave. What are A and B? 1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either

More information

CHAPTER 1. Relations. 1. Relations and Their Properties. Discussion

CHAPTER 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 information

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which

Review Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)

More information

UNIT 3 REASONING WITH EQUATIONS Lesson 2: Solving Systems of Equations Instruction

UNIT 3 REASONING WITH EQUATIONS Lesson 2: Solving Systems of Equations Instruction Prerequisite Skills This lesson requires the use of the following skills: graphing equations of lines using properties of equality to solve equations Introduction Two equations that are solved together

More information

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.

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

More information

Concept: Solving Equations

Concept: Solving Equations Concept: Solving Equations EQ: How do we justify how we solve equations? REI. 1 Vocabulary: Properties of Equality Properties of Operation Justify 1 Solve the equations below, provide an explanation for

More information

Chapter 9: Relations Relations

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

More information

Lecture 4: Constructing the Integers, Rationals and Reals

Lecture 4: Constructing the Integers, Rationals and Reals Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define

More information

Unit 1, Activity 1, Rational Number Line Cards - Student 1 Grade 8 Mathematics

Unit 1, Activity 1, Rational Number Line Cards - Student 1 Grade 8 Mathematics Unit, Activity, Rational Number Line Cards - Student Grade 8 Mathematics Blackline Masters, Mathematics, Grade 8 Page - Unit, Activity, Rational Number Line Cards - Student Blackline Masters, Mathematics,

More information

Adding and Subtracting Rational Expressions. Add and subtract rational expressions with the same denominator.

Adding and Subtracting Rational Expressions. Add and subtract rational expressions with the same denominator. Chapter 7 Section 7. Objectives Adding and Subtracting Rational Expressions 1 3 Add and subtract rational expressions with the same denominator. Find a least common denominator. Add and subtract rational

More information

Relations (3A) Young Won Lim 3/27/18

Relations (3A) Young Won Lim 3/27/18 Relations (3A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

More information

Algebra. Robert Taggart

Algebra. Robert Taggart Algebra Robert Taggart Table of Contents To the Student.............................................. v Unit 1: Algebra Basics Lesson 1: Negative and Positive Numbers....................... Lesson 2: Operations

More information

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.

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

More information

In a previous lesson, we solved certain quadratic equations by taking the square root of both sides of the equation.

In a previous lesson, we solved certain quadratic equations by taking the square root of both sides of the equation. In a previous lesson, we solved certain quadratic equations by taking the square root of both sides of the equation. x = 36 (x 3) = 8 x = ± 36 x 3 = ± 8 x = ±6 x = 3 ± Taking the square root of both sides

More information

Worksheet on Relations

Worksheet on Relations Worksheet on Relations Recall the properties that relations can have: Definition. Let R be a relation on the set A. R is reflexive if for all a A we have ara. R is irreflexive or antireflexive if for all

More information

Properties of the Integers

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

More information

Relations. Relations. Definition. Let A and B be sets.

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

More information

Foundations of algebra

Foundations of algebra Foundations of algebra Equivalence relations - suggested problems - solutions P1: There are several relations that you are familiar with: Relations on R (or any of its subsets): Equality. Symbol: x = y.

More information

Solutions to In Class Problems Week 4, Mon.

Solutions to In Class Problems Week 4, Mon. Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

More information

Chapter12. Relations, Functions, and Induction

Chapter12. Relations, Functions, and Induction . Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a

More information

MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010

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

More information

Class VIII Chapter 1 Rational Numbers Maths. Exercise 1.1

Class VIII Chapter 1 Rational Numbers Maths. Exercise 1.1 Question 1: Using appropriate properties find: Exercise 1.1 (By commutativity) Page 1 of 11 Question 2: Write the additive inverse of each of the following: (iii) (iv) (v) Additive inverse = Additive inverse

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

Relations, Functions, and Sequences

Relations, 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 information

9 < Ways to place n distinguishable objects= S(n, k) = into k indistinguishable boxes so that no box is left empty We stated in section 6.

9 < Ways to place n distinguishable objects= S(n, k) = into k indistinguishable boxes so that no box is left empty We stated in section 6. Math 365 Monday 4/1/19 8.5 (inclusion/exclusion) and 9.1 & 9.5 (equivalence relations) Exercise 41. Use inclusion/exclusion to answer the following questions. (a) How many elements are in A 1 [ A 2 if

More information

evaluate functions, expressed in function notation, given one or more elements in their domains

evaluate functions, expressed in function notation, given one or more elements in their domains Describing Linear Functions A.3 Linear functions, equations, and inequalities. The student writes and represents linear functions in multiple ways, with and without technology. The student demonstrates

More information

MULTIPLE-CHOICE QUESTIONS

MULTIPLE-CHOICE QUESTIONS MULTIPLE-CHOICE QUESTIONS A calculator is permitted for use in solving questions numbered 4 43 in this sampler. 27. The coordinates of the vertices of a quadrilateral are given below. (8, 11) (11, 7) (2,

More information

RELATIONS AND FUNCTIONS

RELATIONS 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

LECTURE 15: RELATIONS. Software Engineering Mike Wooldridge

LECTURE 15: RELATIONS. Software Engineering Mike Wooldridge LECTURE 15: RELATIONS Mike Wooldridge 1 Introduction We saw in earlier lectures that a function is just a set of maplets, for example: tel == {mikew 1531, eric 1489}. A maplet is just an ordered pair,

More information

What are relations? f: A B

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

More information

Engineering Jump Start - Summer 2012 Mathematics Worksheet #4. 1. What is a function? Is it just a fancy name for an algebraic expression, such as

Engineering Jump Start - Summer 2012 Mathematics Worksheet #4. 1. What is a function? Is it just a fancy name for an algebraic expression, such as Function Topics Concept questions: 1. What is a function? Is it just a fancy name for an algebraic expression, such as x 2 + sin x + 5? 2. Why is it technically wrong to refer to the function f(x), for

More information

Vocabulary: I. Inverse Variation: Two variables x and y show inverse variation if they are related as. follows: where a 0

Vocabulary: I. Inverse Variation: Two variables x and y show inverse variation if they are related as. follows: where a 0 8.1: Model Inverse and Joint Variation I. Inverse Variation: Two variables x and y show inverse variation if they are related as follows: where a 0 * In this equation y is said to vary inversely with x.

More information

Lesson 3: Using Linear Combinations to Solve a System of Equations

Lesson 3: Using Linear Combinations to Solve a System of Equations Lesson 3: Using Linear Combinations to Solve a System of Equations Steps for Using Linear Combinations to Solve a System of Equations 1. 2. 3. 4. 5. Example 1 Solve the following system using the linear

More information

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

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

More information

Algebra 2 Honors: Final Exam Review

Algebra 2 Honors: Final Exam Review Name: Class: Date: Algebra 2 Honors: Final Exam Review Directions: You may write on this review packet. Remember that this packet is similar to the questions that you will have on your final exam. Attempt

More information

CS 6110 Lecture 28 Subtype Polymorphism 3 April 2013 Lecturer: Andrew Myers

CS 6110 Lecture 28 Subtype Polymorphism 3 April 2013 Lecturer: Andrew Myers CS 6110 Lecture 28 Subtype Polymorphism 3 April 2013 Lecturer: Andrew Myers 1 Introduction In this lecture, we make an attempt to extend the typed λ-calculus for it to support more advanced data structures

More information

Relations. 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) 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 information

MATH 114 Fall 2004 Solutions to practice problems for Final Exam

MATH 114 Fall 2004 Solutions to practice problems for Final Exam MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from

More information

Subtract 6 to both sides Divide by 2 on both sides. Cross Multiply. Answer: x = -9

Subtract 6 to both sides Divide by 2 on both sides. Cross Multiply. Answer: x = -9 Subtract 6 to both sides Divide by 2 on both sides Answer: x = -9 Cross Multiply. = 3 Distribute 2 to parenthesis Combine like terms Subtract 4x to both sides Subtract 10 from both sides x = -20 Subtract

More information

Honors Math 2 Unit 5 Exponential Functions. *Quiz* Common Logs Solving for Exponents Review and Practice

Honors Math 2 Unit 5 Exponential Functions. *Quiz* Common Logs Solving for Exponents Review and Practice Honors Math 2 Unit 5 Exponential Functions Notes and Activities Name: Date: Pd: Unit Objectives: Objectives: N-RN.2 Rewrite expressions involving radicals and rational exponents using the properties of

More information

Discrete Structures: Sample Questions, Exam 2, SOLUTIONS

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..

More information

Associative Property. The word "associative" comes from "associate" or "group; the Associative Property is the rule that refers to grouping.

Associative Property. The word associative comes from associate or group; the Associative Property is the rule that refers to grouping. Associative Property The word "associative" comes from "associate" or "group; the Associative Property is the rule that refers to grouping. For addition, the rule is "a + (b + c) = (a + b) + c; in numbers,

More information

Unit 9 Study Sheet Rational Expressions and Types of Equations

Unit 9 Study Sheet Rational Expressions and Types of Equations Algebraic Fractions: Unit 9 Study Sheet Rational Expressions and Types of Equations Simplifying Algebraic Fractions: To simplify an algebraic fraction means to reduce it to lowest terms. This is done by

More information

Mathematics for linguists

Mathematics for linguists 1/17 Mathematics for linguists Gerhard Jäger gerhard.jaeger@uni-tuebingen.de Uni Tübingen, WS 2009/2010 November 3, 2009 2/17 Composition of relations and functions let R A B and S B C be relations new

More information

Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan. Section: NetID: Multiple Choice Question (30 questions in total, 4 points each)

Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan. Section: NetID: Multiple Choice Question (30 questions in total, 4 points each) Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan Section: NetID: Name: Multiple Choice Question (30 questions in total, 4 points each) 1 Consider the following propositions: f: The student got

More information

2 A 3-Person Discrete Envy-Free Protocol

2 A 3-Person Discrete Envy-Free Protocol Envy-Free Discrete Protocols Exposition by William Gasarch 1 Introduction Whenever we say something like Alice has a piece worth α we mean it s worth α TO HER. The term biggest piece means most valuable

More information

Discrete Mathematics. 2. Relations

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.

More information

Preference, Choice and Utility

Preference, Choice and Utility Preference, Choice and Utility Eric Pacuit January 2, 205 Relations Suppose that X is a non-empty set. The set X X is the cross-product of X with itself. That is, it is the set of all pairs of elements

More information

1.4 Equivalence Relations and Partitions

1.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 information

CSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.

CSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators. CSE 311: Foundations of Computing I Autumn 014 Practice Final: Section X YY ZZ Name: UW ID: Instructions: Closed book, closed notes, no cell phones, no calculators. You have 110 minutes to complete the

More information

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 1 / 17 L545 Spring 2013 Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 2 / 17 Why set theory? Set theory sets the foundation for much of mathematics For us: provides precise

More information

An Introduction to the Concept of Relations

An Introduction to the Concept of Relations An Introduction to the Concept of Relations Think of your family tree. It consists of your brothers, sisters, cousins, second cousins, aunts uncles, parents grandparents, great grandparents etc. On this

More information

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011 Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell

More information

(Pre-)Algebras for Linguistics

(Pre-)Algebras for Linguistics 1. Review of Preorders Linguistics 680: Formal Foundations Autumn 2010 (Pre-)Orders and Induced Equivalence A preorder on a set A is a binary relation ( less than or equivalent to ) on A which is reflexive

More information

9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics

9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics MATH10111 - Foundations of Pure Mathematics 9 RELATIONS 9.1 Reflexive, symmetric and transitive relations Let A be a set with A. A relation R on A is a subset of A A. For convenience, for x, y A, write

More information

Q1. Amina is making designs with two different shapes.

Q1. Amina is making designs with two different shapes. Q1. Amina is making designs with two different shapes. She gives each shape a value. Total value is 147 Total value is 111 Calculate the value of each shape. Q2. n stands for a whole number. 2n is greater

More information

Essential Statistics. Gould Ryan Wong

Essential Statistics. Gould Ryan Wong Global Global Essential Statistics Eploring the World through Data For these Global Editions, the editorial team at Pearson has collaborated with educators across the world to address a wide range of subjects

More information

Interactive Study Guide Solving Two-Step Equations

Interactive Study Guide Solving Two-Step Equations 11-1 To solve equations with more than one operation, or a two-step equation, follow the order of operations in reverse. First add or subtract then, multiply or divide. Solving Two-Step Equations Using

More information

arb where a A, b B and we say a is related to b. Howdowewritea is not related to b? 2Rw 1Ro A B = {(a, b) a A, b B}

arb where a A, b B and we say a is related to b. Howdowewritea is not related to b? 2Rw 1Ro A B = {(a, b) a A, b B} Functions Functions play an important role in mathematics as well as computer science. A function is a special type of relation. So what s a relation? A relation, R, from set A to set B is defined as arb

More information

HL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups

HL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups HL Topic (Further Mathematics SL Topic 3) 9 This topic explores the fundamental nature of algebraic structures and the relationships between them. Included is an extension of the work covered in the Core

More information

USA Mathematical Talent Search Round 1 Solutions Year 22 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 22 Academic Year 1/2/22. Show that there is a unique way to place positive integers in the grid to the right following these three rules: 1. Each entry in the top row is one digit. 2. Each entry in any row below the top

More information

CS2013: Relations and Functions

CS2013: Relations and Functions CS2013: Relations and Functions 20/09/16 Kees van Deemter 1 Relations and Functions Some background for CS2013 Necessary for understanding the difference between Deterministic FSAs (DFSAs) and NonDeterministic

More information

Lecture 4.3: Closures and Equivalence Relations

Lecture 4.3: Closures and Equivalence Relations Lecture 4.3: Closures and CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren Course Admin Mid-Term 2 Exam Solution will be posted soon Should have the results

More information

14 Equivalence Relations

14 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 information

Lesson 1-6. Algebra Slide Show: Teaching Made Easy As Pi, by James Wenk Identities 5 12 = 12 5

Lesson 1-6. Algebra Slide Show: Teaching Made Easy As Pi, by James Wenk Identities 5 12 = 12 5 Lesson -6 Objective - To simplify expressions using commutative and associative properties. Commutative - Order doesn t matter! You can flip-flop numbers around an operation. Commutative Property of Addition

More information