Chapter 2 - Relations

Size: px
Start display at page:

Download "Chapter 2 - Relations"

Transcription

1 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 from it. Mathematics alone would occupy me eight million years. Mark Twain A binary relation, R, usually called a relation defined on set S 1, is written arb or (x, y) R, which is pronounced "a is related to b". A relation is a set of ordered pairs. If a is not in relation with b, we write arb. Examples of relations a. x, y, y = x. b. R = {(1, 2), (3, 4), (5, 6)}. c. R is a relation on, in which a and b have the same remainder upon division by 2. So we have {(0, 2), (0, 4),, (1, 3), (1, 5),, (2, 0), }. d. R is a relation on the set of all polygons, arb if a and b have the same number of sides. e. If there are three persons {Bill, John, Mary} and three objects {ball, car, doll} and Bill owns the ball, Mary owns the doll, and John owns the car, then the binary relation, R is owned by is given as R = {(ball, Bill), (doll, Mary), (car, John)}. f. D = {(1, 2), (3, 4), (4, 5), (6, 7)}, (c, d)r(a, b) if d + a = c + b, where (a, b), (c, d) D. It s probably helpful to translate that algebra into words, The sum of the two inner elements equals the sum of the two outer elements. Notice that in this example we have an ordered pair of ordered pairs! The two members of R are ((1, 2), (6, 7)) and ((3, 4), (4, 5)), which can also be written as (1, 2)R(6, 7) and (3, 4)R(4, 5). The word binary refers to the fact that two elements are related. We will only study binary relations. The concept of a binary relation is exemplified by such ideas as is greater than or is equal to in arithmetic, is congruent to and is similar to in geometry, is an element of or is a subset of in set theory. Sometimes relations can be graphed on the Cartesian plane, for example the preceding examples (a), (b), (c) and (f) and sometimes they cannot, for example the preceding examples (d) and (e). If the relation can be graphed on the Cartesian plane, doing so can help understand what is going on. Two ordered pairs are equal if their corresponding components are equal. The Cartesian product of two sets is a set of ordered pairs in which every member of the first set is paired with every member of the second set. 25 HL T8 Sets.indb 25

2 Mathematics HL Topic 8: Sets, Relations and Groups Example Given set A is the numbers {1, 2} and set B is the letters {a, b, c}, A B (pronounced A cross B ), is {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c)}. B A is {(a, 1), (a, 2), (b, 1), (b, 2), (c, 1), (c, 2)}. A B and B A are finite sets, because they have a finite number of elements. The Cartesian product (also written R²) is the set of all points on the Cartesian plane. is an infinite set, because it has a infinite number of elements. A Cartesian product of two finite sets can be represented by a table, with one set as the rows and the other as the columns. The ordered pairs are then the cells of the table. Any subset of the Cartesian product of two sets is a relation. In general A B B A. The number of elements in A B is the number of elements in A times the number of elements in B." In symbols this is written n(a B) = n(a) n(b). Notice that, unfortunately, the symbol " " has two completely different meanings here. There are many ways that relations can be expressed. 1. The elements of the relation can simply be listed. Example: R = {(6, 4), (-1, 0.7)} or R = {(1, 1), (1, 2), (1, 10), (2, 2), (2, 4), (5, 10)}. 2. A formal definition of a set might be used. Example: R = {(x, y) x Z, y Z, x is a factor of y where -2 < x < 5, -4 < y < 5}. 3. Relations can also be given with a set and the description of how the ordered pairs are formed. Example: H = {students in your HL Maths group} and arb means that a and b are of the same age where a, b H. The domain of R consists of all possible first components of the ordered pairs of the relation. The range of R contains all possible second components. 26 HL T8 Sets.indb 26

