Chapter 5 Section 3 Venn Diagram and Counting. Exercise 13 (page 222) Given: n(U) = 20 n(S) = 12 n(T) = 14 n(S ∩ T ) = 18 Problem, none of the values.

Slides:



Advertisements
Similar presentations
Part 1 Module 3 Survey Problems and Venn diagrams
Advertisements

1. Number of Elements in A 2. Inclusion-Exclusion Principle 3. Venn Diagram 4. De Morgan's Laws 1.
Chapter 7 Logic, Sets, and Counting
Shade the Venn diagram to represent the set A' U (A ∩ B)
3.8 Unions and Intersections of Sets. Set operations Let U = {x|x is an English-language film} Set A below contains the five best films according to the.
Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles.
Chapter 11 Section 1 Introduction to Difference Equations.
Chapter 5 Section 2 Fundamental Principle of Counting.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Applications of Venn Diagrams
Chapter 6 Section 3 Assignment of Probabilities. Sample Space and Probabilities Sample Space : S = { s 1, s 2, s 3, …, s N-1, s N } where s 1, s 2, s.
The Inclusion/Exclusion Rule for Two or Three Sets
Shade the Venn diagram to represent the set A' U (A ∩ B)
Chapter 2 The Basic Concepts of Set Theory
Chapter 3: Set Theory and Logic
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Survey of Mathematical Ideas Math 100 Chapter 2
Survey of Mathematical Ideas Math 100 Chapter 2 John Rosson Thursday January 25, 2007.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 10 Further Topics in Algebra.
Part 1 Module 2 Set operations, Venn diagrams
Chapter 6 The Inclusion-Exclusion Principle and Applications
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Basic Counting Principles 6.3 Basic Counting.
Inclusion-Exclusion Selected Exercises Powerpoint Presentation taken from Peter Cappello’s webpage
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
Section 1.6 Survey Problems.
The Basics of Counting Section 6.1.
Copyright © 2009 Pearson Education, Inc. Chapter 2 Section 5 - Slide 1 Section 5 Applications of Sets.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 2.4 Applications.
Basic Logarithmic and Exponential Integrals Lesson 9.2.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2010 Pearson Addison-Wesley. All rights reserved. Chapter 2 Probability.
Section 2.3 Using Venn Diagrams to Study Set Operations Math in Our World.
Counting Techniques. L172 Agenda Section 4.1: Counting Basics Sum Rule Product Rule Inclusion-Exclusion.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 5 Section 2 – Slide 1 of 21 Chapter 5 Section 2 The Addition Rule and Complements.
1 Section 6.5 Inclusion/Exclusion. 2 Finding the number of elements in the union of 2 sets From set theory, we know that the number of elements in the.
Chapter 2 Section 2 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Math 3121 Abstract Algebra I
Section Probability Models AP Statistics. AP Statistics, Section 6.3, Part 12 Venn Diagrams: Disjoint Events A B S.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.4 Venn Diagrams with Three Sets and Verification of Equality of Sets.
© 2010 Pearson Prentice Hall. All rights reserved Survey Problems.
Addition Math Facts = 9. Addition Math Facts = 1 5.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
Section 2.4 Using Sets to Solve Problems Math in Our World.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 2.4, Slide 1 CHAPTER 2 Set Theory.
MDFP Introduction to Mathematics SETS and Venn Diagrams.
A Π B = all elements in both sets A and B
Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 2.5, Slide 1 CHAPTER 2 Set Theory.
 2012 Pearson Education, Inc. Slide Chapter 2 The Basic Concepts of Set Theory.
Principle of Inclusion and Exclusion
Venn Diagrams and Subsets
The Number of Elements in a Finite Set
Math Facts.
Set Operations Section 2.2.
Part 1 Module 2 Set operations, Venn diagrams
Set, Combinatorics, Probability & Number Theory
The Basic Concepts of Set Theory
Class Notes 11.2 The Quadratic Formula.
CHAPTER 2 Set Theory.
We will chake the answer
Addition Math Facts (Facts to 10, 15, & 20)
Chapter 7 Logic, Sets, and Counting
Thinking Mathematically
CHAPTER 2 Set Theory.
Section 2.5 Application of Sets
Section 13.1 Counting.
CHAPTER 2 Set Theory.
Presentation transcript:

Chapter 5 Section 3 Venn Diagram and Counting

Exercise 13 (page 222) Given: n(U) = 20 n(S) = 12 n(T) = 14 n(S ∩ T ) = 18 Problem, none of the values above corresponds to any basic of the regions

Exercise 13 Solution Use the inclusion-exclusion principle n( S U T ) = n( S ) + n( T ) – n( S ∩ T ) 18 = – n( S ∩ T ) n( S ∩ T ) = 8

Exercise 13 Venn Diagram Basic region IV = 20 – ( ) = 2 S 2 4 U 8 T 6

Exercise 16 (page 222) Given: n(S) = 9 n(T) = 11 n(S ∩ T ) = 5 ** n(S´ ) = 13 We can fill in all the basic regions except for basic region I.

Exercise 16 Solution Use the following fact: n( S ) + n( S ´ ) = n( U ) = n( U ) n( U ) = 22 Recall that all 4 basic regions must add up to n( U ). Thus: Basic region IV = 22 – ( ) = 7 With this information we then can fill in the Venn Diagram.

Exercise 16 Venn Diagram S 7 4 U 5 T 6

Exercise 23 (page 222) First we need to define our sets: Let: S = { Students who like rock music } T = { Students who like hip-hop music } “Survey of 70 …students”n(U) = 70 “35 students like rock music”n(S) = 35 “15 students like hip-hop”n(T) = 15 “5 liked both”n(S ∩ T) = 5 ** Since n(S ∩ T) is basic region I in the two set Venn Diagram, we can start filling in the Venn Diagram. ( ** means that this is a basic region in the Venn Diagram)

Exercise 23 Venn Diagram Basic region IV = 70 – ( ) = 25 S U 5 T 10

Exercise 31 (page 223) First we need to define our sets: Let: U = { Students in Finite Math class } M = { Male students in Finite Math class } B = { Business students in Finite Math class } F = { First year students in Finite Math class }

Exercise 31 Given “35 students in class”n(U) = 35 “22 are male students”n(M) = 22 “19 are business students”n(B) = 19 “27 are first-year students”n(F) = 27 “17 are male first-year”n( M ∩ F ) = 17 “15 are first-year businessn( B ∩ F ) = 15 “14 are male business”n( M ∩ B ) = 14 “11 are male first-year business”n( M ∩ B ∩ F ) = 11 ** ( ** means that this is a basic region in the Venn Diagram)

Exercise 31 Venn Diagram Basic Region VIII = 35 – ( ) = 2 B 2 2 U 3 F 1 M