Difference between revisions of "1991 AHSME Problems/Problem 30"
m |
|||
Line 1: | Line 1: | ||
+ | == Problem == | ||
+ | |||
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 the empty set and the set <math>S</math> itself. If <math>A</math>, <math>B</math>, and <math>C</math> are sets for which <math>n(A)+n(B)+n(C)=n(A\cup B\cup C)</math> and <math>|A|=|B|=100</math>, then what is the minimum possible value of <math>|A\cap B\cap C|</math>? | 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 the empty set and the set <math>S</math> itself. If <math>A</math>, <math>B</math>, and <math>C</math> are sets for which <math>n(A)+n(B)+n(C)=n(A\cup B\cup C)</math> and <math>|A|=|B|=100</math>, then what is the minimum possible value of <math>|A\cap B\cap C|</math>? | ||
(A) 96 (B) 97 (C) 98 (D) 99 (E) 100 | (A) 96 (B) 97 (C) 98 (D) 99 (E) 100 | ||
+ | |||
+ | == Solution == | ||
+ | <math>\fbox{}</math> | ||
+ | |||
+ | == See also == | ||
+ | {{AHSME box|year=1991|num-b=29|num-a=30}} | ||
+ | |||
+ | [[Category: Intermediate Algebra Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 01:54, 28 September 2014
Problem
For any set , let denote the number of elements in , and let be the number of subsets of , including the empty set and the set itself. If , , and are sets for which and , then what is the minimum possible value of ?
(A) 96 (B) 97 (C) 98 (D) 99 (E) 100
Solution
See also
1991 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 29 |
Followed by Problem 30 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.