Download presentation
Presentation is loading. Please wait.
1
ALGEBRA I - SETS : UNION and INTERSECTION
@ SETS : UNION and INTERSECTION
2
SET : a collection of objects. A = {1, 2, 3, 4, 5}.
U SET : a collection of objects. A = {1, 2, 3, 4, 5}. B = {4, 5, 6, 7, 8} A 9 2 3 4 5 ELEMENT or OBJECT : a member of a set. 10 B VENN DIAGRAM : a picture of a set or a group of sets. Created by a guy named Venn…. but I don’t know venn he did it.
3
UNIVERSAL SET : the set of all elements under consideration.
9 2 3 4 5 10 B UNION : a listing, in set notation, of every element of two or more sets. INTERSECTION : a listing, in set notation, of the elements two or more sets share.
4
EMPTY SET : a set that contains no elements, denoted by the symbol Ø.
Examples : FINITE SET : a set that contains a definite number of elements. (You can count them!) Examples : INFINITE SET : a set that contains an indefinite number of members. (You can’t count them.) Examples :
5
OVERLAPPING SETS : two or more sets that share at least one element.
Examples : A U B Sets A and B overlap. Other examples?
6
ROSTER METHOD : a way to write the elements of a set by listing all of the elements.
Examples : RULE METHOD : a way to write the elements of a set by definition. Examples : DISJOINT : two sets are disjoint if they have no elements in common. Examples : U A B
7
Draw Venn Diagrams for each of the following sets.
U = {letters of the English alphabet} A = {different letters in the word ‘baseball’} B = {different letters in the word ‘basket’} 2) U = {a, b, c, d, e, f, g, h, I, j, k, l, m} X = {a, b, c, d, e ,f, g} Y = {e, f, g, h, i, j, k}
8
Find the union ( ) and intersection ( ) of each pair of sets.
3) U = {whole numbers from 1-20 inclusive} P = {prime numbers less than 20} D = {odd whole numbers less than 20} 4) U = {letters of the English alphabet} F = {different letters in the word ‘foot’} B = {different letters in the word ‘base’} Note : sets F and B are disjoint!
9
ALGEBRA I - SETS : UNION and INTERSECTION
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.