Difference between revisions of "2018 AIME I Problems/Problem 12"
(→Solution) |
(→Solution 1 (Rigorous)) |
||
(35 intermediate revisions by 6 users not shown) | |||
Line 2: | Line 2: | ||
For every subset <math>T</math> of <math>U = \{ 1,2,3,\ldots,18 \}</math>, let <math>s(T)</math> be the sum of the elements of <math>T</math>, with <math>s(\emptyset)</math> defined to be <math>0</math>. If <math>T</math> is chosen at random among all subsets of <math>U</math>, the probability that <math>s(T)</math> is divisible by <math>3</math> is <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m</math>. | For every subset <math>T</math> of <math>U = \{ 1,2,3,\ldots,18 \}</math>, let <math>s(T)</math> be the sum of the elements of <math>T</math>, with <math>s(\emptyset)</math> defined to be <math>0</math>. If <math>T</math> is chosen at random among all subsets of <math>U</math>, the probability that <math>s(T)</math> is divisible by <math>3</math> is <math>\frac{m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m</math>. | ||
− | ==Solution== | + | ==Solution 1 (Rigorous)== |
+ | |||
+ | The question asks us for the probability that a randomly chosen subset of the set of the first 18 positive integers has the property that the sum of its elements is divisible by 3. Note that the total number of subsets is <math>2^{18}</math> because each element can either be in or not in the subset. To find the probability, we will find the total numbers of ways the problem can occur and divide by <math>2^{18}</math>. | ||
+ | |||
+ | To simplify the problem, let’s convert the set to mod 3: | ||
+ | |||
+ | <cmath>U' = \{1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0\}</cmath> | ||
+ | |||
+ | Note that there are six elements congruent to 0 mod 3, 6 congruent to 1 mod 3, and 6 congruent to 2 mod 3. After conversion to mod three, the problem is the same but we’re dealing with much simpler numbers. Let’s apply casework on this converted set based on <math>S = s(T')</math>, the sum of the elements of a subset <math>T'</math> of <math>U'</math>. | ||
+ | |||
+ | <math>\textbf{Case 1: }S=0</math> | ||
+ | |||
+ | In this case, we can restrict the subsets to subsets that only contain 0. There are six 0’s and each one can be in our out of the subset, for a total of <math>2^{6} = 64</math> subsets. In fact, for every case we will have, we can always add a sequence of 0’s and the total sum will not change, so we will have to multiply by 64 for each case. Therefore, let’s just calculate the total number of ways we can have each case and remember to multiply it in after summing up the cases. This is equivalent to finding the number of ways you can choose such subsets without including the 0's. Therefore this case gives us <math>\boxed{1}</math> way. | ||
+ | |||
+ | <math>\textbf{Case 2: }S= 3</math> | ||
+ | |||
+ | In this case and each of the subsequent cases, we denote the number of 1’s in the case and the number of two’s in the case as <math>x, y</math> respectively. Then in this case we have two subcases; | ||
+ | |||
+ | <math>x, y = 3,0: </math> This case has <math>\tbinom{6}{3} \cdot \tbinom{6}{0} = 20 </math> ways. | ||
+ | |||
+ | <math>x, y = 1,1: </math> This case has <math>\tbinom{6}{1} \cdot \tbinom{6}{1} = 36 </math> ways. | ||
+ | |||
+ | In total, this case has <math>20+36=\boxed{56}</math> ways. | ||
+ | |||
+ | <math>\textbf{Case 3: }S=6</math> | ||
+ | |||
+ | In this case, there are 4 subcases; | ||
+ | |||
+ | <math>x, y = 6,0: </math> This case has <math>\tbinom{6}{6} \cdot \tbinom{6}{0} = 1 </math> way. | ||
+ | |||
+ | <math>x, y = 4,1: </math> This case has <math>\tbinom{6}{4} \cdot \tbinom{6}{1} = 90 </math> ways. | ||
+ | |||
+ | <math>x, y = 2,2: </math> This case has <math>\tbinom{6}{2} \cdot \tbinom{6}{2} = 225 </math> ways. | ||
+ | |||
+ | <math>x, y = 0,3: </math> This case has <math>\tbinom{6}{0} \cdot \tbinom{6}{3} = 20 </math> ways. | ||
+ | |||
+ | In total, this case has <math>1+90+225+20=\boxed{336}</math> ways. | ||
+ | |||
+ | Note that for each case, the # of 1’s goes down by 2 and the # of 2’s goes up by 1. This is because the sum is fixed, so when we change one it must be balanced out by the other. This is similar to the Diophantine equation <math>x + 2y= S</math> and the total number of solutions will be <math>\tbinom{6}{x} \cdot \tbinom{6}{y}</math>. From here we continue our casework, and our subcases will be coming out quickly as we have realized this relation. | ||
+ | |||
+ | <math>\textbf{Case 4: }S=9</math> | ||
+ | |||
+ | In this case we have 3 subcases: | ||
+ | |||
+ | <math>x, y = 5,2: </math> This case has <math>\tbinom{6}{5} \cdot \tbinom{6}{1} = 90 </math> ways. | ||
+ | |||
+ | <math>x, y = 3,3: </math> This case has <math>\tbinom{6}{3} \cdot \tbinom{6}{3} = 400 </math> ways. | ||
+ | |||
+ | <math>x, y = 1,4: </math> This case has <math>\tbinom{6}{1} \cdot \tbinom{6}{4} = 90 </math> ways. | ||
+ | |||
+ | In total, this case has <math>90+400+90=\boxed{580}</math> ways. | ||
+ | |||
+ | <math>\textbf{Case 5: } S=12</math> | ||
+ | |||
+ | In this case we have 4 subcases: | ||
+ | |||
+ | <math>x, y = 6,3: </math> This case has <math>\tbinom{6}{6} \cdot \tbinom{6}{3} = 20 </math> ways. | ||
+ | |||
+ | <math>x, y = 4,4: </math> This case has <math>\tbinom{6}{4} \cdot \tbinom{6}{4} = 225 </math> ways. | ||
+ | |||
+ | <math>x, y = 2,5: </math> This case has <math>\tbinom{6}{2} \cdot \tbinom{6}{5} = 90 </math> ways. | ||
+ | |||
+ | <math>x, y = 0,6: </math> This case has <math>\tbinom{6}{0} \cdot \tbinom{6}{6} = 1 </math> way. | ||
+ | |||
+ | Therefore the total number of ways in this case is <math>20 + 225 + 90 + 1=\boxed{336}</math>. | ||
+ | Here we notice something interesting. Not only is the answer the same as Case 3, the subcases deliver the exact same answers, just in reverse order. Why is that? | ||
+ | |||
+ | We discover the pattern that the values of <math>x, y</math> of each subcase of Case 5 can be obtained by subtracting the corresponding values of <math>x, y</math> of each subcase in Case 3 from 6 ( For example, the subcase 0, 6 in Case 5 corresponds to the subcase 6, 0 in Case 3). Then by the combinatorial identity, <math>\tbinom{6}{k} = \tbinom{6}{6-k}</math>, which is why each subcase evaluates to the same number. But can we extend this reasoning to all subcases to save time? | ||
+ | |||
+ | Let’s write this proof formally. Let <math>W_S</math> be the number of subsets of the set <math>\{1,2,1,2,1,2,1,2,1,2,1,2\}</math> (where each 1 and 2 is distinguishable) such that the sum of the elements of the subset is <math>S</math> and <math>S</math> is divisible by 3. We define the empty set as having a sum of 0. We claim that <math>W_S = W_{18-S}</math>. | ||
+ | |||
+ | <math>W_S = \sum_{i=1}^{|D|} \tbinom{6}{x_i}\tbinom{6}{y_i}</math> if and only if there exists <math>x_i, y_i</math> that satisfy <math>0\leq x_i \leq 6</math>, <math>0\leq y_i \leq 6</math>, <math>x_i + 2y_i = S</math>, and <math>D</math> is the set of the pairs <math>x_i, y_i</math>. This is because for each pair <math>x_i</math>, <math>y_i</math> there are six elements of the same residue mod(3) to choose <math>x_i</math> and <math>y_i</math> numbers from, and their value sum must be <math>S</math>. | ||
+ | |||
+ | Let all <math>x_n</math>, <math>y_n</math> satisfy <math>x_n = 6-x_i</math> and <math>y_n = 6-y_i</math>. | ||
+ | We can rewrite the equation <math> x_i+ 2y_i = S \implies -x_i- 2y_i = -S \implies 6-x_i+ 6-2y_i= 12 - S</math> | ||
+ | <math>\implies 6-x_i+12-2y_i = 18-S \implies 6-x_i + 2(6-y_i) = 18-S </math> | ||
+ | <cmath>\implies x_n + 2y_n = 18 - S</cmath> | ||
+ | |||
+ | Therefore, since <math>0\leq x_i, y_i\leq 6</math> and <math>x_n = 6-x_i</math> and <math>y_n = 6-y_i</math>, <math>0\leq x_n, y_n\leq 6</math>. As shown above, <math>x_n + 2y_n = 18 - S</math> and since <math>S</math> and 18 are divisible by 3, 18 -<math>S</math> is divisible by 3. Therefore, by the fact that <math>W_S = \sum_{i=1}^{|D|} \tbinom{6}{x_i}\tbinom{6}{y_i}</math>, we have that; | ||
+ | |||
+ | <math>W_{18-S} = \sum_{n=1}^{|D|} \tbinom{6}{x_n}\tbinom{6}{y_n} \implies W_{18-S} = \sum_{i=1}^{|D|} \tbinom{6}{6-x_i}\tbinom{6}{6-y_i} \implies W_{18-S} = \sum_{i=1}^{|D|} \tbinom{6}{x_i}\tbinom{6}{y_i} = W_S</math>, proving our claim. | ||
+ | |||
+ | We have found our shortcut, so instead of bashing out the remaining cases, we can use this symmetry. The total number of ways over all the cases is <math>\sum_{k=0}^{6} W_{3k} = 2 \cdot (1+56+336)+580 = 1366</math>. The final answer is <math>\frac{2^{6}\cdot 1366}{2^{18}} = \frac{1366}{2^{12}} = \frac{683}{2^{11}}. </math> | ||
+ | |||
+ | There are no more 2’s left to factor out of the numerator, so we are done and the answer is <math>\boxed{683}</math>. | ||
+ | |||
+ | |||
+ | ~KingRavi | ||
+ | |||
+ | ==Solution 2== | ||
+ | |||
+ | Consider the elements of <math>U</math> modulo <math>3.</math> | ||
+ | |||
Ignore the <math>0</math>'s because we're gonna multiply <math>\binom{6}{0}+..+\binom{6}{6}=2^6</math> at the end. Let <math>a</math> be the <math>1's</math> and <math>b</math> be the <math>2's</math>. The key here is that <math>2 \equiv -1 \pmod{3}</math> so the difference between the number of <math>a</math> and <math>b</math> is a multiple of <math>3</math>. | Ignore the <math>0</math>'s because we're gonna multiply <math>\binom{6}{0}+..+\binom{6}{6}=2^6</math> at the end. Let <math>a</math> be the <math>1's</math> and <math>b</math> be the <math>2's</math>. The key here is that <math>2 \equiv -1 \pmod{3}</math> so the difference between the number of <math>a</math> and <math>b</math> is a multiple of <math>3</math>. | ||
Line 23: | Line 115: | ||
<math>0a,0b</math> | <math>0a,0b</math> | ||
− | By Vandermonde's | + | By [[Combinatorial identity | Vandermonde's Identity]] on the second case, this is <math>2^6 \left( 2\left(1+20+90+90+20\right) + \binom{12}{6} \right)\implies \boxed{683}</math> |
− | ==Solution | + | |
− | Rewrite the set after mod 3 | + | ==Solution 3== |
+ | Rewrite the set after mod 3 as above | ||
1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 | 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 | ||
Line 108: | Line 201: | ||
By SpecialBeing2017 | By SpecialBeing2017 | ||
− | ==Solution | + | ==Solution 4== |
Consider the numbers <math>\{1,4,7,10,13,16\}</math>. Each of those are congruent to <math>1 \pmod 3</math>. There is <math>{6 \choose 0}=1</math> way to choose zero numbers <math>{6 \choose 1}=6</math> ways to choose <math>1</math> and so on. There ends up being <math>{6 \choose 0}+{6 \choose 3}+{6 \choose 6} = 22</math> possible subsets congruent to <math>0\pmod 3</math>. There are <math>2^6=64</math> possible subsets of these numbers. By symmetry there are <math>21</math> subsets each for <math>1 \pmod 3</math> and <math>2 \pmod3</math>. | Consider the numbers <math>\{1,4,7,10,13,16\}</math>. Each of those are congruent to <math>1 \pmod 3</math>. There is <math>{6 \choose 0}=1</math> way to choose zero numbers <math>{6 \choose 1}=6</math> ways to choose <math>1</math> and so on. There ends up being <math>{6 \choose 0}+{6 \choose 3}+{6 \choose 6} = 22</math> possible subsets congruent to <math>0\pmod 3</math>. There are <math>2^6=64</math> possible subsets of these numbers. By symmetry there are <math>21</math> subsets each for <math>1 \pmod 3</math> and <math>2 \pmod3</math>. | ||
Line 115: | Line 208: | ||
For <math>\{3,6,9,12,15,18\}</math>, all <math>2^6</math> subsets are <math>0 \pmod3</math>. | For <math>\{3,6,9,12,15,18\}</math>, all <math>2^6</math> subsets are <math>0 \pmod3</math>. | ||
− | So the probability is: <math>\frac{(22\cdot22+ | + | So the probability is: <math>\frac{(22\cdot22+21\cdot21+21\cdot21)\cdot2^6}{2^{18}}=\frac{683}{2^{11}}</math> |
− | ==Solution | + | ==Solution 5== |
Notice that six numbers are <math>0\pmod3</math>, six are <math>1\pmod3</math>, and six are <math>2\pmod3</math>. Having numbers <math>0\pmod3</math> will not change the remainder when <math>s(T)</math> is divided by <math>3</math>, so we can choose any number of these in our subset. We ignore these for now. The number of numbers that are <math>1\pmod3</math>, minus the number of numbers that are <math>2\pmod3</math>, must be a multiple of <math>3</math>, possibly zero or negative. We can now split into cases based on how many numbers that are <math>1\pmod3</math> are in the set. | Notice that six numbers are <math>0\pmod3</math>, six are <math>1\pmod3</math>, and six are <math>2\pmod3</math>. Having numbers <math>0\pmod3</math> will not change the remainder when <math>s(T)</math> is divided by <math>3</math>, so we can choose any number of these in our subset. We ignore these for now. The number of numbers that are <math>1\pmod3</math>, minus the number of numbers that are <math>2\pmod3</math>, must be a multiple of <math>3</math>, possibly zero or negative. We can now split into cases based on how many numbers that are <math>1\pmod3</math> are in the set. | ||
− | Case 1- <math>0</math>, <math>3</math>, or <math>6</math> integers: There can be <math>0</math>, <math>3</math>, or <math>6</math> integers that are <math>2\pmod3</math>. We can choose these in < | + | Case 1- <math>0</math>, <math>3</math>, or <math>6</math> integers: There can be <math>0</math>, <math>3</math>, or <math>6</math> integers that are <math>2\pmod3</math>. We can choose these in <cmath>\left(\binom60+\binom63+\binom66\right)\cdot\left(\binom60+\binom63+\binom66\right)=(1+20+1)^2=484</cmath> |
− | Case 2- <math>1</math> or <math>4</math> integers: There can be <math>2</math> or <math>5</math> integers that are <math>2\pmod3</math>. We can choose these in < | + | Case 2- <math>1</math> or <math>4</math> integers: There can be <math>2</math> or <math>5</math> integers that are <math>2\pmod3</math>. We can choose these in <cmath>\left(\binom61+\binom64\right)\cdot\left(\binom62+\binom65\right)=(6+15)^2=441</cmath> |
− | Case 3- <math>2</math> or <math>5</math> integers: There can be <math>1</math> or <math>4</math> integers that are <math>2\pmod3</math>. We can choose these in < | + | Case 3- <math>2</math> or <math>5</math> integers: There can be <math>1</math> or <math>4</math> integers that are <math>2\pmod3</math>. We can choose these in <cmath>\left(\binom62+\binom65\right)\cdot\left(\binom61+\binom64\right)=(15+6)^2=441</cmath> |
− | Adding these up, we get that there are <math>1366</math> ways to choose the numbers such that their sum is a multiple of three. Putting back in the possibility that there can be multiples of <math>3</math> in our set, we have that there are < | + | Adding these up, we get that there are <math>1366</math> ways to choose the numbers such that their sum is a multiple of three. Putting back in the possibility that there can be multiples of <math>3</math> in our set, we have that there are <cmath>1366\cdot\left(\binom60+\binom61+\binom62+\binom63+\binom64+\binom65+\binom66\right)=1366\cdot2^6</cmath> subsets <math>T</math> with a sum that is a multiple of <math>3</math>. Since there are <math>2^{18}</math> total subsets, the probability is <cmath>\frac{1366\cdot2^6}{2^{18}}=\frac{683}{2^{11}}</cmath>, so the answer is <math>\boxed{683}</math>. |
− | ==Solution | + | ==Solution 6== |
We use generating functions. Each element of <math>U</math> has two choices that occur with equal probability--either it is in the set or out of the set. Therefore, given <math>n\in U</math>, the probability generating function is | We use generating functions. Each element of <math>U</math> has two choices that occur with equal probability--either it is in the set or out of the set. Therefore, given <math>n\in U</math>, the probability generating function is | ||
<cmath>\frac{1}{2}+\frac{1}{2}x^n.</cmath> | <cmath>\frac{1}{2}+\frac{1}{2}x^n.</cmath> | ||
Line 144: | Line 237: | ||
Thus the answer is <math>\boxed{683}</math>. | Thus the answer is <math>\boxed{683}</math>. | ||
− | ==Solution | + | ==Solution 7== |
Define a set that "works" to be a set for which the sum of the terms is <math>0</math> mod <math>3</math>. The given set mod <math>3</math> is | Define a set that "works" to be a set for which the sum of the terms is <math>0</math> mod <math>3</math>. The given set mod <math>3</math> is | ||
<cmath>\{1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0\}.</cmath> | <cmath>\{1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0\}.</cmath> | ||
Line 161: | Line 254: | ||
<cmath>w(18)=2( 2^{15} + 2( 2^{12} + 2( 2^9 + 2( 2^6 + 2( 2^3 + 4 ) ) ) ) )=87424.</cmath> | <cmath>w(18)=2( 2^{15} + 2( 2^{12} + 2( 2^9 + 2( 2^6 + 2( 2^3 + 4 ) ) ) ) )=87424.</cmath> | ||
Because there are <math>2^{18}</math> total possible subsets, the desired probability is | Because there are <math>2^{18}</math> total possible subsets, the desired probability is | ||
− | <cmath>\frac{w( | + | <cmath>\frac{w(18)}{2^{18}}=\frac{87424}{2^{18}}=\frac{683}{2048},</cmath> |
so the answer is <math>\boxed{683}.</math> | so the answer is <math>\boxed{683}.</math> | ||
− | ==Solution | + | ==Solution 8== |
Try smaller cases and find a pattern. Using similar casework as in Solution 1, we can easily find the desired probability if <math>U</math> is of a small size. | Try smaller cases and find a pattern. Using similar casework as in Solution 1, we can easily find the desired probability if <math>U</math> is of a small size. | ||
Line 175: | Line 268: | ||
Let <math>a_n</math> be the numerator of the desired probability if <math>U</math> is of size <math>3n</math>. Then <math>a_1 = 1, a_2 = 3,</math> and <math>a_3 = 11</math>. Noticing that the denominators are multiplied by <math>4</math> each time, we can conclude that the pattern of the numerators is <math>a_n = 4a_{n-1} - 1</math>, so <math>a_6 = \boxed{683}</math>. | Let <math>a_n</math> be the numerator of the desired probability if <math>U</math> is of size <math>3n</math>. Then <math>a_1 = 1, a_2 = 3,</math> and <math>a_3 = 11</math>. Noticing that the denominators are multiplied by <math>4</math> each time, we can conclude that the pattern of the numerators is <math>a_n = 4a_{n-1} - 1</math>, so <math>a_6 = \boxed{683}</math>. | ||
− | ==Solution | + | ==Solution 9 (Quick guesswork for about 2 minutes remaining)== |
− | |||
− | |||
− | (The value approached as n | + | We conjecture that the difference from the probability will be as small as possible from <math>\frac{1}{3}</math> (The value approached as <math> n \rightarrow \infty</math> , where <math>n</math> is the number of terms in the largest subset). |
− | We also see that there are 2^18 subsets and know the denominator will be a power of 2 | + | We also see that there are <math>2^{18}</math> subsets and know the denominator will be a power of <math>2</math> (since the numerator is an integer). |
− | (since the numerator is an integer). | ||
− | We essentially want to guess that the greatest integer n satisfying (2^n | + | We essentially want to guess that the greatest integer <math>n</math> satisfying <math>\left(\frac{2^n}{3}\right)-1 <1000</math> can be plugged in to get the solution of round <math>\left( \frac{2^n}{3} \right)</math>. |
− | We see that this occurs at n=11, and get round(2^11 | + | We see that this occurs at <math>n=11</math>, and get round <math>\left( \frac{2^{11}}{3} \right)=</math>round(<math>682.66...</math>)= <math>683</math>. |
==See Also== | ==See Also== | ||
{{AIME box|year=2018|n=I|num-b=11|num-a=13}} | {{AIME box|year=2018|n=I|num-b=11|num-a=13}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 20:04, 12 January 2022
Contents
Problem
For every subset of , let be the sum of the elements of , with defined to be . If is chosen at random among all subsets of , the probability that is divisible by is , where and are relatively prime positive integers. Find .
Solution 1 (Rigorous)
The question asks us for the probability that a randomly chosen subset of the set of the first 18 positive integers has the property that the sum of its elements is divisible by 3. Note that the total number of subsets is because each element can either be in or not in the subset. To find the probability, we will find the total numbers of ways the problem can occur and divide by .
To simplify the problem, let’s convert the set to mod 3:
Note that there are six elements congruent to 0 mod 3, 6 congruent to 1 mod 3, and 6 congruent to 2 mod 3. After conversion to mod three, the problem is the same but we’re dealing with much simpler numbers. Let’s apply casework on this converted set based on , the sum of the elements of a subset of .
In this case, we can restrict the subsets to subsets that only contain 0. There are six 0’s and each one can be in our out of the subset, for a total of subsets. In fact, for every case we will have, we can always add a sequence of 0’s and the total sum will not change, so we will have to multiply by 64 for each case. Therefore, let’s just calculate the total number of ways we can have each case and remember to multiply it in after summing up the cases. This is equivalent to finding the number of ways you can choose such subsets without including the 0's. Therefore this case gives us way.
In this case and each of the subsequent cases, we denote the number of 1’s in the case and the number of two’s in the case as respectively. Then in this case we have two subcases;
This case has ways.
This case has ways.
In total, this case has ways.
In this case, there are 4 subcases;
This case has way.
This case has ways.
This case has ways.
This case has ways.
In total, this case has ways.
Note that for each case, the # of 1’s goes down by 2 and the # of 2’s goes up by 1. This is because the sum is fixed, so when we change one it must be balanced out by the other. This is similar to the Diophantine equation and the total number of solutions will be . From here we continue our casework, and our subcases will be coming out quickly as we have realized this relation.
In this case we have 3 subcases:
This case has ways.
This case has ways.
This case has ways.
In total, this case has ways.
In this case we have 4 subcases:
This case has ways.
This case has ways.
This case has ways.
This case has way.
Therefore the total number of ways in this case is . Here we notice something interesting. Not only is the answer the same as Case 3, the subcases deliver the exact same answers, just in reverse order. Why is that?
We discover the pattern that the values of of each subcase of Case 5 can be obtained by subtracting the corresponding values of of each subcase in Case 3 from 6 ( For example, the subcase 0, 6 in Case 5 corresponds to the subcase 6, 0 in Case 3). Then by the combinatorial identity, , which is why each subcase evaluates to the same number. But can we extend this reasoning to all subcases to save time?
Let’s write this proof formally. Let be the number of subsets of the set (where each 1 and 2 is distinguishable) such that the sum of the elements of the subset is and is divisible by 3. We define the empty set as having a sum of 0. We claim that .
if and only if there exists that satisfy , , , and is the set of the pairs . This is because for each pair , there are six elements of the same residue mod(3) to choose and numbers from, and their value sum must be .
Let all , satisfy and . We can rewrite the equation
Therefore, since and and , . As shown above, and since and 18 are divisible by 3, 18 - is divisible by 3. Therefore, by the fact that , we have that;
, proving our claim.
We have found our shortcut, so instead of bashing out the remaining cases, we can use this symmetry. The total number of ways over all the cases is . The final answer is
There are no more 2’s left to factor out of the numerator, so we are done and the answer is .
~KingRavi
Solution 2
Consider the elements of modulo
Ignore the 's because we're gonna multiply at the end. Let be the and be the . The key here is that so the difference between the number of and is a multiple of .
1. Counted twice because and can be switched:
2. Counted once:
...
By Vandermonde's Identity on the second case, this is
Solution 3
Rewrite the set after mod 3 as above
1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0
All 0s can be omitted
Case 1 No 1 No 2
Case 2
Case 3
Case 4
Case 5
Case 6
Case 7
Case 8
Case 9
Case 10
Case 11
Case 12
Case 13
Case 14
Case 15
Case 16
Case 17
Total
ANS=
By SpecialBeing2017
Solution 4
Consider the numbers . Each of those are congruent to . There is way to choose zero numbers ways to choose and so on. There ends up being possible subsets congruent to . There are possible subsets of these numbers. By symmetry there are subsets each for and .
We get the same numbers for the subsets of .
For , all subsets are .
So the probability is:
Solution 5
Notice that six numbers are , six are , and six are . Having numbers will not change the remainder when is divided by , so we can choose any number of these in our subset. We ignore these for now. The number of numbers that are , minus the number of numbers that are , must be a multiple of , possibly zero or negative. We can now split into cases based on how many numbers that are are in the set.
Case 1- , , or integers: There can be , , or integers that are . We can choose these in
Case 2- or integers: There can be or integers that are . We can choose these in
Case 3- or integers: There can be or integers that are . We can choose these in
Adding these up, we get that there are ways to choose the numbers such that their sum is a multiple of three. Putting back in the possibility that there can be multiples of in our set, we have that there are subsets with a sum that is a multiple of . Since there are total subsets, the probability is , so the answer is .
Solution 6
We use generating functions. Each element of has two choices that occur with equal probability--either it is in the set or out of the set. Therefore, given , the probability generating function is Therefore, in the generating function the coefficient of represents the probability of obtaining a sum of . We wish to find the sum of the coefficients of all terms of the form . If is a cube root of unity, then it is well know that for a polynomial , will yield the sum of the coefficients of the terms of the form . Then we find To evaluate the last two products, we utilized the facts that and . Therefore, the desired probability is Thus the answer is .
Solution 7
Define a set that "works" to be a set for which the sum of the terms is mod . The given set mod is Let be the number of subsets of the first terms of this set that "work." Consider just the first terms: There are total subsets, and (the subsets are and ). Now consider the first terms: To find , we set aside the last terms as a "reserve" that we can pair with subsets of the first terms (which we looked at earlier).
First, all subsets of the first terms can either be paired with a or a (or nothing) from the "reserve" terms so that they "work," creating subsets that "work" already. But for each of these, we have the option to add a from the reserve, so we now have subsets that "work." For each of the subsets of the first terms that "work", we can also add on a or a from the reserves, creating new subsets that "work." And that covers all of them. With all of this information, we can write as The same process can be used to calculate then etc. so we can generalize it to Thus, we calculate with this formula: Because there are total possible subsets, the desired probability is so the answer is
Solution 8
Try smaller cases and find a pattern. Using similar casework as in Solution 1, we can easily find the desired probability if is of a small size.
If , then out of subsets work, for a probability of .
If , then out of subsets work, for a probability of .
If , then out of subsets work, for a probability of .
Let be the numerator of the desired probability if is of size . Then and . Noticing that the denominators are multiplied by each time, we can conclude that the pattern of the numerators is , so .
Solution 9 (Quick guesswork for about 2 minutes remaining)
We conjecture that the difference from the probability will be as small as possible from (The value approached as , where is the number of terms in the largest subset).
We also see that there are subsets and know the denominator will be a power of (since the numerator is an integer).
We essentially want to guess that the greatest integer satisfying can be plugged in to get the solution of round .
We see that this occurs at , and get round round()= .
See Also
2018 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.