3 Chapter 2: Relations Exercise B = {12, 3, 4, 5, 6, 1} and mrn if m is a factor of n, where m, n B. a. Determine whether 12R3. b. Determine whether 3R12. c. Give an example for two integers from set B which are in relation and two integers which are not in relation. 2. C = { 6, 1, 0, 4, 12} and mrn if m + n < 10, where m, n C. a. Determine whether 0R4 b. Determine whether 12R4. c. Give an example for two integers from set C which are in relation and two integers which are not in relation. 3. D = {(3, 4), (0, 4), (7, 23)}, (c, d)r(a, b) if d + a = c + b, where (a, b), (c, d) D. a. Determine whether (3, 4)R(0, 4). b. Determine whether (3, 4)R(3, 4). c. Give an example for two elements of set D which are in relation and two elements which are not in relation. Note that an element can, but need not be, in relation with itself. 4. E = {1, 4, 3, 56, 8} and arb means that a and b are co-primes, that is that their greatest common divisor is 1, where a, b E. a. Determine whether 1R4. b. Determine whether 4R56. c. Give an example for two elements of set E which are in relation and two elements which are not in relation. 5. R = {(1, 3), (4, 6), (9, 9)} is a relation. Give an example for two elements of set R which are in relation. 6. Let us define the following relation: xry, if x 2 + y 2 = 1, x, y 핉. Give an example for two real numbers which are in relation and two real numbers which are not in relation. 27 HL T8 Sets.indb 27

4 Mathematics HL Topic 8: Sets, Relations and Groups Properties of relations Reflexive property of relations A reflexive relation is one in which every element relates to itself. Let R be a non-empty relation in a set A. R is reflexive means ara for all a A. Examples The relation (x, y) R if x < y is not reflexive, because < does not include =. The relation (x, y) R if x y is reflexive, because includes =. The relation R = {(1, 1), (2, 2), ( 2, 1)} on set D = {1,2} is reflexive, because 1 and 2 are both related to themselves. The relation R = {(1, 1), (2, 1)} on set D = {1,2 }is not reflexive, because 2 is not related to itself. If a relation can be displayed on the Cartesian plane, the relation is reflexive if for all allowed values of x, the line y = x is on the graph. Symmetric property of relations Let R be a non-empty relation on a set A. If (a, b) R then (b, a) R as well for all a, b A. R is symmetric means that if arb, then bra for all a A. If a relation can be graphed on the Cartesian plane, the relation is symmetric means that all of the points (x, y) are symmetric about the line y = x. Examples {(1, 2), (2, 1), (3, 3)} is symmetric, since (1, 2) and (2, 1) are in the set. {(1, 2), (2, 3), (3, 3)} is not symmetric, since (1, 2) is in the set an (2, 1) is not. 28 HL T8 Sets.indb 28

