Ang aking kontrata: Ako, si, ay nangangakong magsisipag mag-aral hindi lang para sa aking sarili kundi para rin sa aking pamilya, para sa aking
|
|
- Cathleen Copeland
- 5 years ago
- Views:
Transcription
1 Ang aking kontrata: Ako, si, ay nangangakong magsisipag mag-aral hindi lang para sa aking sarili kundi para rin sa aking pamilya, para sa aking bayang Pilipinas at para sa ikauunlad ng mundo.
2 Mathematics Division, IMSP, UPLB
3 Learning Objectives: Set Relations Upon completion you should be able to identify set relations such as equality subset and superset equivalence Mathematics Division, IMSP, UPLB
4 Equal Sets Set Relations Two sets A and B are equal if and only if they have the same elements. Example: Let A = {1, 3, 5, 7, 9} and B = {3, 5, 1, 9, 7}. Are all the elements in A also in B? Are all the elements in B also in A? YES! Therefore A and B have the same elements. Sets A and B are. Mathematics Division, IMSP, UPLB
5 Equal Sets Set Relations If sets A and B are equal, we write A=B. Otherwise, we write A B. Example: Let C = {1, 2, 3, 4} and D = {1, 2, 2, 3, 4, 4}. Are all the elements in C also in D? Are all the elements in D also in C? YES! Therefore C = D. Mathematics Division, IMSP, UPLB
6 Equal Sets Set Relations REMEMBER: 1. IN A SET, IT IS CUSTOMARY TO LIST AN ELEMENT ONLY ONCE. 2. IN A SET, THE ORDER OF LISTING THE ELEMENTS DOES NOT MATTER. 3. TWO SETS ARE EQUAL IF AND ONLY IF THEY HAVE THE SAME ELEMENTS. Mathematics Division, IMSP, UPLB
7 Subsets and Supersets Set Relations If all elements of set A are also elements of set B, we say, A is a subset of B (or B is a superset of A). Example: Let S be the set of all students in this room. Let B be the set of all boys in this room. Let G be the set of all girls in this room with age less than 16. Is B a subset of S? Is G a subset of S? Mathematics Division, IMSP, UPLB
8 Subsets and Supersets U Set Relations B G S Mathematics Division, IMSP, UPLB
9 Subsets and Supersets TIME TO THINK! 1. Is U always a superset? Set Relations 2. Is a set a subset of itself? 3. Is a set a superset of itself? 4. Do you think { } is a subset of any set? 5. Do you think { } is a superset of any set? Mathematics Division, IMSP, UPLB
10 Subset Set Relations If A is a subset of B, we write A B. In our previous example, S is the set of all students in this room. B is the set of of all boys in this room. G is the set of all girls in this room with age less than 16. B S and G S. However, B is not a subset of G. Why? In this case, we write B G. Mathematics Division, IMSP, UPLB
11 Subset Set Relations Suppose A is a non-empty set. If A B and A B, then we call A a proper subset of B. If A = {, } and B = {,,, } then A is a proper subset of B and we may write A B or A B. Mathematics Division, IMSP, UPLB
12 Subset Set Relations There are only two improper subsets. The empty set and the set itself. If A = {, } and B = {,,, } then {} and A are improper subsets of A and we write {} A and A A. {} and B are improper subsets of B and we write {} B and B B. Mathematics Division, IMSP, UPLB
13 Subset Set Relations SUBSETS OF SET J PROPER IMPROPER Empty set Set J Mathematics Division, IMSP, UPLB
14 Subset Set Relations Always True, Sometimes True or False: Let A, B, and C be sets. 1. A A 2. A A (Reflexive Property) 3. If A B then B A 4. If A B then B A 5. If A B and B C then A C (Transitive Property) 6. {} A 7. {} {} 8. A U Mathematics Division, IMSP, UPLB
15 Subset Set Relations Determine if proper or improper subset of {1,2,3,4,5}: 1. {1,2} 2. {4} 3. {1,2,3,4,5} 4. {2,3,4} 5. {} Mathematics Division, IMSP, UPLB
16 Set Relations ALTERNATIVE DEFINITION OF EQUALITY OF SETS A=B if and only if A B and B A. Mathematics Division, IMSP, UPLB
17 Set Equivalence Set Relations What can you observe about the following pairs of sets? A = {1, 2, 3, 4, 5} B = {a, e, i, o,u} C = {guava, melon, avocado} D = {do, re, mi} Mathematics Division, IMSP, UPLB
18 Set Equivalence Two sets are in 1-1 correspondence if it is possible to pair each element of A with exactly one element of B, and each element of B with exactly one element of A. It follows that A and B have the same size or number of elements. When two sets A and B are in 1-1 correspondence, we say they are equivalent and we write A B. Thus, in our example, A B and C D. Is A C? Why? Mathematics Division, IMSP, UPLB Set Relations
19 Set Relations Set Equivalence 1-1 Correspondence 1 a 20 b 3 c THEY ARE EQUIVALENT Mathematics Division, IMSP, UPLB
20 Set Relations Set Equivalence 1-1 Correspondence 1 a 20 b 3 c THEY ARE EQUIVALENT Mathematics Division, IMSP, UPLB
21 Set Equivalence Set Relations Does the following exhibits 1-1 Correspondence? Are they equivalent? a b c d Mathematics Division, IMSP, UPLB
22 Set Equivalence Set Relations Does the following exhibits 1-1 Correspondence? Are they equivalent? a b c d Mathematics Division, IMSP, UPLB
23 Example Is there a one-to-one correspondence between the set of days in a week and the set of counting numbers from 2 to 8? YES M T W Th F Sa Su THEY ARE EQUIVALENT
24 Example Is there a one-to-one correspondence between the set of days in a week and the set of months in a year? NO THEY ARE NOT EQUIVALENT
25 Example Is there a one-to-one correspondence between the set of even counting numbers and the set of odd counting numbers? YES THEY ARE EQUIVALENT
26 Set Equivalence Set Relations Time to think: 1. Are all equal sets equivalent? 2. Are all equivalent sets equal? 3. Can a set be equivalent to any of its subsets? 4. Can a set be equal to any of its subsets? Mathematics Division, IMSP, UPLB
27 Set Relations Exercise For each of the sets listed below, tell which are equivalent and which are also equal. 1. The set of distinct letters in the word katakataka 2. The set {a,k,t,k} 3. The set of distinct letters in the word tatak 4. The set {k,t,a} 5. The set {k,a,r} Mathematics Division, IMSP, UPLB
28 Summary Set Relations In this section, we learned When two sets are equal or not When a set is a subset or superset of another When two sets are equivalent or not Mathematics Division, IMSP, UPLB
29
30 QUESTION: IN SET THEORY, Is countable and finite the same? Is uncountable and infinite the same?
31 CARDINALITY Cardinality of a set is a measure of the size or the number of elements of the set. What is the cardinality of { }?
32 COUNTING, 1-1 CORRESPONDENCE AND CARDINALITY SET OF NATURAL/ COUNTING NUMBERS SET J a b c
33 COUNTING, 1-1 CORRESPONDENCE AND CARDINALITY The cardinality of set J is J = n(j) = 3
34 CARDINALITY AND SET EQUIVALENCE Two sets are equivalent if they have the same cardinality.
35 COUNTABLE SET A set where you can have 1-1 correspondence with a subset of natural/counting numbers is countable. Otherwise, it is uncountable.
36 COUNTABLE SET Question: Is the set of positive even integers countable?
37 COUNTABLE SET YES! This is called countably infinite!
38 FINITE AND INFINITE SET A set is finite if it has a cardinality equal to a counting/natural number. Example: n(j)=3 All finite sets are countable!
39 FINITE AND INFINITE SET A set is finite if your counting ends. A set is finite if after listing all the elements, there is a last element. Example:{a,b,c,d,e} Counterexample:{1,2,3,4,5, }
40 FINITE AND INFINITE SET A set is infinite if it is not finite. Example: The set of natural/counting numbers {1,2,3, } has infinitely many elements, hence it is an infinite set. But, it is countable!
41 FINITE AND INFINITE SET Example: The set of positive even integers does not have cardinality equal to a natural/counting number, so it is infinite. But it can have a 1-1 correspondence with the set of natural/counting number so it is countable.
42 FINITE AND INFINITE SET Example of uncountable infinite set: The set of real numbers (because we cannot have a 1-1 correspondence between the set of reals and the set of counting numbers)
43 Summary Infinite sets can be countable or uncountable. All uncountable sets are infinite sets. But not all infinite sets are uncountable.
44 FINITE AND INFINITE SET Exercise: Determine if FINITE or INFINITE, and if COUNTABLE or UNCOUNTABLE 1) Set of points in a circle 2) Set of counting numbers between 1 and ) Set of real numbers between 0 and 1 4) The set of all sands in Boracay beach
45 FYI The cardinality of the set of natural/counting numbers is ℵ 0 (aleph-null). The cardinality of the set of real numbers is ℵ 1 (alephone) or c (for continuum). Note: ℵ 0 and ℵ 1 are not real numbers.
46 TRIVIA Can a set be equivalent to one of its proper subset? YES! When would this happen? If the set is infinite. Can you give an example? N~E.
47 The concept of INFINITY is mysterious. You may read some articles about this concept on the internet
MATH 17: College Algebra and Trigonometry. Lecturer: Jomar Fajardo Rabajante 1st Semester AY Math Division, IMSP, UPLB
Ang aking kontrata: Ako, si, ay nangangakong magsisipag mag-aral hindi lang para sa aking sarili kundi para rin sa aking pamilya, para sa aking bayang Pilipinas at para sa ikauunlad ng mundo. MATH 17:
More informationSlides 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,
More informationSET 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
More information2 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
More informationCardinality 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
More informationInfinity and Uncountability. Countable Countably infinite. Enumeration
Infinity and Uncountability. Countable Countably infinite. Enumeration How big is the set of reals or the set of integers? Infinite! Is one bigger or smaller? Same size? Same number? Make a function f
More informationDefinition. 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
More informationCardinality of Sets. Washington University Math Circle 10/30/2016
Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,
More informationTaibah 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.
More informationSection 1.7 Sequences, Summations Cardinality of Infinite Sets
Section 1.7 Sequences, Summations Cardinality of Infinite Sets Definition: A sequence is a function from a subset of the natural numbers (usually of the form {0, 1, 2,... } to a set S. Note: the sets and
More informationSection 2.4 Sequences and Summations
Section 2.4 Sequences and Summations Definition: A sequence is a function from a subset of the natural numbers (usually of the form {0, 1, 2,... } to a set S. Note: the sets and {0, 1, 2, 3,..., k} {1,
More information2.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
More informationSets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference
More informationCantor s Diagonal Argument for Different Levels of Infinity
JANUARY 2015 1 Cantor s Diagonal Argument for Different Levels of Infinity Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes develop the classic Cantor
More informationSets 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
More informationThe Size of the Cantor Set
The Size of the Cantor Set Washington University Math Circle November 6, 2016 In mathematics, a set is a collection of things called elements. For example, {1, 2, 3, 4}, {a,b,c,...,z}, and {cat, dog, chicken}
More informationChapter 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
More informationMATHEMATICS 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
More informationCalculating Cardinalities
Math Circle Monday March 20, 2017 Calculating Cardinalities Martin Zeman To say that a set A has 5 elements means that we can write the elements of A as a list a 1, a 2, a 3, a 4, a 5 in a way that (a)
More information1 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
More informationMaterial from Recitation 1
Material from Recitation 1 Darcey Riley Frank Ferraro January 18, 2011 1 Introduction In CSC 280 we will be formalizing computation, i.e. we will be creating precise mathematical models for describing
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationCHAPTER 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
More information2.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
More informationSet 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
More informationLecture 1. 1 Notation
Lecture 1 (The material on mathematical logic is covered in the textbook starting with Chapter 5; however, for the first few lectures, I will be providing some required background topics and will not be
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationNumber System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value
1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural
More informationA 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
More information9.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
More informationFinal Test in MAT 410: Introduction to Topology Answers to the Test Questions
Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting
More informationMath 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
More informationCS100: 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
More information11,23,35,47 B) 1 is a multiple of 12
Where applicable, indicates that none of the above answers is correct. 1. Let X x x 1 is a multiple of 3 and 5 and 1 is a multiple of 4 Find XY. Y y y y. 11,23,35,47 B) 1 is a multiple of 12 A) z z C)
More informationSection 1.1. Inductive Reasoning. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 1.1 Inductive Reasoning What You Will Learn Inductive and deductive reasoning processes 1.1-2 Natural Numbers The set of natural numbers is also called the set of counting numbers. N = {1, 2, 3,
More informationReview 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
More informationEXERCISE Which of the following is irrational? (C) 7 (D) 81 (A) (B)
EXERCISE Write the correct answer in each of the following:. Every rational number is a natural number an integer (C) a real number (D) a whole number. Between two rational numbers there is no rational
More informationProof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory
Proof Techniques Alphabets, Strings, and Languages Foundations of Computer Science Theory Proof By Case Enumeration Sometimes the most straightforward way to prove that a property holds for all elements
More information1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
More informationSolution : a) C(18, 1)C(325, 1) = 5850 b) C(18, 1) + C(325, 1) = 343
DISCRETE MATHEMATICS HOMEWORK 5 SOL Undergraduate Course College of Computer Science Zhejiang University Fall-Winter 2014 HOMEWORK 5 P344 1. There are 18 mathematics majors and 325 computer science majors
More informationComplexity 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
More informationSection 1.1. Inductive Reasoning. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 1.1 Inductive Reasoning What You Will Learn Inductive and deductive reasoning processes 1.1-2 Natural Numbers The set of natural numbers is also called the set of counting numbers. N = {1, 2, 3,
More information2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R).
2. Functions, sets, countability and uncountability I. Functions Let A, B be sets (often, in this module, subsets of R). A function f : A B is some rule that assigns to each element of A a unique element
More informationCS 341 Homework 1 Basic Techniques
CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}
More informationSETS. 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,
More informationGrade 6 Math Circles Winter February 3/4 Sets. Some of These Things Are Not Like the Others
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Winter 2015 - February 3/4 Sets Some of These Things Are Not Like the Others When
More informationRelational 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
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All
More informationSource of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D.
Source of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman And Introduction to Languages and The by J. C. Martin Basic Mathematical
More informationCSE 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
More informationMITOCW watch?v=kz7jjltq9r4
MITOCW watch?v=kz7jjltq9r4 PROFESSOR: We're going to look at the most fundamental of all mathematical data types, namely sets, and let's begin with the definitions. So informally, a set is a collection
More informationLet 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
More informationYour Turn: Explain why each of the following sets are, or are not, well defined:
Set Concepts Terminology of Sets A set is a well-defined, unordered collection of objects having no duplicate members. When we use the term well-defined set, we mean that membership in the collection is
More informationMath 187 Sample Test II Questions
Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!
More informationTopology - I. Michael Shulman WOMP 2004
Topology - I Michael Shulman WOMP 2004 1 Topological Spaces There are many different ways to define a topological space; the most common one is as follows: Definition 1.1 A topological space (often just
More informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More informationThis 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
More informationCS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia
CS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia Gabriel Robins Please start solving these problems immediately, and work in study groups.
More information1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.
May 9, 2003 Show all work Name There are 260 points available on this test 1 (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying where
More information1 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
More informationModular Arithmetic. Marizza Bailey. December 14, 2015
Modular Arithmetic Marizza Bailey December 14, 2015 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 a quicker
More informationPre-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.
More informationWhat Is A Relation? Example. is a relation from A to B.
3.3 Relations What Is A Relation? Let A and B be nonempty sets. A relation R from A to B is a subset of the Cartesian product A B. If R A B and if (a, b) R, we say that a is related to b by R and we write
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More informationReview of Operations on the Set of Real Numbers
1 Review of Operations on the Set of Real Numbers Before we start our jurney through algebra, let us review the structure of the real number system, properties of four operations, order of operations,
More informationSEVENTH 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
More informationUniversity of Toronto Department of Mathematics
University of Toronto Department of Mathematics MAT332H1F, Graph Theory Midterm, October 21, 2014 Instructor: Kasra Rafi First Last Student Number Instructions: No aids allowed. Write solutions on the
More informationProblem One: A Quick Algebra Review
CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning
More informationGrade 6 Math Circles Winter February 3/4 Sets. Some of These Things Are Not Like the Others
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Winter 2015 - February 3/4 Sets Some of These Things Are Not Like the Others When
More informationCSE 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
More informationSolutions to In Class Problems Week 9, Fri.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science November 4 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 4, 2005, 1254 minutes Solutions
More informationMITOCW watch?v=4dj1oguwtem
MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive
More informationDiscrete Structures. Fall Homework3
Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)
More information[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 {
More informationCSE 120. Computer Science Principles
Adam Blank Lecture 17 Winter 2017 CSE 120 Computer Science Principles CSE 120: Computer Science Principles Proofs & Computation e w h e q 0 q 1 q 2 q 3 h,e w,e w,h w,h q garbage w,h,e CSE = Abstraction
More informationTheory of Computation
Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s
More informationMAT 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
More informationDiscrete 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
More informationCSE 131 Introduction to Computer Science Fall 2016 Exam I. Print clearly the following information:
CSE 131 Introduction to Computer Science Fall 2016 Given: 29 September 2016 Exam I Due: End of Exam Session This exam is closed-book, closed-notes, no electronic devices allowed The exception is the "sage
More informationChapter 3: Theory of Modular Arithmetic 1. Chapter 3: Theory of Modular Arithmetic
Chapter 3: Theory of Modular Arithmetic 1 Chapter 3: Theory of Modular Arithmetic SECTION A Introduction to Congruences By the end of this section you will be able to deduce properties of large positive
More informationInfinity part I. High School Circle I. June 4, 2017
Infinity part I High School Circle I June 4, 2017 1. For the next few classes, we are going to talk about infinite sets. When we talk about infinite sets, we have to use a very special language, and set
More informationMATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).
MATH 139 W12 Review 1 Checklist 1 Exam Checklist 1. Introduction to Predicates and Quantified Statements (chapters 3.1-3.4). universal and existential statements truth set negations of universal and existential
More information1 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
More informationPhil 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
More informationLattice Tutorial Version 1.0
Lattice Tutorial Version 1.0 Nenad Jovanovic Secure Systems Lab www.seclab.tuwien.ac.at enji@infosys.tuwien.ac.at November 3, 2005 1 Introduction This tutorial gives an introduction to a number of concepts
More information2.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
More informationCSE 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
More informationExercises for Discrete Maths
Exercises for Discrete Maths Discrete Maths Teacher: Alessandro Artale Teaching Assistants: Elena Botoeva, Daniele Porello http://www.inf.unibz.it/~artale/dml/dml.htm Week 6 Computer Science Free University
More informationFundamental 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.........................................
More informationRegarding Python level necessary for the course
Logistics First two recitations (next two weeks) Python basics (installation, basic syntax, basic programming), optional Making models for 3D printing w/ Blender Will announce details through Sakai Regarding
More information9/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
More informationThe RAM Computation Model
Department of Computer Science and Engineering Chinese University of Hong Kong This is not a programming course. Take-away message 1 from this course Programming is the last step in software development,
More informationFRACTIONS A PLENTY BY JAMES D. NICKEL
Let s consider this problem. It takes Mr. Swift of an hour (0 minutes) to run around blocks at home while at the local YMCA it takes him of an hour (0 minutes) to run the same distance (there are no red
More informationRelational 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
More information1/12/2012. Jim Williams HONP-112 Week 3
Jim Williams HONP-112 Week 3 Set Theory is a practical implementation of Boolean logic that examines the relationships between groups of objects. Set theory has numerous real-life applications in computer
More informationCS3102 Theory of Computation Solutions to Problem Set 1, Spring 2012 Department of Computer Science, University of Virginia
CS3102 Theory of Computation Solutions to Problem Set 1, Spring 2012 Department of Computer Science, University of Virginia Gabriel Robins Please start solving these problems immediately, and work in study
More informationIf you are going to form a group for A2, please do it before tomorrow (Friday) noon GRAMMARS & PARSING. Lecture 8 CS2110 Spring 2014
1 If you are going to form a group for A2, please do it before tomorrow (Friday) noon GRAMMARS & PARSING Lecture 8 CS2110 Spring 2014 Pointers. DO visit the java spec website 2 Parse trees: Text page 592
More informationProjective geometry and the extended Euclidean plane
Chapter 2 Projective geometry and the extended Euclidean plane Math 4520, Fall 2017 As we can see from Hilbert s treatment, a completely worked out axiom system for geometry in the plane is quite complicated.
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationNotes for Lecture 20
U.C. Berkeley CS170: Intro to CS Theory Handout N20 Professor Luca Trevisan November 13, 2001 Notes for Lecture 20 1 Duality As it turns out, the max-flow min-cut theorem is a special case of a more general
More information