Finite Math Section 6_1 Solutions and Hints

Similar documents
1.1 Introduction to Sets

4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall Set-builder notation (a more precise way of describing a set)

Exclusive Disjunction

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Spring

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Finite Math Section 4_1 Solutions and Hints

3.4 Set Operations Given a set A, the complement (in the Universal set U) A c is the set of all elements of U that are not in A. So A c = {x x / A}.

1 Chapter 1: SETS. 1.1 Describing a set

A set is an unordered collection of objects.

We ll start today by learning how to change a decimal to a fraction on our calculator! Then we will pick up our Unit 1-5 Review where we left off!

Discrete Basic Structure: Sets

Unit 1 Day 1. Set Operations & Venn Diagrams

Sets. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

HW 4 SOLUTIONS. , x + x x 1 ) 2

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

The universal set is the set of all possible elements of set used in the problem. Denoted by U

Math 3338: Probability (Fall 2006)

CHAPTER 1. Preliminaries. 1 Set Theory

= 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.

The objects in a set are the elements or members of the set. Always enclose the elements of a set in curly brackets. is read is an element of

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

With Question/Answer Animations. Chapter 2

PREFACE. Synergy for Success in Mathematics 7 is designed for Grade 7 students. The textbook

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 builder notation: Describe the set in terms of its properties, Chapter 1: SETS AND PROBABILITY. 1.1 Introduction to Sets

CISC 1100: Structures of Computer Science

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.

Step-by-step and detailed demonstrations of how a specific concept or technique is applied in solving problems.

CHAPTER 1 SETS AND EVENTS

Logic, Sets, and Proofs

CSE 20 DISCRETE MATH. Winter

Chapter 2 - Basics Structures

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions

Math 3201 Unit 1 Set Theory

Welcome to CS103! Three Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation

CM10196 Topic 2: Sets, Predicates, Boolean algebras

Solving Quadratic & Higher Degree Inequalities

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. College Algebra for STEM

Worksheet on Relations

Introduction to Set Operations

Basic Set Concepts (2.1)

SETS AND FUNCTIONS JOSHUA BALLEW

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

A B is shaded A B A B

SETS. JEE-Mathematics

1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS

Welcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation

Chapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability

CS 173: Discrete Structures. Eric Shaffer Office Hour: Wed. 1-2, 2215 SC

Sets McGraw-Hill Education

Topic 5! Venn Diagrams

Notes on the Point-Set Topology of R Northwestern University, Fall 2014

Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.

Today s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions

Sets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman

Sec$on Summary. Definition of sets Describing Sets

Chapter 1 Math Set: a collection of objects. For example, the set of whole numbers is W = {0, 1, 2, 3, }

Introduction to Proofs

If you have completed your extra credit opportunity, please place it on your inbox.

Lecture 5: closed sets, and an introduction to continuous functions

Sets. your school. A group of odd natural numbers less than 25.

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

Axioms of Probability

MGF 1106: Exam 1 Solutions

CSE 20 DISCRETE MATH WINTER

Mathematics Foundation for College. Lesson Number 1. Lesson Number 1 Page 1

Lecture 1 : The Mathematical Theory of Probability

Homework 1 2/7/2018 SOLUTIONS Exercise 1. (a) Graph the following sets (i) C = {x R x in Z} Answer:

MATH 118 FINAL EXAM STUDY GUIDE

Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:

Grade 7/8 Math Circles Sets and Venn Diagrams February 6, 2014

Ch. 3 Equations and Inequalities

Toss 1. Fig.1. 2 Heads 2 Tails Heads/Tails (H, H) (T, T) (H, T) Fig.2

T (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,

CSE 20 DISCRETE MATH SPRING

CSE 20 DISCRETE MATH WINTER

Perfect Mathematics - II

Chapter 0: Sets and Numbers

CSI30. Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums. 2.1 Sets and subsets 2.2 Sets of sets

Chapter-2 SETS In Mathematics, Set theory was developed by George Cantor ( ).

Ch. 11 Solving Quadratic & Higher Degree Inequalities

MA : Introductory Probability

Notes 1 Autumn Sample space, events. S is the number of elements in the set S.)

Probability (Devore Chapter Two)

17. 8x and 4x 2 > x 1 < 7 and 6x x or 2x x 7 < 3 and 8x x 9 9 and 5x > x + 3 < 3 or 8x 2

Chapter 1 Review of Equations and Inequalities

Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015

Intro to Contemporary Math

INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR. NPTEL National Programme on Technology Enhanced Learning. Probability Methods in Civil Engineering

4. Probability of an event A for equally likely outcomes:

Set Theory. CPT Section D Quantitative Aptitude Chapter 7 Brijeshwar Prasad Gupta

ICS141: Discrete Mathematics for Computer Science I

Vector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture

Fundamentals of Probability CE 311S

Math 730 Homework 6. Austin Mohr. October 14, 2009

Transcription:

