Math 141 Ch 6 part 1

# Math 141 Ch 6 part 1 - Sets and Counting Sets and Set...

This preview shows pages 1–5. Sign up to view the full content.

Sets and Counting Sets and Set Operations (II.A.1,2) Number of Elements in a Finite Set (II.A.3) Multiplication Principle (II.A.4a,4b) Permutations and Combinations (II.A.4c,4d,4e)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Set Terminology A set is a well-defined collection of objects. The objects or members of a set are known as the elements of the set. There are two ways to write a set: Roster Notation – all elements are listed Like names on a roster. Example: F ={1, 2, 3, 4} Example: H ={0, 1, 2,…, 100} Set-Builder Notation – a description of the elements in the set is given Decide whether or not an objects fits the description.
Set Equality Two sets are equal if and only if they have exactly the same elements. Order of the listed elements does not matter! Example: Which of the following sets are equal? A = { a, b, c, d } B = { a, c, d } C ={ d, c, a, b } R ={ x | x is a number evenly divisible by 2} S ={0, 2, 4, 6}

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Subsets If every element of a set E is also an element of a set F , then E is a subset of F , denoted . Example
This is the end of the preview. Sign up to access the rest of the document.

## Math 141 Ch 6 part 1 - Sets and Counting Sets and Set...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online