5 Chapter 2: Relations Exercise 2.2 Are the following relations symmetric? 1. B = {12, 3, 4, 5, 6, 1} and mrn if m is a factor of n, where m, n B. 2. C = {-6, -1, 0, 4, 12} and mrn if m + n < 10, where m, n C. 3. D = {(3, 4), (0, 4), (7, 23)}, (c, d)r(a, b) if d + a = c + b, where (a, b), (c, d) D. 4. E = {1, 4, 3, 56, 8} and arb means that a and b are co-primes, that is that their greatest common factor is 1, where a, b E. Transitive property of relations Let R be a non-empty relation on a set A. We say that : R is transitive if, given arb and brc, then arc for all a, b, c A. Examples {(1, 2), (2, 3), (1, 3)} is transitive, {(1, 2), (2, 3), (1, 1)} is not transitive. Exercise 2.3 Are the following relations transitive? 1. H = {students in your HL Maths group} and arb means that a and b are of the same age where a, b H. 2. H = {students at your school} and arb means that a is at least as tall as b. 3. H = {members of your extended family} and arb means a and b live in the same city. 4. B = {12, 3, 4, 5, 6, 1} and mrn where m, n B if m is a factor of n. 5. C = { 6, 1, 0, 4, 12} and mrn if m, n C and m + n < D = {(3, 4), (0, 4), (7, 23) and (c, d)r(a, b) if (a, b), (c, d) D and d + a = c + b. 7. E = {1, 4, 3, 56, 8} and arb means that a and b are co-primes. 29 HL T8 Sets.indb 29

6 Mathematics HL Topic 8: Sets, Relations and Groups If you need to determine whether a relationship has any of these three properties, remember the simple rule of logic. Only one counter example is needed to show that the property does not hold. To show that the property does hold, you must find a way to show that it holds for all elements or equally for any arbitrary element of the given set. Summary Basic properties of binary relations Property reflexive If ara holds for every a A. symmetric If arb then bra for every a, b A. transitive If arb and brc, then arc for every a, b, c A. Equivalence Relations Medicine makes people ill, mathematics makes them sad, and theology makes them sinful - Martin Luther Introduction In primary school you learnt that in some way...is equivalent to... While in the same way...is not equivalent to HL T8 Sets.indb 30

7 Chapter 2: Relations Later you learnt that 3 2 = 6 4 = 18 12, that is that these fractions are equal or equivalent. You also learnt what it means for two triangles to be similar. All three of these situations are examples of a special type of mathematical relation called an equivalence relation. The concept of an equivalence relation is a way of expressing sameness. In other words it is a generalization of the concept of equality. An equivalence relation on a set partitions the set into disjoint subsets, called equivalence classes. Here are some examples of equivalence classes. If we consider integers, then the equivalence might be even and odd, which is the same as saying that the set of those integers divisible by 2 are equivalent classes and those that when divided by 2 have a remainder of 1 are equivalent. Or if we consider integers, we might decide to consider that those integers divisible by 3 are an equivalence class, that those integers which when divided by 3 have a remainder of 1 are an equivalence class and that those integers which when divided by 3 have a remainder of 2 are an equivalence class. If we consider the set {1, 2, 3, 4, 5, 6, 7, 8, 9}, we might decide to consider {2, 4, 6, 8} is an equivalence class, {1, 9} is an equivalence class and {3, 5, 7} is an equivalence class. If we consider the points in Z + Z +, then we might decide to consider all points on the line y = k for a given k is an equivalence class. For example the points (1, 2), (2, 2), (3, 2), etc. would be equivalent (k = 2) and the points (1, 5), (2, 5), (3, 5), etc. would be equivalent (k = 5). If we consider the points in R R, we might consider all points such that n x < n + 1 for a given integer n are equivalent; that is the Cartesian plane would be divided into vertical bands one unit wide with all points in any one band equivalent to each other. See the figure. y 4 y x x Equivalence classes as vertical bands Equivalence classes as concentric circles 31 HL T8 Sets.indb 31

8 Mathematics HL Topic 8: Sets, Relations and Groups If we consider the points in R R, we might consider all points such that x² + y² = k for a given k R + {0} are equivalent to each other; that is the Cartesian plane would be divided into equivalence classes consisting of the points on concentric circles about the origin. The property of dividing sets into equivalence classes is a very useful feature; so we will study it in detail. An equivalence relation is a relation that is reflexive, symmetric and transitive. Equivalence 1 can be designated by either the symbol or. You will be asked to prove that relations are equivalence relations. To do so you will need to prove that these three properties hold, so it is necessary to memorize these three properties. We suggest the mnemonic RST. Partition of a set A partition of a set A is a collection of non-empty subsets of A (x i i = 1, 2,..., n where n N), such that they are pairwise disjoint 2 and their union is A. In other words, every element in A is contained in exactly one of the partitions. We say that A has been partitioned. Thus, the elements of a partition are like the pieces of a jigsaw puzzle: x 0 x 1 A x 2 x 3... x n Examples for partition of a set 1. If set A contains all students at your school then a partition P is formed by the year levels at your school. 1 The first known mention of the concept of equivalence relations was by Euclid in his book The Elements. Common Notion 1 states: Things which equal the same thing also equal one another, which is a statement of the property transitivity. Unfortunately, he did not mention symmetry or reflexivity. 2 Sets A, B and C are said to be disjoint if A B C =. Sets A, B and C are said to be pairwise disjoint if A B=, B C= and A C=. For example the sets {a, b}, {b, c} and {c, a} are disjoint, because there is no member which is in all three sets, but not pairwise disjoint. 32 HL T8 Sets.indb 32

9 Chapter 2: Relations 2. The four suits (spades, hearts, diamonds, and clubs) are a partition of a deck of playing cards (not counting the Joker). Every card is in one of these suits, and no card is in more than one suit. 3. Suppose A = {1, 2, 3, 4, 5, 6}. The following is a partition of A: Let 핑 + be the set of all positive integers, 핑 the set of all negative integers, and 핑 0 the oneelement set {0}. Then { 핑 +, 핑, 핑 0 } is a partition of the set Z. It has three sets; the first two sets have an infinite number of elements. Z has many other partitions. If we put integers with the same modulus (absolute value) into the same class then we get another partition of 핑 : P = {{0}, {-1, 1}, {2, -2}, etc.}. This partition has an infinite number of sets; each set contains two or one elements. Fundamental theorem of equivalence relations 3 Let A be a non-empty set and R an equivalence relation on A. The equivalence classes of R partition set A. Theorem If R is an equivalence relation on set A, then R induces a partition of A. The members of the partitions are called equivalence classes. Proof Step 1: Every element of A belongs to some equivalence class. If R is an equivalence relation on A, every element x i of A is related to itself, because (x i, x i ) is reflexive. Hence every element belongs to at least one equivalence class therefore every element of x i is contained in the union of the equivalence classes. Step 2: We must show that the equivalence classes are disjoint: for any two different equivalence classes A and B, A is disjoint from B means that A and B have no common element. We will use an indirect proof. Let us assume that C and B have the element y in common. Let c be any element in C and b be any element in B. 3 The fundamental theorem of equivalence relations is also known as the Partition Theorem. 33 HL T8 Sets.indb 33

10 Mathematics HL Topic 8: Sets, Relations and Groups Since c and y are both in C, cry. Since b and y are both in B, yrb. Therefore crb holds by the transitive property. Thus any element of C is in relation with b from B. Consequently, C and B are the same class. So if two equivalence classes have one common element, then they are the same equivalence class. This is a contradiction. So we conclude that our assumption was wrong and that any pair of different equivalence classes is disjoint. To summarize what we have found: Every equivalence relation on set A partitions A into disjoint subsets such that every element of A is in one subset, and two elements are in the same subset if they are in relation to one another. The subsets are called the equivalent classes defined by R. The equivalence class containing element x is designated by [x]. In general the equivalence class representative is not unique. The element that represents an equivalence class does not matter. If set A has a natural order, for example if A is {1, 2, 3, 4}, we will adopt the convention of choosing the first element as the representative. So the equivalence classes of A might be [1] = {1, 4} and [2] = {2, 3}. We will now give some examples of an equivalence relation inducing a partition and we will determine the equivalence classes. Example Let M be the set of polygons. Define R in M such as: arb if a and b have the same number of sides where a, b M. Show that it is an equivalence relation. Answer a, R is reflexive since ara always holds since every polygon has the same number of sides as itself. b. R is symmetric since if a has the same number of sides as b then b also has the same number of sides as a. c. R is transitive since if a has the same number of sides as b and b has the same number as c then a and c also have the same number of sides. Thus R partitions M into an infinite number of equivalence classes (triangles, quadrilaterals, pentagons, hexagons etc.), each having infinite elements. Exercise A = {1, 2, 3, 4} and xry if x + y is even. a. Show that R is an equivalence relation. b. Find the equivalence classes. 34 HL T8 Sets.indb 34

11 Chapter 2: Relations 2. Determine whether R is an equivalence relation on A where A and R defined as follows: a. A = {a, b, c, d} and R = {(a, a), (b, a), (b, b), (c, c), (d, d), (d, c)}. b. A = {1, 2, 3, 4, 5} and R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (3, 1), (2, 3), (3, 3), (4, 4), (3, 2), (5, 5)}. 3. Consider the relation R defined on the set of real numbers such that xry if x > y for all x, y R. Show that R is not an equivalence relation. 4. Consider the relation defined such that (x, y)r(a, b) if [x + y]= [a + b], where x, y, a, b R. Here we mean [z] to be the floor function, the largest integer not exceeding z. a. Show that R is an equivalence relation. b. Find the equivalence classes 5. Define the following relation on 핑 : arb, if a b is divisible by 2 where a, b 핑. Show that R is an equivalence relation and find the equivalence classes. 6. Define the following relation on 핑 : xry, if a b is divisible by 3 where a, b 핑. Assuming that it R is an equivalence relation, find the equivalence classes. 7. A relation R m is defined on Z such that ar m b if m is a divisor of a b where 2 m and a, b 핑. Prove that R m is an equivalence relation for every m N, 2 m. Congruence of integers modulo n Mathematics was hard, dull work. Geography pleased me more. For dancing I was quite enthusiastic. - John James Audubon Modular arithmetic is a system of arithmetic with integers in which numbers wrap around after they reach a certain value, called the modulus. An example in everyday use is the 12-hour clock. 4 Five hours after 3:00 is 8:00, but five hours after 9:00 is 2:00, not 14:00. Equally 30 hours after 3:00 is not 33:00, but 9:00. Since the time wraps around after 12 hours, this is an example of addition modulo 12. In modular arithmetic the result is the remainder after division by the modulus. If two numbers x and y have the same remainder after division by the modulus, m, we say that x is congruent to y modulo m, written x y (mod m), x, y and m Z, m Therefore modular arithmetic is sometimes called clock math. For our purposes we ignore the 24-hour clock and the issue of am and pm. 5 The Swiss mathematician Leonhard Euler (pronounced oiler ) ( ) introduced the idea of congruence modulo n. Modular arithmetic was further advanced by Carl Friedrich Gauss ( ). 35 HL T8 Sets.indb 35