Finite Math Section 6_1 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in the event you get stuck. If you do not do the work you will NOT pass the tests. Section 6.1: Welcome to set theory. In this chapter you need to memorize some definitions of terms. It will make things much easier later. Most instructors assume you know all of this from high school and will not talk much about it (with some exceptions =). Know what a set is. Know what the elements of a set are. Know what a subset is. Know the difference between a subset and a proper subset. Know what the empty set is and the notation for it. Know what the complement of a set is, particularly when given a universal set. Know De Morgan s Laws. You will of course also need to be able to perform set operations, but you should be able to pick that up by doing problems. Likewise you will also need to know what a Venn diagram is, what set-builder notation is and what roster notation is; but those should come simply by doing the problems. Problem 18: Let A = { a, e, l, t, r }. Which of the following sets are equal to A? a. { x x is a letter of the word later } b. { x x is a letter of the word latter } c. { x x is a letter of the word relate }

All the stated sets are equal to A. The word later is made up of the letters: l, a, t, e, r which is all the letters in A. The word latter is also made up of the letter: l, a, t, e, r again which is all the letter of A. The word relate is made up of the letters: r, e, l, a, t again which is all the letters of A. Problem 30: a. Shade the portion of the figure that represents A B C C b. Shade the portion of the figure that represents A C B C Recall intersection is where stuff overlaps. 30 a: For A B C C : First shade A: Now shade B:

Notice the intersection, or rather A B, is just: Now shade C C : Notice it intersects A B like this (which gives us our answer):

The above is our answer for A B C C. 30 b: For A C B C: First shade A C : Then shade B:

Notice A C B is just: Now shade C: And we have C intersect (A C B) as below:

Our answer for A C B C is above. Problem 32: a. Shade the portion of the figure that represents A (B C) C. b. Shade the portion of the figure that represents (A B C) C For part 32 (a) Recall DeMorgan s law: (X Y) C = X C Y C So A (B C) C becomes A B C C C. I ll leave the shading for you to do. Also understand you don t have to apply DeMorgan s law you can solve it other ways, but it s a good thing to get some practice doing. For part 32 (b) There is no rule for what (A B C) C becomes. So notice that A B C is just:

And then take the complement of that to get: The above is the answer for: (A B C) C. Problem 34: U = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 } A = { 1, 3, 5, 7, 9 } B = { 2, 4, 6, 8, 10 } C = { 1, 2, 4, 5, 8, 9 } 34 a. Find C C C. First determine C C = { 3, 6, 7, 10 } = { everything in U and NOT in C } So

C C C = { 1, 2, 4, 5, 8, 9 } { 3, 6, 7, 10 } notice there is no overlap C C C = «34 b. Find (A C) C. You could use DeMorgan s law on this. I m not going to. First find (A C): A C = { 1, 3, 5, 7, 9 } { 1, 2, 4, 5, 8, 9 } overlaps on 1, 5 and 9 A C = { 1, 5, 9 } Now find everything in U that is NOT in A C (A C) C = { 2, 3, 4, 6, 7, 8, 10 } 34 c. Find A (B C). First find B C: B C = { 2, 4, 6, 8, 10 } { 1, 2, 4, 5, 8, 9 } overlaps on 2, 4 and 8 B C = { 2, 4, 8 } Recall A = { 1, 3, 5, 7, 9 } And A (B C) is (everything in A) and (everything in B C) without duplicates: A (B C) = { 1, 3, 5, 7, 9, 2, 4, 8 } and we will put it into a better order A (B C) = { 1, 2, 3, 4, 5, 7, 8, 9 } Problem 52: Consider the below Venn Diagram:

A = { x ³ U x has taken the subway } B = { x ³ U x has taken a cab } C = { x ³ U x has taken a bus } 52 a. Express Region 3 in set notation and in words. The set notation reasoning Region 3 is in A and Region 3 is in B and Region 3 is not in C So we get Region 3 = A B C c In words region 3 represents all tourists who have taken the subway AND a cab AND NOT a bus 52 b. Express Region 4 and 6 together in set notation and in words. The reasoning Region 4 is in A and C and not in B. Region 6 is in B and not A and not C. So Region 4 = A C B C. Region 6 = B A C C C. So if we take region 4 and 6 together (combine them, or, say union them) we get: (A C B C ) (B A C C C ) Notice there is no real good way to simplify that any further. In words region 4 and 6 together represents all tourists who have taken the subway AND a bus AND NOT a cab OR taken a cab AND not the subway AND NOT a bus 52 c. Express Regions 5, 6 and 7 together in set notation and in words. The reasoning: Region 5 is in C and not in A and not in B Å C A C B C.

Region 6 is in B and not A and not C Å B A C C C. Region 7 is in A and not in B and not in C Å A B C C C. So putting them together: ( C A C B C ) (B A C C C ) (A B C C C ) Which also does not simplify to anything nice. However it words it can be stated well: Region 5, 6 and 7 together represent all tourists who have used exactly one of the three transportation options. Problem 62: Consider the below Venn Diagram: 62 a. Find the points that belong to A ( B C ): First find B C: B = { x, r, w } C = { r, w, u, z } So B C = { x, r, w, u, z } Now find A (B C)

A = { r, u, y, v } notice this overlaps B C on the points r and u So A (B C) = { r, u } 62 b. Find the points that belong to ( B C ) C : Notice U = { s, y, u, z, w, r, v, x, t } Notice B C = { w, r } So (B C) C is everything in U except for w and r So (B C) C = { s, y, u, z, v, x, t }