This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Math 374, Exam 3 Information 4/17/09, LC 405, 2:30 - 3:20 Exam 3 will be based on: • Sections 3.1 - 3.4, 3.6, and 4.1. • The corresponding assigned homework problems (see http://www.math.sc.edu/ ∼ boylan/SCCourses/374Sp09/374.html) At minimum, you need to understand how to do the homework problems. • Lecture notes: 3/16 - 4/10. Topic List (not necessarily comprehensive): You will need to know how to define vocabulary words/phrases defined in class. § 3.1 : Sets . Terms and objects from this section: Cardinality (size of a set), the empty set ( ∅ : the set with no elements), subsets (proper and improper subsets: if a set S 6 = ∅ , then its only improper subsets are ∅ and S (itself): all other subsets are proper), power set of a set S ( ℘ ( S ) : the set of all subsets of S ; if S is finite, then | ℘ ( S ) | = 2 | S | ), set operations (union, intersection, set difference, complement, cross product), Venn diagrams (as a way to represent relationships between sets). We discussed how to prove identities for expressions involving sets by using set algebra (definitions and properties of the basic set operations) and double-set inclusion: one way to prove that A = B is to first show that A ⊆ B , then to show that B ⊆ A . A set S is countable if it is either finite, or if it can be put into a one-to-one correspondence with the set N of natural numbers. Examples of infinite countable sets include Z (integers) and Q (rationals). The set(rationals)....
View Full Document
- Spring '09
- Natural number, 1 K, Mississippi