12 Mathematics HL Topic 8: Sets, Relations and Groups Example (mod 3), because 34 and 28 both have the same remainder 1 when divided by 3. That is 34 = , 28= x y (mod m) means x and y have the same remainder on division by m. If two integers x and y have the same remainder after division by the modulus, m, then x y = k m, k. Examples (mod 3), because = 6 = (mod 9) because = 36 = 9 4. To express this we can write m (x y), pronounced m divides x y. m (x y) means x y = k m, k Z, which means x y (mod m) To prove x y (mod m) one normally proves x y = k m, k. Careful! A very similar notation is used to mean something different! When = is used instead of, we mean calculate the remainder. Example 23 (mod 7) = 2 (2 only). For example we might write (4 + 7) (mod 8) = 3. This can also be also written as = 3. We showed in Exercise 7 in the preceding section that for a fixed integer m where 2 m congruence mod m is an equivalence relation in the set Z with m equivalence classes. The equivalence class with respect to the relation of congruence of x mod m, is called the congruence class of x mod m, written [x], where x is the representative of the equivalence class. So [x] is the set of all integers y such that x y mod m. So [x] = {..., x 2m, x m, x, x + m, x + 2m,...}. We call the smallest non-negative integer in [x] r, the residue of x mod m. Since r must be one of the integers 0, 1,..., m 1, each [x] is one of the m classes [0], [1], [2],..., [m 1], which are called the residue classes modulo m. Thus there are exactly m different residue classes mod m and these form a partition of Z. 36 HL T8 Sets.indb 36

