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 "2011 USAMO Problems/Problem 6"

(Created page with '==Problem== Let <math>A</math> be a set with <math>|A| = 225</math>, meaning that <math>A</math> has 225 elements. Suppose further that there are eleven subsets <math>A_1</math>…')
 
(→‎Solution)
Line 22: Line 22:
 
<cmath> |A_S| = \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha). </cmath>
 
<cmath> |A_S| = \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha). </cmath>
 
For <math>0 \le k \le |I|</math>, consider the sum <math>N_k</math> of <math>|A_S|</math> over all <math>S\subset I</math> with <math>|S|= k</math>. This is:
 
For <math>0 \le k \le |I|</math>, consider the sum <math>N_k</math> of <math>|A_S|</math> over all <math>S\subset I</math> with <math>|S|= k</math>. This is:
−
<cmath>
+
<cmath> N_k = \sum_{\substack{S\subset I\\|S| = k}} \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha) = \sum_{\substack{S\subset I\\|S| = k}} |A_S| </cmath>
−
N_k = \sum_{\substack{S\subset I\\|S| = k}} \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha) = \sum_{\substack{S\subset I\\|S| = k}} |A_S|
 
−
</cmath>
 
 
reversing the order summation, we get:
 
reversing the order summation, we get:
−
<cmath>
+
<cmath>\sum_{\substack{S\subset I\\|S| = k}} |A_S| = \sum_{\alpha \in U} \sum_{\substack{S\subset I\\|S| = k}} \prod_{i \in S} \chi_i(\alpha) = \sum_{\alpha \in U} \binom{n_\alpha}k </cmath> since an element <math>\alpha</math> that appears in <math>n_\alpha</math> of the <math>A_i</math>, will appear in exactly <math>\binom{n_\alpha}k</math> intersections of <math>k</math> subsets.
−
\sum_{\substack{S\subset I\\|S| = k}} |A_S| = \sum_{\alpha \in U} \sum_{\substack{S\subset I\\|S| = k}} \prod_{i \in S} \chi_i(\alpha) = \sum_{\alpha \in U} \binom{n_\alpha}k
 
−
</cmath>
 
−
since an element <math>\alpha</math> that appears in <math>n_\alpha</math> of the <math>A_i</math>, will appear in exactly <math>\binom{n_\alpha}k</math> intersections of <math>k</math> subsets.
 
  
 
Applying the above with <math>I = \{1, 2, \ldots, 11\},</math> and <math>k=1</math>, since each of the 11 <math>A_i</math> has 45 elements, we get:
 
Applying the above with <math>I = \{1, 2, \ldots, 11\},</math> and <math>k=1</math>, since each of the 11 <math>A_i</math> has 45 elements, we get:
Line 37: Line 32:
  
 
Therefore
 
Therefore
−
<cmath>
+
<cmath>\begin{align*}
−
\begin{align*}
 
 
s_1 &= \sum_{\alpha \in U} n_\alpha = N_1 = 11\cdot45 \\
 
s_1 &= \sum_{\alpha \in U} n_\alpha = N_1 = 11\cdot45 \\
 
s_2 &= \sum_{\alpha \in U} n_\alpha^2 = 2N_2 + N_1 = 3\cdot11\cdot45.
 
s_2 &= \sum_{\alpha \in U} n_\alpha^2 = 2N_2 + N_1 = 3\cdot11\cdot45.
−
\end{align*}
+
\end{align*}</cmath>
−
</cmath>
 
 
Let <math>n = |U|</math> be the number of elements of <math>U</math>.
 
Let <math>n = |U|</math> be the number of elements of <math>U</math>.
 
Since for any set of real numbers the mean value of the squares is greater than or equal to the square of the mean value, we have:
 
Since for any set of real numbers the mean value of the squares is greater than or equal to the square of the mean value, we have:
−
<cmath> \frac{s_2}n \ge \left(\frac{s_1}n\right)^2 \implies n \ge \frac{s_1^2}{s_2} = \frac{11^2\cdot 45^2}{3\cdot11\cdot45} = \frac{11\cdot45}3 = 165.</cmath>
+
<cmath>\frac{s_2}n \ge \left(\frac{s_1}n\right)^2 \implies n \ge \frac{s_1^2}{s_2} = \frac{11^2\cdot 45^2}{3\cdot11\cdot45} = \frac{11\cdot45}3 = 165.</cmath>
  
 
Thus <math>|U| \ge 165</math> as required.
 
