返回题库

AIME 2014 I · 第 12 题

AIME 2014 I — Problem 12

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 12

Let A={1,2,3,4}A=\{1,2,3,4\}, and ff and gg be randomly chosen (not necessarily distinct) functions from AA to AA. The probability that the range of ff and the range of gg are disjoint is mn\tfrac{m}{n}, where mm and nn are relatively prime positive integers. Find mm.

解析

Solution 1 (casework)

The natural way to go is casework. And the natural process is to sort ff and gg based on range size! Via Pigeonhole Principle, we see that the only real possibilities are: f1g1;f1g2;f1g3;f2g2f 1 g 1; f 1 g 2; f 1 g 3; f 2 g 2. Note that the 1,21, 2 and 1,31, 3 cases are symmetrical and we need just a 2*2. Note also that the total number of cases is 4444=484^4*4^4=4^8.

f1g1f 1 g 1: clearly, we choose one number as the range for ff, one for gg, yielding 1212 possibilities.

f1g2f 1 g 2 with symmetry (WLOG ff has 1 element): start by selecting numbers for the ranges. This yields 44 for the one number in ff, and 33 options for the two numbers for gg. Afterwards, note that the function with 2 numbers in the range can have 4+6+4=144+6+4=14 arrangements of these two numbers (1 of one, 3 of the other *2 and 2 of each). Therefore, we have 212142*12*14 possibilities, the 2 from symmetry.

f2g2f 2 g 2: no symmetry, still easy! Just note that we have 66 choices of which numbers go to ff and gg, and within each, 1414=19614*14=196 choices for the orientation of each of the two numbers. That's 61966*196 possibilities.

f1g3f 1 g 3: again, symmetrical (WLOG ff has one element): 44 ways to select the single element for ff, and then find the number of ways to distribute the 33 distinct numbers in the range for gg. The only arrangement for the frequency of each number is 1,1,2{1, 1, 2} in some order. Therefore, we have 33 ways to choose which number is the one represented twice, and then note that there are 1212 ways to arrange these! The number of possibilities in this situation is 243122 * 4 * 3 * 12.

Total, divided by 484^8, gets 3(1+272+227+233)47\frac{3 * (1 + 2 * 7^2 + 2^2 * 7 + 2^3 * 3)}{4^7}, with numerator 453\boxed{453}.

Solution 2 (casework)

We note there are 44=2564^4 = 256 possibilities for each of ff and gg from AA to AA since the input of the four values of each function has four options each for an output value.

We proceed with casework to determine the number of possible ff with range 1, 2, etc.

  • Range 1:

There are 4 possibilities: all elements output to 1, 2, 3, or 4.

  • Range 2:

We have (42)=6{{4}\choose {2}} = 6 ways to choose the two output elements for ff. At this point we have two possibilities: either ff has 3 of 1 element and 1 of the other, or 2 of each element. In the first case, there are 2 ways to pick the element which there are 3 copies of, and (41)=4{{4}\choose {1}} = 4 ways to rearrange the 4 elements, for a total of 642=486 * 4 * 2 = 48 ways for this case. For the second case, there are (42)=6{{4}\choose {2}} = 6 ways to rearrange the 4 elements, for a total of 66=366 * 6 = 36 ways for this case. Adding these two, we get a total of 36+48=8436 + 48 = 84 total possibilities.

  • Range 3:

We have (43)=4{{4}\choose {3}} = 4 ways to choose the three output elements for ff. We know we must have 2 of 1 element and 1 of each of the others, so there are 3 ways to pick this element. Finally, there are (41)(31)=12{{4}\choose{1}}*{{3}\choose{1}} = 12 ways to rearrange these elements (since we can pick the locations of the 2 single elements in this many ways), and our total is 4312=1444 * 3 * 12 = 144 ways.

  • Range 4:

Since we know the elements present, we have 4!4! ways to arrange them, or 24 ways.

(To check, 4+84+144+24=2564 + 84 + 144 + 24 = 256, which is the total number of possibilities).

We now break ff down by cases, and count the number of gg whose ranges are disjoint from ff's.

  • Case 1: ff's range contains 1 element

We know that there are 3 possibilities for gg with 1 element. Since half the possibilities for gg with two elements will contain the element in ff, there are 84/2=4284/2 = 42 possibilities for gg with 2 elements. Since 3/43/4 the possibilities for gg with 3 elements will contain the element in ff, there are 144/4=36144/4 = 36 possibilities for gg with 3 elements. Clearly, no 4-element range for gg is possible, so the total number of ways for this case to happen is 4(3+42+36)=3244(3 + 42 + 36) = 324.

  • Case 2: ff's range contains 2 elements

We know that there are 2 possibilities for gg with 1 element. If gg has 2 elements in its range, they are uniquely determined, so the total number of sets with a range of 2 elements that work for gg is 84/6=1484/6 = 14. No 3-element or 4-element ranges for gg are possible. Thus, the total number of ways for this to happen is 84(2+14)=134484(2 + 14) = 1344.

  • Case 3: ff's range contains 3 elements

In this case, there is only 1 possibility for gg - all the output values are the element that does not appear in ff's range. Thus, the total number of ways for this to happen is 144144.

  • Summing the cases

We find that the probability of ff and gg having disjoint ranges is equal to:

324+1344+1442562=1812216=453214\dfrac{324 + 1344 + 144}{256^2}=\dfrac{1812}{2^{16}}= \dfrac{453}{2^{14}}

Thus, our final answer is 453\boxed{453}.

Solution 3 (simplification of Solution 2)

As before, there are 4 functions with a range of size 1, 84 with a range of size 2, and 144 with a range of size 3. If the range of ff has size kk, the codomain of gg is restricted to a set of size 4k4 - k. Any function from AA into this codomain will do, so there are (4k)4(4 - k)^4 possibilities for gg given a function ff. The probability of ff and gg having disjoint ranges is then

434+8424+14414(44)2=453214.\frac{4\cdot 3^4 + 84\cdot 2^4 + 144\cdot 1^4}{(4^4)^2} = \frac{\boxed{453}}{2^{14}}.

Video Solution

https://youtu.be/VFj6JesV93M?si=cDAOday30X0O__4T

~MathProblemSolvingSkills.com