13 Chapter 2: Relations Example When m = 5, the equivalence classes (residue classes) under congruence mod 5 are integers which leave a remainder of 0, 1, 2, 3, or 4 upon division by 5. So the equivalence classes of x y (mod 5) are {..., 5, 0, 5, 10, 15,...}, {..., 4, 1, 6, 11, 16,...}, {..., -3, 2, 7, 12, 17,...}, {..., 2, 3, 8, 13, 18,...} and {..., 1, 4, 9, 14, 19,...}. More theorems Theorem R is an equivalence relation on A if and only if R is reflexive and the following property holds: if arb and arc, then brc for every a, b, c A. (Note that this is not transitivity!) Proof Step 1 ( if ): Let us assume that R is an equivalence relation. We have to show R is reflexive and if arb and arc, then brc for every a, b, c A. a. By definition R is reflexive. b. We have to show that if arb and arc then brc for every a, b, c A. For any a, b A if arb then bra since relations are symmetric. We now have bra and arc. By applying the transitive property, we conclude that brc for every a, b, c A. Step 2 ( only if ): Let us assume that R is reflexive and arb and arc implies brc for every a, b, c A. We have to show that R is an equivalence relation. a. Let us choose a, b A such that arb. ara holds for any a A since R is reflexive. We now have arb and ara. Using the given property and letting c a, we know that bra. We have shown that arb implies bra, so we have shown that the symmetric property holds. b. If arb and brc then bra and brc since R is symmetric. If we apply the given property, we get arc. Hence the transitive property holds as well. So we have shown that R is an equivalence relation. Theorem If R A A is reflexive and arb and brc implies cra for every a, b, c A, then R is an equivalence relation. 37 HL T8 Sets.indb 37

