Difference between revisions of "Subset"
(Started example problem section) |
(added intro section to example problems) |
||
| Line 9: | Line 9: | ||
== Example Problems == | == Example Problems == | ||
| + | === Introductory === | ||
| + | * [[Subset/Counting | Counting the number of subsets in a set]] | ||
| + | |||
=== Intermediate === | === Intermediate === | ||
* [[1992_AIME_Problems/Problem_2 | 1992 AIME Problem 2]] | * [[1992_AIME_Problems/Problem_2 | 1992 AIME Problem 2]] | ||
Revision as of 13:21, 3 August 2006
We say a set 
is a subset of another set 
if every element of is also an element of , and we denote this by $A \sub B$ (Error compiling LaTeX. Unknown error_msg). The empty set is a subset of every set, and every set is a subset of itself. The notation 
emphasizes that may be equal to , while 
says that is any subset of other than itself.
The following is a true statement:
$\emptyset \sub \{1, 2\} \sub \mathbb{N} \sub \mathbb{Z} \sub \mathbb{Q} \sub \mathbb{R} \sub \mathbb{C} \sub \mathbb{C}\, \cup\{\textrm{Groucho, Harpo, Chico}\} \supset \{1, 2, i, \textrm{Groucho}\}$ (Error compiling LaTeX. Unknown error_msg)
