14 Equivalence Relations
|
|
|
- Garey King
- 5 years ago
- Views:
Transcription
1 14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term / 10
2 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes 5 Some theorems 6 Partitioning by equivalence classes Tom Lewis () 14 Equivalence Relations Fall Term / 10
3 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Tom Lewis () 14 Equivalence Relations Fall Term / 10
4 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Tom Lewis () 14 Equivalence Relations Fall Term / 10
5 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Equivalence of logical propositions. Tom Lewis () 14 Equivalence Relations Fall Term / 10
6 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Equivalence of logical propositions. Congruence of triangles in geometry. Tom Lewis () 14 Equivalence Relations Fall Term / 10
7 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Equivalence of logical propositions. Congruence of triangles in geometry. Equivalence of systems of equations in linear algebra. Tom Lewis () 14 Equivalence Relations Fall Term / 10
8 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Equivalence of logical propositions. Congruence of triangles in geometry. Equivalence of systems of equations in linear algebra. Equivalence of measureable functions in analysis. Tom Lewis () 14 Equivalence Relations Fall Term / 10
9 The definition Quote Equivalence relations are ubiquitous. They are like the air we breathe; we hardly take notice. Example Equivalence of logical propositions. Congruence of triangles in geometry. Equivalence of systems of equations in linear algebra. Equivalence of measureable functions in analysis. Equivalence of time on the clock. Tom Lewis () 14 Equivalence Relations Fall Term / 10
10 The definition Definition (Equivalence relation) Let R be a relation on a set A. We say R is an equivalence relation provided it is reflexive, symmetric, and transitive. Thus: Tom Lewis () 14 Equivalence Relations Fall Term / 10
11 The definition Definition (Equivalence relation) Let R be a relation on a set A. We say R is an equivalence relation provided it is reflexive, symmetric, and transitive. Thus: ara for all a A. Tom Lewis () 14 Equivalence Relations Fall Term / 10
12 The definition Definition (Equivalence relation) Let R be a relation on a set A. We say R is an equivalence relation provided it is reflexive, symmetric, and transitive. Thus: ara for all a A. arb implies bra for all a, b A. Tom Lewis () 14 Equivalence Relations Fall Term / 10
13 The definition Definition (Equivalence relation) Let R be a relation on a set A. We say R is an equivalence relation provided it is reflexive, symmetric, and transitive. Thus: ara for all a A. arb implies bra for all a, b A. If arb and brc, then arc. Tom Lewis () 14 Equivalence Relations Fall Term / 10
14 Congruence modulo n Definition Let n be a positive integer. We say that the integers x is congruent modulo n to y, denoted by x y (mod n) provided n y x. Tom Lewis () 14 Equivalence Relations Fall Term / 10
15 Congruence modulo n Definition Let n be a positive integer. We say that the integers x is congruent modulo n to y, denoted by x y (mod n) provided n y x. Theorem Let n be a positive integer. The relation {(a, b) Z Z : a b (mod n)} is an equivalence relation. Tom Lewis () 14 Equivalence Relations Fall Term / 10
16 Has-the-same-size-as Definition Let Ω be a set and let P be its power set. Given A, B P, define a relation R on P by (A, B) R provided that A = B. In other words, A and B are related provided that they have the same size. This is called the has-the-same-size-as relation. Tom Lewis () 14 Equivalence Relations Fall Term / 10
17 Has-the-same-size-as Definition Let Ω be a set and let P be its power set. Given A, B P, define a relation R on P by (A, B) R provided that A = B. In other words, A and B are related provided that they have the same size. This is called the has-the-same-size-as relation. Theorem The has-the-same-size-as relation is an equivalence relation. Tom Lewis () 14 Equivalence Relations Fall Term / 10
18 Equivalence classes Definition Let R be an equivalence relation on a set A and let a A. The equivalence class of a, denoted by [a], is the set of all elements of A that are related to a through the relation R; that is, [a] = {x A : xra} Tom Lewis () 14 Equivalence Relations Fall Term / 10
19 Equivalence classes Definition Let R be an equivalence relation on a set A and let a A. The equivalence class of a, denoted by [a], is the set of all elements of A that are related to a through the relation R; that is, [a] = {x A : xra} Problem Finish the theorem: x [a] if and only if... Tom Lewis () 14 Equivalence Relations Fall Term / 10
20 Equivalence classes Problem For the congruence modulo 3 relation, what is the equivalence class of 0? of 1? of 2? of 3? Tom Lewis () 14 Equivalence Relations Fall Term / 10
21 Equivalence classes Problem For the congruence modulo 3 relation, what is the equivalence class of 0? of 1? of 2? of 3? Problem For the has-the-same-size-as relation on the power set of {a, b, c, d, e}, what is the equivalence class of {a, d}? of {b, c, e}? of? Tom Lewis () 14 Equivalence Relations Fall Term / 10
22 Some theorems Theorem Let R be an equivalence relation on a set A and let a A. Then a [a]. Tom Lewis () 14 Equivalence Relations Fall Term / 10
23 Some theorems Theorem Let R be an equivalence relation on a set A and let a A. Then a [a]. Theorem Let R be an equivalence relation on a set A and let a, b A. Then arb if and only if [a] = [b]. Tom Lewis () 14 Equivalence Relations Fall Term / 10
24 Some theorems Theorem Let R be an equivalence relation on a set A and let a A. Then a [a]. Theorem Let R be an equivalence relation on a set A and let a, b A. Then arb if and only if [a] = [b]. Theorem Let R be an equivalence relation on a set A and let a, x, y A. If x, y [a], then xry. (Exercise 14.9) Tom Lewis () 14 Equivalence Relations Fall Term / 10
25 Some theorems Theorem Let R be an equivalence relation on a set A and let a A. Then a [a]. Theorem Let R be an equivalence relation on a set A and let a, b A. Then arb if and only if [a] = [b]. Theorem Let R be an equivalence relation on a set A and let a, x, y A. If x, y [a], then xry. (Exercise 14.9) Theorem Let R be an equivalence relation on a set A and suppose [a] [b]. Then [a] = [b]. Tom Lewis () 14 Equivalence Relations Fall Term / 10
26 Partitioning by equivalence classes Definition A partition of a set A is a collection of nonempty, pairwise disjoint subsets of A whose union is A. Tom Lewis () 14 Equivalence Relations Fall Term / 10
27 Partitioning by equivalence classes Definition A partition of a set A is a collection of nonempty, pairwise disjoint subsets of A whose union is A. Theorem Let R be an equivalence relation on a set A. The equivalence classes of R form a partition of A. Tom Lewis () 14 Equivalence Relations Fall Term / 10
28 Partitioning by equivalence classes Definition A partition of a set A is a collection of nonempty, pairwise disjoint subsets of A whose union is A. Theorem Let R be an equivalence relation on a set A. The equivalence classes of R form a partition of A. Problem Partition the power set of {a, b, c} into the equivalence classes of the has-the-same-size-as relation. Tom Lewis () 14 Equivalence Relations Fall Term / 10
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
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
Part V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
Chapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
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:
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
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
Relations Introduction to Relations 8.2 Properties of Relations. 8.3 Equivalence Relations. mjarrar 2015
9/6/17 Mustafa Jarrar: Lecture Notes in Discrete Mathematics. Birzeit University Palestine 2015 Relations 8.1. Introduction to Relations 8.2 Properties of Relations 8.3 Equivalence Relations mjarrar 2015
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
Chapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler
Chapter VI Relations Assumptions are the termites of relationships. Henry Winkler Studying relationships between objects can yield important information about the objects themselves. In the real numbers,
RED. 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
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
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
Relations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
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
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
Automata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
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
2 Equivalence Relations
2 Equivalence Relations In mathematics, we often investigate relationships between certain objects (numbers, functions, sets, figures, etc.). If an element a of a set A is related to an element b of a
Relations and Equivalence Relations
Relations and Equivalence Relations In this section, we shall introduce a formal definition for the notion of a relation on a set. This is something we often take for granted in elementary algebra courses,
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
BADHAN ACADEMY OF MATHS CONTACT FOR HOMETUTOR, FOR 11 th 12 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC 1.2 RELATIONS CHAPTER AT GLANCE
BADHAN ACADEMY OF MATHS 9804435 CONTACT FOR HOMETUTOR, FOR th 2 th B.B.A, B.C.A, DIPLOMA,SAT,CAT SSC.2 RELATIONS CHAPTER AT GLANCE. RELATIONS : Let A and B be two non- empty sets. A relation from set A
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
MATH 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
Section 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
Introduction to Cryptography CS 355 Lecture 3
Introduction to Cryptography CS 355 Lecture 3 Elementary Number Theory (1) CS 355 Fall 2005/Lecture 3 1 Review of Last Lecture Ciphertext-only attack: Known-plaintext attack: Chosen-plaintext: Chosen-ciphertext:
Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
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.
Deviations from the Mean
Deviations from the Mean The Markov inequality for non-negative RVs Variance Definition The Bienaymé Inequality For independent RVs The Chebyeshev Inequality Markov s Inequality For any non-negative random
Math 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
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 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
Week 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
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
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
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 :
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
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,
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
Part IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
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
5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
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
The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.
The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class
(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics
King Saud University College of Science Department of Mathematics 151 Math Exercises (4.2) Equivalence Relations Malek Zein AL-Abidin 1440 ه 2018 Equivalence Relations DEFINITION 1 A relation on a set
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.
CSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic
Math 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,
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.
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
In mathematics there are endless ways that two entities can be related
CHAPTER 16 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod
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)
Foundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
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
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
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
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
Discrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
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
Relations, Functions & Binary Operations
Relations, Functions & Binary Operations Important Terms, Definitions & Formulae 0 TYPES OF INTERVLS a) Open interval: If a and b be two real numbers such that a b then, the set of all the real numbers
Rings of Residues. S. F. Ellermeyer. September 18, ; [1] m
![Rings of Residues. S. F. Ellermeyer. September 18, ; [1] m](/thumbs/74/70674405.jpg "Rings of Residues. S. F. Ellermeyer. September 18, ; [1] m")
Rings of Residues S F Ellermeyer September 18, 2006 If m is a positive integer, then we obtain the partition C = f[0] m ; [1] m ; : : : ; [m 1] m g of Z into m congruence classes (This is discussed in
2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
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
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
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
Solutions to Section 2.1 Homework Problems S. F. Ellermeyer
Solutions to Section 21 Homework Problems S F Ellermeyer 1 [13] 9 = f13; 22; 31; 40; : : :g [ f4; 5; 14; : : :g [3] 10 = f3; 13; 23; 33; : : :g [ f 7; 17; 27; : : :g [4] 11 = f4; 15; 26; : : :g [ f 7;
2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
MATH 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.
Chapter 3. Betweenness (ordering) A system satisfying the incidence and betweenness axioms is an ordered incidence plane (p. 118).
Chapter 3 Betweenness (ordering) Point B is between point A and point C is a fundamental, undefined concept. It is abbreviated A B C. A system satisfying the incidence and betweenness axioms is an ordered
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 NEW DEFINITION OF NATURAL NUMBERS And its Incidence on Teaching Mathematics Diego Pareja Heredia. Universidad del Quindío. Armenia.
1 A NEW DEFINITION OF NATURAL NUMBERS And its Incidence on Teaching Mathematics Diego Pareja Heredia. Universidad del Quindío. Armenia. Colombia Introduction To go wrong in one's own way is better than
COT3100 SI Final Exam Review
1 Symbols COT3100 SI Final Exam Review Jarrett Wendt Spring 2018 You ve learned a plethora of new Mathematical symbols this semester. Let s see if you know them all and what they re used for. How many
Automata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
7.1 Sampling Error The Need for Sampling Distributions
7.1 Sampling Error The Need for Sampling Distributions Tom Lewis Fall Term 2009 Tom Lewis () 7.1 Sampling Error The Need for Sampling Distributions Fall Term 2009 1 / 5 Outline 1 Tom Lewis () 7.1 Sampling
9. Quantifier-free Equality and Data Structures
9. Quantifier-free Equality and Data Structures The Theory of Equality T E Σ E : {=, a, b, c,..., f, g, h,..., p, q, r,...} uninterpreted symbols: constants a, b, c,... functions f, g, h,... predicates
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
Math 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
Congruences. September 16, 2006
Congruences September 16, 2006 1 Congruences If m is a given positive integer, then we can de ne an equivalence relation on Z (the set of all integers) by requiring that an integer a is related to an integer
Discrete 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
Any Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
Finite Automata and Formal Languages TMV026/DIT321 LP Testing Equivalence of Regular Languages
Finite Automata and Formal Languages TMV026/DIT321 LP4 2012 Lecture 10 Ana Bove April 23rd 2012 Overview of today s lecture: Equivalence of Regular Languages Minimisation of Automata Testing Equivalence
Section 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
REU 2007 Discrete Math Lecture 2
REU 2007 Discrete Math Lecture 2 Instructor: László Babai Scribe: Shawn Drenning June 19, 2007. Proofread by instructor. Last updated June 20, 1 a.m. Exercise 2.0.1. Let G be an abelian group and A G be
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
Tomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
TOPOLOGICAL ASPECTS OF YAO S ROUGH SET
Chapter 5 TOPOLOGICAL ASPECTS OF YAO S ROUGH SET In this chapter, we introduce the concept of transmissing right neighborhood via transmissing expression of a relation R on domain U, and then we study
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
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
1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
Week 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
Lecture 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
D-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 +
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
Statistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
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
1 Chapter 1: SETS. 1.1 Describing a set
1 Chapter 1: SETS set is a collection of objects The objects of the set are called elements or members Use capital letters :, B, C, S, X, Y to denote the sets Use lower case letters to denote the elements:
MATH 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
1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained