Difference between revisions of "2023 SSMO Team Round Problems/Problem 7"
(Created page with "==Problem== Let <math>S = \{1, 2, 3, 4, \cdots, 23\}</math> and let there be randomly chosen sets <math>A, B, C</math> where <math>A, B, C \subseteq S</math>. The probability...") |
|||
Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
+ | The number of ordered triples <math>(A, B, C)</math> that satisfy the given property is equal to | ||
+ | <cmath>\sum_{1 \le a, b,\, a + b \le 23} \binom{23}{a} \binom{23}{b} \binom{23}{a + b}.</cmath> | ||
+ | |||
+ | Substituting <math>c = 23 - a - b</math>, this becomes | ||
+ | <cmath>\sum_{a + b + c = 23} \binom{23}{a} \binom{23}{b} \binom{23}{c}.</cmath> | ||
+ | |||
+ | We now evaluate this sum in two ways. | ||
+ | |||
+ | ===Method 1=== | ||
+ | Consider a set <math>A</math> of 69 elements, partitioned into three disjoint subsets <math>A_1</math>, <math>A_2</math>, and <math>A_3</math>, each of size 23. Choosing any 23 elements from <math>A</math> corresponds to choosing <math>a</math> from <math>A_1</math>, <math>b</math> from <math>A_2</math>, and <math>c</math> from <math>A_3</math> such that <math>a + b + c = 23</math>. This is a bijection to the sum, so the value is | ||
+ | <cmath>\binom{69}{23}.</cmath> | ||
+ | |||
+ | ===Method 2=== | ||
+ | By the binomial theorem, <cmath>(x + 1)^{23} = \sum_{i = 0}^{23} \binom{23}{i} x^i,</cmath> so the sum is the coefficient of <math>x^{23}</math> in <math>((x + 1)^{23})^3 = (x + 1)^{69}</math>, which is again | ||
+ | <cmath>\binom{69}{23}.</cmath> | ||
+ | |||
+ | The total number of possible ordered subsets <math>(A, B, C)</math> is <math>2^{23} \cdot 2^{23} \cdot 2^{23} = 2^{69}</math>, so the desired probability is | ||
+ | <cmath>\frac{\binom{69}{23}}{2^{69}}.</cmath> | ||
+ | |||
+ | To find the greatest power of 2 dividing this expression, note that | ||
+ | <cmath>\binom{69}{23} = \frac{69!}{23! \cdot 46!}.</cmath> | ||
+ | |||
+ | Using Legendre’s formula for <math>\nu_2(n!)</math>, | ||
+ | <cmath>\nu_2(\binom{69}{23}) = \nu_2(69!) - \nu_2(46!) - \nu_2(23!) = 65 - 44 - 16 = 5.</cmath> | ||
+ | |||
+ | So the power of 2 in the denominator is 69, and in the numerator is 5, leaving a net power of | ||
+ | <cmath>69 - 5 = \boxed{64}.</cmath> | ||
+ | |||
+ | ~SMO_Team |
Latest revision as of 21:23, 9 September 2025
Contents
Problem
Let and let there be randomly chosen sets
where
. The probability that
can be expressed as
. Let
be the largest power of
such
. Find
.
Solution
The number of ordered triples that satisfy the given property is equal to
Substituting , this becomes
We now evaluate this sum in two ways.
Method 1
Consider a set of 69 elements, partitioned into three disjoint subsets
,
, and
, each of size 23. Choosing any 23 elements from
corresponds to choosing
from
,
from
, and
from
such that
. This is a bijection to the sum, so the value is
Method 2
By the binomial theorem, so the sum is the coefficient of
in
, which is again
The total number of possible ordered subsets is
, so the desired probability is
To find the greatest power of 2 dividing this expression, note that
Using Legendre’s formula for ,
So the power of 2 in the denominator is 69, and in the numerator is 5, leaving a net power of
~SMO_Team