Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
|
|
|
- Sheryl Clarke
- 5 years ago
- Views:
Transcription
1 Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall / 31
2 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference Set Complement Venn Diagrams Indexed Sets MAT231 (Transition to Higher Math) Sets Fall / 31
3 Definition of set Definition A set is a collection of items, called elements or members. The elements of a set may be abstract: numbers, ideas, concepts physical: numerals, objects We will usually use uppercase letters to name sets, and lower case letters as elements. The symbol denotes membership: x A indicates that x is an element of the set A. Two sets A and B are equal if and only if they have the same elements. That is, A = B if and only if every element in A is contained in B and every element in B is contained in A. MAT231 (Transition to Higher Math) Sets Fall / 31
4 Specifying sets: Enumeration There are many ways to specify a set. The simplest way is to list the elements contained in the set, as in 1, 2, 3. This is called enumeration. We use braces { and } to bracket the list of elements in a set. {1, 2, 3} {t, u, v, w, x, y, z} {, } For sets, membership is all that matters and the order the elements are listed in is insignificant. Thus {a, b, c} is the same set as {c, b, a}. MAT231 (Transition to Higher Math) Sets Fall / 31
5 Specifying sets: Enumeration Listing sets is inconvenient if there are a large number of elements in them. If there is an easy-to-see pattern then an ellipsis can be used. {1, 2, 3,..., 10} {0, 2, 4, 6,...} {..., 5, 3, 1, 1, 3, 5,...} MAT231 (Transition to Higher Math) Sets Fall / 31
6 Specifying sets: Set-builder notation Sets can also be specified using set-builder notation. It provides a expression for a typical element in the set and then one or more membership rules. {x : x is an even integer} {b : b is a butterfly} MAT231 (Transition to Higher Math) Sets Fall / 31
7 Some special sets There are some important sets of numbers, which we now name. N = {1, 2, 3, 4,...} is the set of natural numbers. Z = {..., 3, 2, 1, 0, 1, 2, 3,...} is the set of integers. Q = {x/y : x, y Z, y 0} is the set of rational numbers R is the set of real numbers. It is not possible to specify R using enumeration and using enumeration for Q is extremely cumbersome. Set-builder notation, however, makes specifying Q relatively easy. Another important set is the empty set, denoted {} or. This is the set that contains no elements. MAT231 (Transition to Higher Math) Sets Fall / 31
8 More examples of set-builder notation Here are some more examples using set-builder notation: {3n : n Z} = {..., 6, 3, 0, 3, 6,...} {2 n 1 : n N} = {1, 2, 4, 8, 16,...} {x Z : x 2 < 5} = { 2, 1, 0, 1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math) Sets Fall / 31
9 Cardinality The cardinality of a set is the number of elements in the set. The cardinality of a set X is denoted X. {a, b, c} = 3 {x : x is a letter of the alphabet} = 26 = 0 (this is the only set with cardinality zero) {x Z : x 2 12} = 7 A finite set has a finite number of elements, while a set having infinitely many elements is called an infinite set. The cardinality of a finite set is a number; the cardinality of infinite sets is usually expressed by saying what well known infinite sets have the same cardinality. MAT231 (Transition to Higher Math) Sets Fall / 31
10 Cardinality What are the cardinalities of the following sets: A = {a, {b, c, d}} B = {{a}, {b, c}, d} C = {{a, b, c, d}} D = {{a, b, {c, d}},, { }} MAT231 (Transition to Higher Math) Sets Fall / 31
11 Cardinality What are the cardinalities of the following sets: A = {a, {b, c, d}} A = 2 B = {{a}, {b, c}, d} C = {{a, b, c, d}} D = {{a, b, {c, d}},, { }} MAT231 (Transition to Higher Math) Sets Fall / 31
12 Cardinality What are the cardinalities of the following sets: A = {a, {b, c, d}} A = 2 B = {{a}, {b, c}, d} B = 3 C = {{a, b, c, d}} D = {{a, b, {c, d}},, { }} MAT231 (Transition to Higher Math) Sets Fall / 31
13 Cardinality What are the cardinalities of the following sets: A = {a, {b, c, d}} A = 2 B = {{a}, {b, c}, d} B = 3 C = {{a, b, c, d}} C = 1 D = {{a, b, {c, d}},, { }} MAT231 (Transition to Higher Math) Sets Fall / 31
14 Cardinality What are the cardinalities of the following sets: A = {a, {b, c, d}} A = 2 B = {{a}, {b, c}, d} B = 3 C = {{a, b, c, d}} C = 1 D = {{a, b, {c, d}},, { }} D = 3 MAT231 (Transition to Higher Math) Sets Fall / 31
15 Cartesian products Definition The Cartesian product of two sets A and B is another set, denoted A B whose elements are ordered pairs, defined by A B = {(a, b) : a A, b B} If A = {a, b, c} and B = {0, 1} then A B = {(a, 0), (a, 1), (b, 0), (b, 1), (c, 0), (c, 1)} while B A = {(0, a), (0, b), (0, c), (1, a), (1, b), (1, c)} Recall that the order of elements in a set is unimportant, but the order of elements in a ordered pair is significant. MAT231 (Transition to Higher Math) Sets Fall / 31
16 Cartesian products If we extend the idea of an ordered pair to an ordered triple or even an ordered n-tuple then we can define the Cartesian product of three or more sets: A B C = {(a, b, c) : a A, b B, c C} W X Y Z = {(w, x, y, z) : w W, x X, y Y, z Z} Notice that the following two sets are different. One is the Cartesian product of three sets while the other is the Cartesian product of two sets. One contains ordered triples while the other contains ordered pairs. A B C = {(a, b, c) : a A, b B, c C} A (B C) = {(a, (b, c)) : a A, b B, c C} MAT231 (Transition to Higher Math) Sets Fall / 31
17 Cartesian products as powers of sets In some applications Cartesian products of a set with itself are common. We use the notation A 2 = A A to denote this. In general A n = A A A = {(x 1, x 2,..., x n ) : x 1, x 2,..., x n A} {a, b} 3 = {(a, a, a), (a, a, b), (a, b, a), (a, b, b), (b, a, a), (b, a, b), (b, b, a), (b, b, b)} MAT231 (Transition to Higher Math) Sets Fall / 31
18 Cardinality of Cartesian products Question: What is A B? MAT231 (Transition to Higher Math) Sets Fall / 31
19 Cardinality of Cartesian products Question: What is A B? Answer: A B = A B MAT231 (Transition to Higher Math) Sets Fall / 31
20 Cardinality of Cartesian products Question: What is A B? Answer: A B = A B Justification: Every element from A must be paired with every element from B. MAT231 (Transition to Higher Math) Sets Fall / 31
21 Subsets Definition Suppose A and B are sets. If every element of A is also an element of B then we say A is a subset of B and denote this as A B. If A is not a subset of B we write A B. This means there is at least one element of A that is not contained in B. Which of the following sets are subsets of A = {1, 2, 3, 4, 5, 6}? {2, 4, 6} {0, 1, 2, 3} {1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math) Sets Fall / 31
22 Subsets Definition Suppose A and B are sets. If every element of A is also an element of B then we say A is a subset of B and denote this as A B. If A is not a subset of B we write A B. This means there is at least one element of A that is not contained in B. Which of the following sets are subsets of A = {1, 2, 3, 4, 5, 6}? {2, 4, 6} (is a subset) {0, 1, 2, 3} {1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math) Sets Fall / 31
23 Subsets Definition Suppose A and B are sets. If every element of A is also an element of B then we say A is a subset of B and denote this as A B. If A is not a subset of B we write A B. This means there is at least one element of A that is not contained in B. Which of the following sets are subsets of A = {1, 2, 3, 4, 5, 6}? {2, 4, 6} (is a subset) {0, 1, 2, 3} (is not a subset, 0 not contained in A) {1, 2, 3, 4, 5, 6} MAT231 (Transition to Higher Math) Sets Fall / 31
24 Subsets Definition Suppose A and B are sets. If every element of A is also an element of B then we say A is a subset of B and denote this as A B. If A is not a subset of B we write A B. This means there is at least one element of A that is not contained in B. Which of the following sets are subsets of A = {1, 2, 3, 4, 5, 6}? {2, 4, 6} (is a subset) {0, 1, 2, 3} (is not a subset, 0 not contained in A) {1, 2, 3, 4, 5, 6} (is a subset, equal to A) MAT231 (Transition to Higher Math) Sets Fall / 31
25 Subsets Definition Suppose A and B are sets. If every element of A is also an element of B then we say A is a subset of B and denote this as A B. If A is not a subset of B we write A B. This means there is at least one element of A that is not contained in B. Which of the following sets are subsets of A = {1, 2, 3, 4, 5, 6}? {2, 4, 6} (is a subset) {0, 1, 2, 3} (is not a subset, 0 not contained in A) {1, 2, 3, 4, 5, 6} (is a subset, equal to A) (is a subset - does not contain any element not in A) MAT231 (Transition to Higher Math) Sets Fall / 31
26 The Empty set as a subset The last example leads to an important fact: the empty set is a subset of every set. Thus X for all sets X. We can rephrase set equality in terms of subsets. Two sets A and B are equal if and only if A B and B A. MAT231 (Transition to Higher Math) Sets Fall / 31
27 Listing subsets Suppose L = {w, x, y, z}. List the subsets of L. Clearly is a subset. MAT231 (Transition to Higher Math) Sets Fall / 31
28 Listing subsets Suppose L = {w, x, y, z}. List the subsets of L. Clearly is a subset. {w}, {x}, {y}, and {z} are also subsets of L. MAT231 (Transition to Higher Math) Sets Fall / 31
29 Listing subsets Suppose L = {w, x, y, z}. List the subsets of L. Clearly is a subset. {w}, {x}, {y}, and {z} are also subsets of L. So are {w, x}, {w, y}, {w, z}, {x, y}, {x, z}, and {y, z}. These subsets all have cardinality 2. MAT231 (Transition to Higher Math) Sets Fall / 31
30 Listing subsets Suppose L = {w, x, y, z}. List the subsets of L. Clearly is a subset. {w}, {x}, {y}, and {z} are also subsets of L. So are {w, x}, {w, y}, {w, z}, {x, y}, {x, z}, and {y, z}. These subsets all have cardinality 2. {w, x, y}, {w, x, z}, {w, y, z}, and {x, y, z} are the only subsets with cardinality 3. MAT231 (Transition to Higher Math) Sets Fall / 31
31 Listing subsets Suppose L = {w, x, y, z}. List the subsets of L. Clearly is a subset. {w}, {x}, {y}, and {z} are also subsets of L. So are {w, x}, {w, y}, {w, z}, {x, y}, {x, z}, and {y, z}. These subsets all have cardinality 2. {w, x, y}, {w, x, z}, {w, y, z}, and {x, y, z} are the only subsets with cardinality 3. Finally, the only subset of cardinality 4 is the set L itself: {w, x, y, z}. MAT231 (Transition to Higher Math) Sets Fall / 31
32 Listing subsets While tedious, listing subsets is straightforward: Start with the empty set. List all the singleton subsets (sets with one element). List all possible subsets with two elements. List all possible subsets with three elements. Continue until original set itself is listed as a subset. MAT231 (Transition to Higher Math) Sets Fall / 31
33 Power Sets Definition If A is a set, the power set of A is another set, denoted P(A) and is the set of all subsets of A. P(A) = {X : X A} P({a, b}) = {, {a}, {b}, {a, b}} P({a, b, c}) = {, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}} MAT231 (Transition to Higher Math) Sets Fall / 31
34 Cardinality of power sets Suppose A is a finite set. What is the cardinality of P(A)? Notice that P( ) = 1 (since P( ) = { }) P({a}) = 2 P({a, b}) = 4 P({a, b, c}) = 8 Can you think of a general rule? MAT231 (Transition to Higher Math) Sets Fall / 31
35 Cardinality of power sets Suppose A is a finite set. What is the cardinality of P(A)? Notice that P( ) = 1 (since P( ) = { }) P({a}) = 2 P({a, b}) = 4 P({a, b, c}) = 8 Can you think of a general rule? Fact If A is a finite set, P(A) = 2 A. MAT231 (Transition to Higher Math) Sets Fall / 31
36 Union, Intersection, Difference Definition Suppose A and B are two sets. The union of A and B is the set A B = {x : x A or x B} The intersection of A and B is the set A B = {x : x A and x B} The difference of A and B is the set A B = {x : x A and x / B} (Sometimes A\B is used to denote set difference) MAT231 (Transition to Higher Math) Sets Fall / 31
37 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = A C = B C = A B = A C = B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
38 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = B C = A B = A C = B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
39 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = A B = A C = B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
40 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = A C = B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
41 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
42 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
43 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
44 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
45 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = {0, 1, 2, 3} A C = C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
46 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = {0, 1, 2, 3} A C = {5, 7, 8} C A = B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
47 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = {0, 1, 2, 3} A C = {5, 7, 8} C A = {2} B C = C B = MAT231 (Transition to Higher Math) Sets Fall / 31
48 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = {0, 1, 2, 3} A C = {5, 7, 8} C A = {2} B C = {0, 1, 3} C B = MAT231 (Transition to Higher Math) Sets Fall / 31
49 Operations involving two sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then A B = {0, 1, 2, 3, 4, 5, 6, 7, 8} A C = {2, 4, 5, 6, 7, 8} B C = {0, 1, 2, 3, 4, 6} A B = {4} A C = {4, 6} B C = {2, 4} A B = {5, 6, 7, 8} B A = {0, 1, 2, 3} A C = {5, 7, 8} C A = {2} B C = {0, 1, 3} C B = {6} MAT231 (Transition to Higher Math) Sets Fall / 31
50 Operations involving three or more sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then (A B) (A C) = (A B) (A C) = (A B) (B A) = (A B) (B A) = MAT231 (Transition to Higher Math) Sets Fall / 31
51 Operations involving three or more sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then (A B) (A C) = {2, 4, 5, 6, 7, 8} (A B) (A C) = (A B) (B A) = (A B) (B A) = MAT231 (Transition to Higher Math) Sets Fall / 31
52 Operations involving three or more sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then (A B) (A C) = {2, 4, 5, 6, 7, 8} (A B) (A C) = {4, 6} (A B) (B A) = (A B) (B A) = MAT231 (Transition to Higher Math) Sets Fall / 31
53 Operations involving three or more sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then (A B) (A C) = {2, 4, 5, 6, 7, 8} (A B) (A C) = {4, 6} (A B) (B A) = {0, 1, 2, 3, 5, 6, 7, 8} (A B) (B A) = MAT231 (Transition to Higher Math) Sets Fall / 31
54 Operations involving three or more sets Let A = {4, 5, 6, 7, 8}, B = {0, 1, 2, 3, 4}, and C = {2, 4, 6}. Then (A B) (A C) = {2, 4, 5, 6, 7, 8} (A B) (A C) = {4, 6} (A B) (B A) = {0, 1, 2, 3, 5, 6, 7, 8} (A B) (B A) = MAT231 (Transition to Higher Math) Sets Fall / 31
55 Disjoint sets Two sets are disjoint if they have no elements in common. Another way to say this: Sets A and B are disjoint if A B =. MAT231 (Transition to Higher Math) Sets Fall / 31
56 The Universal Set We can always consider a set to be a subset of another set. In any given situation involving sets, we assume there is a universal set that contains each of our sets as a subset. Consider the sets A = {1, 2, 3}, B = { 1 2, 3 5, 5}, and C = {π, e}. When dealing with only set A, we can use N, Z, Q, or R as the universal set. When dealing with both A and B, we could consider Q or R to be the universal set. When dealing with all three sets we would take R to be the universal set. Often the context will suggest what the universal set should be. MAT231 (Transition to Higher Math) Sets Fall / 31
57 Set Complement Definition Let A be a set with universal set U. The complement of A, denoted A, is the set A = U A. Essentially A is a set of everything not in A. Let A = {x N : x < 10}. We can infer from the definition of A that U = N. Then A = {x N : x 10}. MAT231 (Transition to Higher Math) Sets Fall / 31
58 Venn Diagrams A Venn Diagram can help understand set operations on a small number of sets. Closed regions are used to represent sets. Overlapping regions of two or more sets denote elements common to the sets. A B U Often the rectangle representing the universal set is not drawn. MAT231 (Transition to Higher Math) Sets Fall / 31
59 Venn Diagrams Here are some Venn diagrams of common two-set operations. A B A B A B U A B U A B U A B MAT231 (Transition to Higher Math) Sets Fall / 31
60 Three Set Venn Diagrams Construct a Venn diagram for A (B C) and for A (B C) MAT231 (Transition to Higher Math) Sets Fall / 31
61 Three Set Venn Diagrams Construct a Venn diagram for A (B C) and for A (B C) C A B A (B C) MAT231 (Transition to Higher Math) Sets Fall / 31
62 Three Set Venn Diagrams Construct a Venn diagram for A (B C) and for A (B C) C C A B A B A (B C) A (B C) MAT231 (Transition to Higher Math) Sets Fall / 31
63 Indexed Sets When working with many sets, it is often convenient to use indexed sets. Thus, rather than sets A, B, C, D, E, we might use sets A 1, A 2, A 3, A 4, A 5. We can express the union and intersections of all of these sets as 5 i=1 A i and 5 i=1 A i MAT231 (Transition to Higher Math) Sets Fall / 31
64 Indexed Sets Sometimes an even more general notation is used. Suppose I is any set (including an infinite set). If we use the elements of I as indices then we can have indexed sets A α where α I. A α = {x : x A α for at least one set A α with α I } α I A α = {x : x A α for every set A α with α I } α I MAT231 (Transition to Higher Math) Sets Fall / 31
CSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
1.1 - Introduction to Sets
1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
SET DEFINITION 1 elements members
SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes
2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say
Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it
2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.
SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,
9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
CS100: DISCRETE STRUCTURES
CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to
Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set
Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.
Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
Set and Set Operations
Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to
2.1 Symbols and Terminology
2.1 Symbols and Terminology A is a collection of objects or things. The objects belonging to the are called the, or. - : there is a way of determining for sure whether a particular item is an element of
Chapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
SEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 2-1 Chapter 2 Sets 2.1 Set Concepts Set A collection of objects, which are called elements or members of the set. Listing the elements of a set inside
Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example
Sets Slides by Christopher M. ourke Instructor: erthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction
Discrete Mathematics
Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application
Sets. X. Zhang Dept. of Computer & Information Sciences Fordham University
Sets! X. Zhang Dept. of Computer & Information Sciences Fordham University 1 Outline on sets! Basics!! Specify a set by enumerating all elements!! Notations!! Cardinality!! Venn Diagram!! Relations on
Slides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory
CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T
CS 1200 Discrete Math A.R. Hurson 323 CS Building, Missouri S&T hurson@mst.edu 1 Course Objective: Mathematical way of thinking in order to solve problems 2 Variable: holder. A variable is simply a place
9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
Introduction. Sets and the Real Number System
Sets: Basic Terms and Operations Introduction Sets and the Real Number System Definition (Set) A set is a well-defined collection of objects. The objects which form a set are called its members or Elements.
What is Set? Set Theory. Notation. Venn Diagram
What is Set? Set Theory Peter Lo Set is any well-defined list, collection, or class of objects. The objects in set can be anything These objects are called the Elements or Members of the set. CS218 Peter
2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
11 Sets II Operations
11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric
Figure 1.1: This is an illustration of a generic set and its elements.
Chapter 1 Mathematical Review et theory is now generally accepted as the foundation of modern mathematics, and it plays an instrumental role in the treatment of probability. Unfortunately, a simple description
Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element
Today s Topics. What is a set?
Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed
Definition. A set is a collection of objects. The objects in a set are elements.
Section 1.1: Sets Definition A set is a collection of objects. The objects in a set are elements. Definition A set is a collection of objects. The objects in a set are elements. Examples: {1, cat, ψ} (Sets
Cardinality of Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Cardinality of Sets Fall / 15
Cardinality of Sets MAT Transition to Higher Mathematics Fall 0 MAT (Transition to Higher Math) Cardinality of Sets Fall 0 / Outline Sets with Equal Cardinality Countable and Uncountable Sets MAT (Transition
This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
2/18/14. Uses for Discrete Math in Computer Science. What is discrete? Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.
Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.3) TOPICS Discrete math Set Definition Set Operations Tuples Digital computers are based on discrete units of data (bits). Therefore,
[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
![[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics](/thumbs/82/86066673.jpg "[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics")
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS
2-1Numeration Systems Hindu-Arabic Numeration System Tally Numeration System Egyptian Numeration System Babylonian Numeration System Mayan Numeration System Roman Numeration System Other Number Base Systems
Relational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
Algebraic Expressions
P.1 Algebraic Expressions, Mathematical Models, and Real Numbers P.2 Exponents and Scientific Notation Objectives: Evaluate algebraic expressions, find intersection and unions of sets, simplify algebraic
The Language of Sets and Functions
MAT067 University of California, Davis Winter 2007 The Language of Sets and Functions Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (January 7, 2007) 1 The Language of Sets 1.1 Definition and Notation
Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
A set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N
Mathematical Preliminaries Read pages 529-540 1. Set Theory 1.1 What is a set? A set is a collection of entities of any kind. It can be finite or infinite. A = {a, b, c} N = {1, 2, 3, } An entity is an
Computer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth
Computer Science and Mathematics Part I: Fundamental Mathematical Concepts Winfried Kurth http://www.uni-forst.gwdg.de/~wkurth/csm17_home.htm 1. Mathematical Logic Propositions - can be either true or
MAT 090 Brian Killough s Instructor Notes Strayer University
MAT 090 Brian Killough s Instructor Notes Strayer University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
(Refer Slide Time: 0:19)
Theory of Computation. Professor somenath Biswas. Department of Computer Science & Engineering. Indian Institute of Technology, Kanpur. Lecture-15. Decision Problems for Regular Languages. (Refer Slide
About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
Let A(x) be x is an element of A, and B(x) be x is an element of B.
Homework 6. CSE 240, Fall, 2014 Due, Tuesday October 28. Can turn in at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Given two arbitrary
Relational terminology. Databases - Sets & Relations. Sets. Membership
Relational terminology Databases - & Much of the power of relational databases comes from the fact that they can be described analysed mathematically. In particular, queries can be expressed with absolute
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B
2 Sets. 2.1 Notation. last edited January 26, 2016
2 Sets Sets show up in virtually every topic in mathematics, and so understanding their basics is a necessity for understanding advanced mathematics. As far as we re concerned, the word set means what
This is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS
1 THE FORMALIZATION OF MATHEMATICS by Harvey M. Friedman Ohio State University Department of Mathematics friedman@math.ohio-state.edu www.math.ohio-state.edu/~friedman/ May 21, 1997 Can mathematics be
1 Finite Representations of Languages
1 Finite Representations of Languages Languages may be infinite sets of strings. We need a finite notation for them. There are at least four ways to do this: 1. Language generators. The language can be
Solution: It may be helpful to list out exactly what is in each of these events:
MATH 5010(002) Fall 2017 Homework 1 Solutions Please inform your instructor if you find any errors in the solutions. 1. You ask a friend to choose an integer N between 0 and 9. Let A = {N 5}, B = {3 N
Pre-Calc Unit 1 Lesson 1
Pre-Calc Unit 1 Lesson 1 The Number System and Set Theory Learning Goal: IWBAT write subsets of the rational, real, and complex number system using set notation and apply set operations on sets of numbers.
Set theory is a branch of mathematics that studies sets. Sets are a collection of objects.
Set Theory Set theory is a branch of mathematics that studies sets. Sets are a collection of objects. Often, all members of a set have similar properties, such as odd numbers less than 10 or students in
Closure Properties of CFLs; Introducing TMs. CS154 Chris Pollett Apr 9, 2007.
Closure Properties of CFLs; Introducing TMs CS154 Chris Pollett Apr 9, 2007. Outline Closure Properties of Context Free Languages Algorithms for CFLs Introducing Turing Machines Closure Properties of CFL
CS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
IB Sets and Venn Diagram Questions- Package #1
I Sets and Venn Diagram Questions- Package #1 1. is the set of all the positive integers less than or equal to 12., and C are subsets of. = {1, 2, 3, 4, 6,12} = {odd integers} C = {5, 6, 8} (a) Write down
1 Sets, Fields, and Events
CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection
Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008
MATH-LITERACY MANUAL Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008 1 Real Numbers 1.1 Sets 1 1.2 Constants and Variables; Real Numbers 7 1.3 Operations with Numbers
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
CSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
The Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
A.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
Lecture 25 : Counting DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/28/2011 Lecture 25 : Counting Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Today we start the last topic of the course, counting. For
Chapter 2: Sets. Diana Pell. In the roster method: elements are listed between braces, with commas between the elements
Chapter 2: Sets Diana Pell 2.1: The Nature of Sets Set: any collection of elements. Elements: objects of the set. In the roster method: elements are listed between braces, with commas between the elements
In this section we take an aside from the normal discussion in algebra.
1.5 Set Notation In this section we take an aside from the normal discussion in algebra. We want to take a look at the topic of sets and set notation. The reason we want to do this is so that as we encounter
MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)
MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability) Last modified: September 16, 2004 Reference: Apostol, Calculus, Vol. 2, section 13.19 (attached). The aim
Theory Bridge Exam Example Questions Version of June 6, 2008
Theory Bridge Exam Example Questions Version of June 6, 2008 This is a collection of sample theory bridge exam questions. This is just to get some idea of the format of the bridge exam and the level of
THEORY OF COMPUTATION
THEORY OF COMPUTATION UNIT-1 INTRODUCTION Overview This chapter begins with an overview of those areas in the theory of computation that are basic foundation of learning TOC. This unit covers the introduction
COUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.3 Counting Elements of Disjoint Sets: The Addition Rule Copyright Cengage Learning. All rights reserved. Counting
What is a Set? Set Theory. Set Notation. Standard Sets. Standard Sets. Part 1.1. Organizing Information
Set Theory What is a Set? Part 1.1 Organizing Information What is a Set? Set Notation A set is an unordered collection of objects The collection objects are also called members or "elements" One of the
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
Algorithm. Algorithm Analysis. Algorithm. Algorithm. Analyzing Sorting Algorithms (Insertion Sort) Analyzing Algorithms 8/31/2017
8/3/07 Analysis Introduction to Analysis Model of Analysis Mathematical Preliminaries for Analysis Set Notation Asymptotic Analysis What is an algorithm? An algorithm is any well-defined computational
LECTURE NOTES ON SETS
LECTURE NOTES ON SETS PETE L. CLARK Contents 1. Introducing Sets 1 2. Subsets 5 3. Power Sets 5 4. Operations on Sets 6 5. Families of Sets 8 6. Partitions 10 7. Cartesian Products 11 1. Introducing Sets
Section Sets and Set Operations
Section 6.1 - Sets and Set Operations Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
Sets. {1, 2, 3, Calvin}.
ets 2-24-2007 Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems
Notes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia
Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric
LECTURE 8: SETS. Software Engineering Mike Wooldridge
LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is
TOPICS. Integers Properties of addition and. Rational Numbers Need for rational numbers. Exponents or Powers Introduction to Exponents or
TOPICS DETAILS Integers Properties of addition and subtraction of integers Multiplication of integers Properties of multiplication of integers Division of integers Properties of division of integers Introduction
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or elements of the set. a) Use capital letters to stand for sets
Counting. Rosen, Chapter 6 Walls and Mirrors, Chapter 3
Counting Rosen, Chapter 6 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n planets in the solar system can only visit k
Sets and set operations
CS 44 Discrete Mathematics for CS Lecture Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 3: Due today Homework 4: Due next week on Friday,
CHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
Figure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets
2.3. VENN DIAGRAMS & SET OPERATIONS In this section we introduce Venn diagrams and define four basic operations on sets. We also present some important properties related to these operations. Venn Diagrams
III. Supplementary Materials
III. Supplementary Materials The Three Hour Tour Through Automata Theory Analyzing Problems as Opposed to Algorithms In CS336 you learned to analyze algorithms. This semester, we're going to analyze problems.
Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore
Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore Lecture - 5 Elementary concepts and basic counting principles So, welcome
1.1. Real Number System Numbers, Numbers,... My Notes ACTIVITY
Real Number System Numbers, Numbers,... SUGGESTED LEARNING STRATEGIES: Activating Prior Knowledge, Graphic Organizer, Quickwrite, Think/Pair/Share Your teacher will use a Venn diagram to help you understand
CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN. Lecture 1: Introduction
CS314: FORMAL LANGUAGES AND AUTOMATA THEORY L. NADA ALZABEN Lecture 1: Introduction Introduction to the course 2 Required Text Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, BY MICHAEL
CSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
Lecture - 8A: Subbasis of Topology
Lecture - 8A: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline 1 Introduction 2 3 4 Introduction I As we know that topology generated by a basis B may
Fundamental Mathematical Concepts Math 107A. Professor T. D. Hamilton
Fundamental Mathematical Concepts Math 107A Professor T. D. Hamilton January 17, 2007 2 Contents 1 Set Theory 7 What is a set?.......................................... 7 Describing a Set.........................................
Review of Mathematical Concepts
Review of Mathematical Concepts Sets. What is a Set? A set is simply a collection of objects. The objects (which we call the elements or members of the set) can be anything: numbers, people, fruits, whatever.
Sets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
Discrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
Question7.How many proper subsets in all are there if a set contains (a) 7 elements (b) 4 elements
Question1. Write the following sets in roster form: 1. A={z: z=3x-8, x W and x0 and x is a multiple of 3 less than 100} Question2. Write the following
1.2 Venn Diagrams and Partitions
1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for
CMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of