14 Mathematics HL Topic 8: Sets, Relations and Groups Proof We have to show that R is symmetric and transitive. a. Let us choose a, c A such that arc. R is reflexive therefore ara for every a A. If ara and arc, then cra by using the given property. So R is symmetric. b. If arb and brc then cra by using the given property. Applying the symmetric property proved in part (a), arc. Therefore R is transitive. Exercise 2.5 Determine whether the following relations are reflexive, symmetric and transitive. If so, find the equivalence classes. 1. arb if a = b where a, b R. 2. mrn if and m, n + and 3 is a factor of m 2 n 2. That is: 3 m 2 n xry if x, y and 2 is a factor of x 2 + y mrn if m, n N + and m n is a perfect square. 5. arb if a and b are co-primes (relative primes) a, b N +. (a and b are co-primes if their greatest common divisor is 1, gcd(a, b) = 1.) 6. (x, y)r(a, b) if x 2 + y 2 = a 2 + b 2 (a, b), (x, y) 핉 핉. 7. arb if a b is even, where a, b R. 8. (x, y)r(a, b) if x, y, a, b R and x + y = a + b. 9. (a, b)r(c, d) if a + b = c + d, where (a, b) ²\{(0, 0)}. 10. (x, y)r(a, b) if x, y, a, b R and [a] = [x], [b] = [y], where [z], the floor function. IB Exam Type Problems 1. The relation R is defined for a, b {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14} by arb if a 2 b 2 (mod n) where n is a fixed positive integer. i. Show that R is an equivalence relation. ii. Determine the equivalence classes when n = HL T8 Sets.indb 38

15 Chapter 2: Relations 2. The relation R is defined on ordered pairs by (a, b)r(c, d) if ad = bc where a, b, c, d R +. i. Show that R is an equivalence relation. ii. Describe, geometrically, the equivalence classes. 3. The relation R is defined on R by xry if x y. Show that R is not an equivalence relation. 4. The relation R is defined on R by xry if x² 4x = y² 4y. i. Prove that R is an equivalence relation. ii. Determine the equivalence classes of R. iii. Find the equivalence class containing only one element. 5. The relation R is defined for x, y Z + such that xry if 2 x 2 y (mod10). i. Show that R is an equivalence relation. ii. Identify all the equivalence classes. 6. Define the relation (x, y) R (a, b) if x² y² = a² b², where (x, y), (a, b) R + R +. i. Prove that R is an equivalence relation on R + R +. ii. Describe geometrically the equivalence class of (0, 0). 7. Consider the relations R 1, R 2 and R 3, represented by the following tables R 1 a b c R 2 d e f R 3 g h i a d g 1 1 b e 1 1 h 1 c 1 1 f 1 i 1 1 (A 1 in the table means that the element in that row is related to the element in that column, e.g. in R 2, d is related to f, but f is not related to d.) i. For each relation, determine whether or not it is an equivalence relation. In each case, justify your answer. ii. For those which are equivalence relations, describe the corresponding equivalence classes. 39 HL T8 Sets.indb 39

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

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

Part IA Numbers and Sets

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)

More information

CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3. Congruences. Congruence: definitions and properties CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

More information

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?

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

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

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

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

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

More information

Chapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler

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,

More information

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?

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

More information

Sets and Motivation for Boolean algebra

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

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

Chapter 1 : The language of mathematics.

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 :

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

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

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

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended

More information

Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.

Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example. Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for

More information

Section Summary. Relations and Functions Properties of Relations. Combining Relations

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

More information

The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.

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

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

Relations and Equivalence Relations

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,

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

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Automata and Languages

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

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

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

3.7 Non-linear Diophantine Equations

3.7 Non-linear Diophantine Equations 37 Non-linear Diophantine Equations As an example of the use of congruences we can use them to show when some Diophantine equations do not have integer solutions This is quite a negative application -

More information

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

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,

More information

Section 0. Sets and Relations

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

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

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

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.

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

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

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

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 RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice

More information

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Binary Operations Groups Axioms Closure Associativity Identity Element Unique Inverse Abelian Groups

More information

Wednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory).

Wednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory). Wednesday, February 21 Today we will begin Course Notes Chapter 5 (Number Theory). 1 Return to Chapter 5 In discussing Methods of Proof (Chapter 3, Section 2) we introduced the divisibility relation from

More information

The Pigeonhole Principle

The Pigeonhole Principle The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,

More information

Notes on Sets, Relations and Functions

Notes on Sets, Relations and Functions PURE MTH 3002 Topology & Analysis III (3246) 2002 Notes on Sets, Relations and Functions These are some notes taken from Mathematical Applications (now Mathematics for Information Technology (MIT)). They

