Difference between revisions of "2025 SSMO Speed Round Problems/Problem 8"
(Created page with "==Problem== Let <math>S</math> be the set of all ordered pairs <math>(P,Q),</math> where <math>P</math> and <math>Q</math> are subsets of <math>\{1,2,\dots, 25\}</math> satis...") |
|||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
+ | |||
+ | For each <math>i\in \{1,2,\dots, 25\}</math>, let <math>p_i</math> denote the probability that <math>i \in A\cap B</math>, where <math>(A,B)</math> is a randomly chosen element of <math>S</math>. By the linearity of expected value, | ||
+ | \begin{align*} | ||
+ | \mathbb{E}[|A\cap B|] &= \mathbb{E}[p_1] + \mathbb{E}[p_2] + \cdots + \mathbb{E}[p_{25}] \\ | ||
+ | &= p_1 + p_2 + \cdots + p_{25}. | ||
+ | \end{align*} | ||
+ | (Because the value of each <math>p_i</math> is fixed, we have substituted <math>\mathbb{E}[p_i] = p_i</math>.) By symmetry, <math>p_i = p_1</math> for all valid <math>i</math> not equal to <math>20</math> or <math>25</math>, and by symmetry again, <math>p_{25} = p_{20}</math>. Therefore, <math>\mathbb{E}[|A\cap B|] = 23\cdot p_1 + 2\cdot p_{20}</math>. | ||
+ | |||
+ | Our goal now is to find the values of <math>p_1</math> and <math>p_{20}</math>. We do this via casework on the three ways the condition <math>|(A\cap B)\cap \{20,25\}|\ge 1</math> can be met. We will compute the values of <math>p_1</math> and <math>p_{20}</math> in each case, as well as finding the number of ordered pairs <math>(A,B)</math> that fall under each case. The latter information will allow us to compute the probability that any given <math>(A,B)</math> falls under each of the three cases, which in turn will let us compute <math>p_1</math> and <math>p_{20}</math>. | ||
+ | |||
+ | <i>Case 1:</i> both elements of <math>\{20,25\}</math> lie in both <math>A</math> and <math>B</math>. Because <math>20, 25 \in A,B</math>, we have <math>20, 25 \in A\cup B</math>. We know that <math>|A\cup B| = 17</math>, so we can choose the other <math>15</math> elements of <math>|A\cup B|</math> in <math>\tbinom{23}{15}</math> ways. There are <math>3</math> ways to assign each of these <math>15</math> elements to <math>A</math> and <math>B</math>; the element must lie in at least one of <math>A</math> and <math>B</math>, so it can lie in <math>A</math> but not in <math>B</math>, in <math>B</math> but not in <math>A</math>, or in both <math>A</math> and <math>B</math>. Therefore, there are <math>3^{15}\cdot\tbinom{23}{15}</math> ordered pairs <math>(A,B)</math> in this case. | ||
+ | |||
+ | To find <math>p_1</math> in this case, observe that since each of the <math>23</math> elements of <math>\{1,2,\dots, 25\}</math> that are not <math>20</math> or <math>25</math> has an equal probability of being selected as an element of <math>A\cup B</math>, the probability that <math>1 \in A\cup B</math> is <math>\tfrac{15}{23}</math>. If <math>1\in A\cup B</math>, there is a <math>\tfrac{1}{3}</math> probability that <math>1 \in A\cap B</math>, so <math>p_1 = \tfrac{1}{3}\cdot\tfrac{15}{23} = \tfrac{5}{23}</math>. Trivially, <math>p_{20} = 1</math> in this case. | ||
+ | |||
+ | <i>Case 2:</i> one element of <math>\{20,25\}</math> lies in both <math>A</math> and <math>B</math>, while the other element lies in exactly one of <math>A</math> and <math>B</math>. In this case, exactly one of <math>20</math> and <math>25</math> lies in both <math>A</math> and <math>B</math>, and exactly one of <math>A</math> and <math>B</math> contains both <math>20</math> and <math>25</math>. This means that there are <math>2\cdot 2 = 4</math> ways to assign <math>20</math> and <math>25</math> to <math>A</math> and <math>B</math>. Note that <math>20, 25 \in A\cup B</math>. Since we must have <math>|A\cup B| = 17</math>, there are <math>\tbinom{23}{15}</math> ways to choose the remaining <math>15</math> elements of <math>A\cup B</math>, and as in the previous case, there are <math>3</math> ways to assign each of these elements to <math>A</math> and <math>B</math>. Hence, <math>4\cdot 3^{15}\cdot\tbinom{23}{15}</math> ordered pairs <math>(A,B)</math> fall under this case. | ||
+ | |||
+ | The computation of <math>p_1</math> in this case is identical to that in the previous case, so <math>p_1 = \tfrac{5}{23}</math> in this case well. Recall that exactly one element of <math>\{20,25\}</math> lies in both <math>A</math> and <math>B</math>. The probability that this element is <math>20</math> is <math>\tfrac{1}{2}</math>, so <math>p_{20} = \tfrac{1}{2}</math> in this case. | ||
+ | |||
+ | <i>Case 3:</i> one element of <math>\{20,25\}</math> lies in both <math>A</math> and <math>B</math>, while the other element lies in neither <math>A</math> nor <math>B</math>. Either <math>20</math> or <math>25</math> is the element that lies in both <math>A</math> and <math>B</math>, so there are <math>2</math> ways to assign <math>20</math> and <math>25</math> to <math>A</math> and <math>B</math>. The case conditions imply that exactly one of <math>20</math> and <math>25</math> lies in <math>A \cup B</math>, so <math>A\cup B</math> must contain <math>16</math> other elements. We can choose these in <math>\tbinom{23}{16}</math> ways, and as in the two previous cases, there are <math>3</math> ways to assign each of these elements to <math>A</math> and <math>B</math>. Thus, the number of ordered pairs <math>(A,B)</math> that fall under this case is <math>2\cdot 3^{16}\cdot \tbinom{23}{16}</math>. | ||
+ | |||
+ | The computation of <math>p_1</math> in this case is nearly identical to that in the previous two cases, with the difference being the probability that <math>1\in A\cup B</math> is <math>\tfrac{16}{23}</math> (analogous reasoning still applies). Therefore, <math>p_1 = \tfrac{16}{23}\cdot \tfrac{1}{3} = \tfrac{16}{69}</math> in this case. By the case conditions, exactly one of the elements of <math>\{20,25\}</math> lies in both <math>A</math> and <math>B</math>. The probability that this element is <math>20</math> is <math>\tfrac{1}{2}</math>, so <math>p_{20} = \tfrac{1}{2}</math> in this case as well. | ||
+ | |||
+ | Our casework completed, we now compute the probability that a randomly chosen ordered pair <math>(A,B)</math> falls under each of the three cases just outlined. For simplicity, let <math>P_i</math> denote the probability that <math>(A,B)</math> falls under case <math>n</math> for <math>n = 1,2,3</math>. Then, computation gives us | ||
+ | \begin{align*} | ||
+ | P_1 &= \frac{3^{15}\cdot\tbinom{23}{15}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{1}{8} \\ | ||
+ | P_2 &= \frac{4\cdot 3^{15}\cdot\tbinom{23}{15}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{1}{2} \\ | ||
+ | P_3 &= \frac{2\cdot 3^{16}\cdot\tbinom{23}{16}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{3}{8}. | ||
+ | \end{align*} | ||
+ | Using the values that we computed for <math>p_1</math> and <math>p_{20}</math> in each case individually, we have | ||
+ | \begin{align*} | ||
+ | p_1 &= \frac{5}{23} \cdot P_1 + \frac{5}{23} \cdot P_2 + \frac{16}{69} \cdot P_3 = \frac{41}{184}\\ | ||
+ | p_{20} &= 1 \cdot P_1 + \frac{1}{2} \cdot P_2 + \frac{1}{2} \cdot P_3 = \frac{9}{16}. | ||
+ | \end{align*} | ||
+ | Thus, <math>\mathbb{E}[|A\cap B|] = 23(\tfrac{41}{184})+ 2(\tfrac{9}{16}) = \tfrac{25}{4}</math>, and we extract <math>25+4 = \boxed{29}</math>. | ||
+ | |||
+ | ~Sedro |
Latest revision as of 17:14, 12 September 2025
Problem
Let be the set of all ordered pairs
where
and
are subsets of
satisfying
and
. If an ordered pair
is chosen randomly from
the expected value of
is
where
and
are relatively prime positive integers. Find
.
Solution
For each , let
denote the probability that
, where
is a randomly chosen element of
. By the linearity of expected value,
\begin{align*}
\mathbb{E}[|A\cap B|] &= \mathbb{E}[p_1] + \mathbb{E}[p_2] + \cdots + \mathbb{E}[p_{25}] \\
&= p_1 + p_2 + \cdots + p_{25}.
\end{align*}
(Because the value of each
is fixed, we have substituted
.) By symmetry,
for all valid
not equal to
or
, and by symmetry again,
. Therefore,
.
Our goal now is to find the values of and
. We do this via casework on the three ways the condition
can be met. We will compute the values of
and
in each case, as well as finding the number of ordered pairs
that fall under each case. The latter information will allow us to compute the probability that any given
falls under each of the three cases, which in turn will let us compute
and
.
Case 1: both elements of lie in both
and
. Because
, we have
. We know that
, so we can choose the other
elements of
in
ways. There are
ways to assign each of these
elements to
and
; the element must lie in at least one of
and
, so it can lie in
but not in
, in
but not in
, or in both
and
. Therefore, there are
ordered pairs
in this case.
To find in this case, observe that since each of the
elements of
that are not
or
has an equal probability of being selected as an element of
, the probability that
is
. If
, there is a
probability that
, so
. Trivially,
in this case.
Case 2: one element of lies in both
and
, while the other element lies in exactly one of
and
. In this case, exactly one of
and
lies in both
and
, and exactly one of
and
contains both
and
. This means that there are
ways to assign
and
to
and
. Note that
. Since we must have
, there are
ways to choose the remaining
elements of
, and as in the previous case, there are
ways to assign each of these elements to
and
. Hence,
ordered pairs
fall under this case.
The computation of in this case is identical to that in the previous case, so
in this case well. Recall that exactly one element of
lies in both
and
. The probability that this element is
is
, so
in this case.
Case 3: one element of lies in both
and
, while the other element lies in neither
nor
. Either
or
is the element that lies in both
and
, so there are
ways to assign
and
to
and
. The case conditions imply that exactly one of
and
lies in
, so
must contain
other elements. We can choose these in
ways, and as in the two previous cases, there are
ways to assign each of these elements to
and
. Thus, the number of ordered pairs
that fall under this case is
.
The computation of in this case is nearly identical to that in the previous two cases, with the difference being the probability that
is
(analogous reasoning still applies). Therefore,
in this case. By the case conditions, exactly one of the elements of
lies in both
and
. The probability that this element is
is
, so
in this case as well.
Our casework completed, we now compute the probability that a randomly chosen ordered pair falls under each of the three cases just outlined. For simplicity, let
denote the probability that
falls under case
for
. Then, computation gives us
\begin{align*}
P_1 &= \frac{3^{15}\cdot\tbinom{23}{15}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{1}{8} \\
P_2 &= \frac{4\cdot 3^{15}\cdot\tbinom{23}{15}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{1}{2} \\
P_3 &= \frac{2\cdot 3^{16}\cdot\tbinom{23}{16}}{3^{15}\cdot\tbinom{23}{15} + 4\cdot 3^{15}\cdot\tbinom{23}{15} + 2\cdot 3^{16}\cdot\tbinom{23}{16}} = \frac{3}{8}.
\end{align*}
Using the values that we computed for
and
in each case individually, we have
\begin{align*}
p_1 &= \frac{5}{23} \cdot P_1 + \frac{5}{23} \cdot P_2 + \frac{16}{69} \cdot P_3 = \frac{41}{184}\\
p_{20} &= 1 \cdot P_1 + \frac{1}{2} \cdot P_2 + \frac{1}{2} \cdot P_3 = \frac{9}{16}.
\end{align*}
Thus,
, and we extract
.
~Sedro