Thus <math>|U| \ge 165</math> as required.

Revision as of 14:28, 5 May 2011

Problem

Let $A$ be a set with $|A| = 225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1$, $\dots$, $A_{11}$ of $A$ such that $|A_i | = 45$ for $1 \le i \le 11$ and $|A_i \cap A_j| = 9$ for $1 \le i < j \le 11$. Prove that $|A_1 \cup A_2 \cup \dots \cup A_{11}| \ge 165$, and give an example for which equality holds.

Solution

Existence

Note that $\binom{11}3 = 165,$ and so it is natural to consider placing one element in each intersection of three of the 11 sets. Since each pair of sets is in 9 3-way intersections—one with each of the 9 remaining sets—any two sets will have 9 elements in common. Since $\binom{10}2 = 45,$ each set is in 45 triples and thus will have 45 elements. We can now throw in 60 more elements outside the union of the $A_i$ and we are done.

Minimality

As in the proof of PIE, let $I$ be a finite set. Let $U = \bigcup_{i\in I} A_i$. For $i\in I$, let $\chi_i$ be the characteristic function of $A_i$, that is, for $\alpha \in U,$ \[\chi_i(\alpha) = \begin{cases} 1 & \alpha \in A_i \\ 0 & \alpha \not\in A_i \end{cases}\]

For each $\alpha \in U$ let $n_\alpha = \sum_{i \in I} \chi_i(\alpha)$, that is the number of subsets $A_i$ of which $\alpha$ is an element.

If $S \subset I$, let $A_S = \bigcap_{i \in S}A_i$. Then the characteristic function of $A_S$ is $\prod_{i \in S} \chi_i$. The number of elements of $A_S$ is simply the sum of its characteristic function over all the elements of $U$: \[|A_S| = \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha).\] For $0 \le k \le |I|$, consider the sum $N_k$ of $|A_S|$ over all $S\subset I$ with $|S|= k$. This is: \[N_k = \sum_{\substack{S\subset I\\|S| = k}} \sum_{\alpha \in U} \prod_{i \in S} \chi_i(\alpha) = \sum_{\substack{S\subset I\\|S| = k}} |A_S|\] reversing the order summation, we get: \[\sum_{\substack{S\subset I\\|S| = k}} |A_S| = \sum_{\alpha \in U} \sum_{\substack{S\subset I\\|S| = k}} \prod_{i \in S} \chi_i(\alpha) = \sum_{\alpha \in U} \binom{n_\alpha}k\] since an element $\alpha$ that appears in $n_\alpha$ of the $A_i$, will appear in exactly $\binom{n_\alpha}k$ intersections of $k$ subsets.

Applying the above with $I = \{1, 2, \ldots, 11\},$ and $k=1$, since each of the 11 $A_i$ has 45 elements, we get: \[N_1 = \sum_{\alpha \in U} n_\alpha = 11 \cdot 45,\] and for $k = 2$, since each of the 55 pairs $A_i \cap A_j$ has 9 elements, we get: \[N_2 = \sum_{\alpha \in U} \binom{n_\alpha}2 = 9 \cdot 55 = 11 \cdot 45.\]

Therefore \begin{align*} s_1 &= \sum_{\alpha \in U} n_\alpha = N_1 = 11\cdot45 \\ s_2 &= \sum_{\alpha \in U} n_\alpha^2 = 2N_2 + N_1 = 3\cdot11\cdot45. \end{align*} Let $n = |U|$ be the number of elements of $U$. Since for any set of real numbers the mean value of the squares is greater than or equal to the square of the mean value, we have: \[\frac{s_2}n \ge \left(\frac{s_1}n\right)^2 \implies n \ge \frac{s_1^2}{s_2} = \frac{11^2\cdot 45^2}{3\cdot11\cdot45} = \frac{11\cdot45}3 = 165.\]

Thus $|U| \ge 165$ as required.

See also

2011 USAMO (Problems • Resources)
Preceded by
Problem 5 		Last Problem
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_USAMO_Problems/Problem_6&oldid=38331"