More information

For math conventions used on the GRE, refer to this link:

For math conventions used on the GRE, refer to this link: GRE Review ISU Student Success Center Quantitative Workshop One Quantitative Section: Overview Your test will include either two or three 35-minute quantitative sections. There will be 20 questions in

More information

Modular Arithmetic Instructor: Marizza Bailey Name:

Modular Arithmetic Instructor: Marizza Bailey Name: Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find

More information

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

Math 3201 Unit 1 Set Theory

Math 3201 Unit 1 Set Theory Math 3201 Unit 1 Set Theory Overview In this unit, we will organize information into. We will use diagrams to illustrate between sets and subsets and use to describe sets. We will determine the in each

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

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. Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:

More information

1 Overview and revision

1 Overview and revision MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

More information

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

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.

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

2 Equivalence Relations

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

More information

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings

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

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

Introduction to Cryptography CS 355 Lecture 3

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:

More information

1 Predicates and Quantifiers

1 Predicates and Quantifiers 1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College

More information

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

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 Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic

More information

LESSON RELATIONS & FUNCTION THEORY

LESSON RELATIONS & FUNCTION THEORY 2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular

More information

Writing Assignment 2 Student Sample Questions

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.

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a

More information

Orders and Equivalences

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

More information

Math 2534 Solution to Test 3A Spring 2010

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

More information

Relations, Functions & Binary Operations

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

More information

a the relation arb is defined if and only if = 2 k, k

a the relation arb is defined if and only if = 2 k, k DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element. The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

More information

A NEW DEFINITION OF NATURAL NUMBERS And its Incidence on Teaching Mathematics Diego Pareja Heredia. Universidad del Quindío. Armenia.

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

More information

The set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }

The set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, } Integers and Division 1 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom

More information

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. MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described

More information

MATH Fundamental Concepts of Algebra

MATH Fundamental Concepts of Algebra MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even

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

Mathematics for Computer Scientists

Mathematics for Computer Scientists Mathematics for Computer Scientists Lecture notes for the module G51MCS Venanzio Capretta University of Nottingham School of Computer Science Chapter 6 Modular Arithmetic 6.1 Pascal s Triangle One easy

More information

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635 COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is

More information

Revision Problems for Examination 1 in Algebra 1

Revision Problems for Examination 1 in Algebra 1 Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination 1 in Algebra 1 Arithmetics 1 Determine a greatest common divisor to the integers a) 5431 and 1345, b)

More information

5. Partitions and Relations Ch.22 of PJE.

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

More information

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b

More information

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA

More information

Week 4-5: Binary Relations

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

More information

Part V. Chapter 19. Congruence of integers

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

More information

Algorithms CMSC Basic algorithms in Number Theory: Euclid s algorithm and multiplicative inverse

Algorithms CMSC Basic algorithms in Number Theory: Euclid s algorithm and multiplicative inverse Algorithms CMSC-27200 Basic algorithms in Number Theory: Euclid s algorithm and multiplicative inverse Instructor: László Babai Last updated 02-14-2015. Z denotes the set of integers. All variables in

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.

2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer. CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder

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

MAT115A-21 COMPLETE LECTURE NOTES

MAT115A-21 COMPLETE LECTURE NOTES MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes

More information

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 Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we

More information

Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006 Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 2.4 2.6 of Rosen Introduction I When talking

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Solutions Best Student Exams Texas A&M High School Math Contest November 16, 2013

Solutions Best Student Exams Texas A&M High School Math Contest November 16, 2013 Solutions Best Student Exams Texas A&M High School Math Contest November 6, 20. How many zeros are there if you write out in full the number N = 0 (6 0000) = 0 (6 00) so there are 6 0 0 or N = (000000)

More information

= A. Example 2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {4, 6, 7, 9, 10}, and B = {2, 6, 8, 9}. Draw the sets on a Venn diagram.

= A. Example 2. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {4, 6, 7, 9, 10}, and B = {2, 6, 8, 9}. Draw the sets on a Venn diagram. MATH 109 Sets A mathematical set is a well-defined collection of objects A for which we can determine precisely whether or not any object belongs to A. Objects in a set are formally called elements of

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

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

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas. SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

INTRODUCTION TO THE GROUP THEORY

INTRODUCTION TO THE GROUP THEORY Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher

More information