Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1991 AHSME Problems/Problem 30

Revision as of 00:11, 17 March 2013 by Ckorr2003 (talk | contribs) (Created page with "For any set <math>S</math>, let <math>|S|</math> denote the number of elements in <math>S</math>, and let <math>n(S)</math> be the number of subsets of <math>S</math>, including ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

For any set $S$, let $|S|$ denote the number of elements in $S$, and let $n(S)$ be the number of subsets of $S$, including the empty set and the set $S$ itself. If $A$, $B$, and $C$ are sets for which $n(A)+n(B)+n(C)=n(A\cup B\cup C)$ and $|A|=|B|=100$, then what is the minimum possible value of $|A\cap B\cap C|$?

(A) 96 (B) 97 (C) 98 (D) 99 (E) 100

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1991_AHSME_Problems/Problem_30&oldid=51817"