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

Difference between revisions of "2002 AIME II Problems/Problem 9"

m
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
−
Let <math>\mathcal{S}</math> be the set <math>\lbrace1,2,3,\ldots,10\rbrace</math> Let <math>n</math> be the number of sets of two non-empty disjoint subsets of <math>\mathcal{S}</math>. (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when <math>n</math> is divided by <math>1000</math>.
+
Let <math>\mathcal{S}</math> be the [[set]] <math>\lbrace1,2,3,\ldots,10\rbrace</math> Let <math>n</math> be the number of sets of two non-empty disjoint subsets of <math>\mathcal{S}</math>. (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when <math>n</math> is divided by <math>1000</math>.
  
 
== Solution ==
 
== Solution ==
−
For simplicity, let's call the sets <math>\mathcal{A}</math> and <math>\mathcal{B}</math>. Now if we choose <math>x</math> members from <math>\mathcal{S}</math> to be in <math>\mathcal{A}</math>, then we have <math>10-x</math> elements to choose for <math>\mathcal{B}</math>. Thus
+
Let the two disjoint subsets be <math>A</math> and <math>B</math>, and let <math>C = S-(A+B)</math>. For each <math>i \in S</math>, either <math>i \in A</math>, <math>i \in B</math>, or <math>i \in C</math>. So there are <math>3^{10}</math> ways to organize the elements of <math>S</math> into disjoint <math>A</math>, <math>B</math>, and <math>C</math>.  
−
 
 
−
<math>n=\sum_{x=1}^{9} (\binom{10}{x}\cdot(\sum_{n=1}^{10-x}\binom{10-x}{n}))=\sum_{x=1}^{9} (\binom{10}{x}\cdot(2^{10-x}-1))=\binom{10}{1}\cdot511+\binom{10}{2}\cdot255+\binom{10}{3}\cdot127+\binom{10}{4}\cdot63+\binom{10}{5}\cdot31+\binom{10}{6}\cdot15+\binom{10}{7}\cdot7+\binom{10}{8}\cdot3+\binom{10}{9}\cdot1=\binom{10}{1}\cdot512+\binom{10}{2}\cdot258+\binom{10}{3}\cdot134+\binom{10}{4}\cdot78+\binom{10}{5}\cdot31</math>.
 
−
 
 
−
We want the remainder when <math>n</math> is divided by 1000, so we find the last three digits of each.
 
−
 
 
−
{{incomplete|solution}}
 
−
 
 
−
==Solution 2==
 
−
Let the two disjoint subsets be <math>A</math> and <math>B</math>, and let <math>C = S-(A+B)</math>.  
 
−
For each <math>i \in S</math>, either <math>i \in A</math>, <math>i \in B</math>, or <math>i \in C</math>. So there are <math>3^{10}</math> ways to organize the elements of <math>S</math> into disjoint <math>A</math>, <math>B</math>, and <math>C</math>.  
 
  
 
However, there are <math>2^{10}</math> ways to organize the elements of <math>S</math> such that <math>A = \emptyset</math> and <math>S = B+C</math>, and there are <math>2^{10}</math> ways to organize the elements of <math>S</math> such that <math>B = \emptyset</math> and <math>S = A+C</math>.  
 
However, there are <math>2^{10}</math> ways to organize the elements of <math>S</math> such that <math>A = \emptyset</math> and <math>S = B+C</math>, and there are <math>2^{10}</math> ways to organize the elements of <math>S</math> such that <math>B = \emptyset</math> and <math>S = A+C</math>.  
Line 22: Line 12:
 
== See also ==
 
== See also ==
 
{{AIME box|year=2002|n=II|num-b=8|num-a=10}}
 
{{AIME box|year=2002|n=II|num-b=8|num-a=10}}
 +
 +
[[Category:Intermediate Combinatorics Problems]]

Revision as of 16:32, 26 June 2008

Problem

Let $\mathcal{S}$ be the set $\lbrace1,2,3,\ldots,10\rbrace$ Let $n$ be the number of sets of two non-empty disjoint subsets of $\mathcal{S}$. (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when $n$ is divided by $1000$.

Solution

Let the two disjoint subsets be $A$ and $B$, and let $C = S-(A+B)$. For each $i \in S$, either $i \in A$, $i \in B$, or $i \in C$. So there are $3^{10}$ ways to organize the elements of $S$ into disjoint $A$, $B$, and $C$.

However, there are $2^{10}$ ways to organize the elements of $S$ such that $A = \emptyset$ and $S = B+C$, and there are $2^{10}$ ways to organize the elements of $S$ such that $B = \emptyset$ and $S = A+C$. But, the combination such that $A = B = \emptyset$ and $S = C$ is counted twice.

Thus, there are $3^{10}-2\cdot2^{10}+1$ ordered pairs of sets $(A,B)$. But since the question asks for the number of unordered sets $\{ A,B \}$, $n = \frac{1}{2}(3^{10}-2\cdot2^{10}+1) = 28501 \equiv \boxed{501} \pmod{1000}$.

See also

2002 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 8 		Followed by
Problem 10
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_AIME_II_Problems/Problem_9&oldid=26781"