返回题库

AIME 1984 · 第 10 题

AIME 1984 — Problem 10

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Mary told John her score on the American High School Mathematics Examination (AHSME), which was over 8080. From this, John was able to determine the number of problems Mary solved correctly. If Mary's score had been any lower, but still over 8080, John could not have determined this. What was Mary's score? (Recall that the AHSME consists of 3030 multiple choice problems and that one's score, ss, is computed by the formula s=30+4cws=30+4c-w, where cc is the number of correct answers and ww is the number of wrong answers. Students are not penalized for problems left unanswered.)

解析

Solution 1 (Inequalities)

Let Mary's score, number correct, and number wrong be s,c,ws,c,w respectively. Then

s=30+4cw=30+4(c1)(w4)=30+4(c+1)(w+4).\begin{aligned} s&=30+4c-w \\ &=30+4(c-1)-(w-4) \\ &=30+4(c+1)-(w+4). \end{aligned} Therefore, Mary could not have left at least five blank; otherwise, one more correct and four more wrong would produce the same score. Similarly, Mary could not have answered at least four wrong (clearly Mary answered at least one right to have a score above 8080, or even 3030.)

It follows that c+w26c+w\geq 26 and w3w\leq 3, so c23c\geq 23 and s=30+4cw30+4(23)3=119s=30+4c-w\geq 30+4(23)-3=119. So Mary scored at least 119119. To see that no result other than 2323 right/33 wrong produces 119119, note that s=1194cw=89s=119\Rightarrow 4c-w=89 so w3(mod4)w\equiv 3\pmod{4}. But if w=3w=3, then c=23c=23, which was the result given; otherwise w7w\geq 7 and c24c\geq 24, but this implies at least 3131 questions, a contradiction. This makes the minimum score 119\boxed{119}.

Solution 2 (Arithmetic)

A less technical approach that still gets the job done:

Pretend that the question is instead a game, where we are trying to get certain numbers by either adding 44 or 5.5. The maximum number we can get is 70.70. The goal of the game is to find out what number we can achieve in only ONE method, while all other numbers above that can be achieved with TWO or MORE methods. (Note: This is actually the exact same problem as the original, just reworded differently and now we are adding the score. If this is already confusing, I suggest not looking further.)

For example, the number "21""21" can be achieved with only 11 method (4+4+4+4+5).(4+4+4+4+5). However, 2525, which is a larger number than 2121, can be achieved with multiple methods (e.g. 555 \cdot 5 or 45+54 \cdot 5 + 5), hence 2121 is not the number we are trying to find.

If we make a table of adding 44 or adding 55, we will see we get 4,8,12,16,20,4, 8, 12, 16, 20, etc. if we add only 44s and if we add 55 to those numbers then we will get 9,13,17,21,25,9, 13, 17, 21, 25, etc. Now a key observation to getting this problem correct is that if we can add one of those previous base numbers to 2020, then there will be multiple methods (because 20=45=5420 = 4 \cdot 5 = 5 \cdot 4).

Hence, the number we are looking for cannot be 2020 plus one of those base numbers. Instead, it must be 1010 plus that base number, because that results in the same last digit while maintaining only one method to solve. For example, if we start with 44, the number 1414 would have only 11 method to solve, but the number 2424 would have multiple (because 4+20=244 + 20 = 24 and we are trying to avoid adding 2020). The largest number we see that is in our base numbers is 21.21. Hence, our maximum number is 21+10=31.21 + 10 = 31.

Note that if we have the number 2525, that can be solved via multiple methods, and if we keep repeating our cycle of base numbers, we are basically adding 2020 to a previous base number, which we don't want.

And since the maximum number of this game is 3131, that is the number we subtract from the maximum score of 150150, so we get 15031=119.150 - 31 = \boxed{119}.

P.S. didn't think the solution would be this complicated when I first wrote it but it's quite complicated. Look to solution 11 if you want a concise method using inequalities that's probably better than this solution.

Solution 3 (Table)

Based on the value of c,c, we construct the following table:

[2.5ex]c12131415161718192021222324252627282930[2.25ex]smin6065707580859095100105110115120125130135140145150[2.25ex]smax788286909498102106110114118122126130134138142146150\begin{array}{c||c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c|c} &\hspace{5.5mm}&\hspace{5.5mm}&\hspace{5.5mm}&\hspace{5.5mm}&\hspace{5.5mm}&\hspace{5.5mm}&\hspace{5.5mm}&&&&&&&&&&&&& \\ [-2.5ex] \boldsymbol{c} &\boldsymbol{\cdots}&\boldsymbol{12}&\boldsymbol{13}&\boldsymbol{14}&\boldsymbol{15}&\boldsymbol{16}&\boldsymbol{17}&\boldsymbol{18}&\boldsymbol{19}&\boldsymbol{20}&\boldsymbol{21}&\boldsymbol{22}&\boldsymbol{23}&\boldsymbol{24}&\boldsymbol{25}&\boldsymbol{26}&\boldsymbol{27}&\boldsymbol{28}&\boldsymbol{29}&\boldsymbol{30} \\ \hline \hline &&&&&&&&&&&&&&&&&&& \\ [-2.25ex] \boldsymbol{s_{\min}} &\cdots&60&65&70&75&80&85&90&95&100&105&110&115&120&125&130&135&140&145&150 \\ \hline &&&&&&&&&&&&&&&&&&& \\ [-2.25ex] \boldsymbol{s_{\max}} &\cdots&78&82&86&90&94&98&102&106&110&114&118&122&126&130&134&138&142&146&150 \end{array} For a fixed value of c,c, note that smins_{\min} occurs at w=30c,w=30-c, and smaxs_{\max} occurs at w=0.w=0. Moreover, all integers from smins_{\min} through smaxs_{\max} are attainable. To find Mary's score, we look for the lowest score s\boldsymbol{s} such that s80\boldsymbol{s\geq80} and s\boldsymbol{s} is contained in exactly one interval.

Let S(c)S(c) denote the interval of all possible scores ss with cc correct answers. We need:

  1. S(c)⊄S(c1)S(c+1).S(c)\not\subset S(c-1)\cup S(c+1).
  2. sS(c)s\in S(c) but s∉S(c1)S(c+1).s\not\in S(c-1)\cup S(c+1).

It follows that the least such value of cc is 23,23, from which the lowest such score ss is 119.\boxed{119}.

~MRENTHUSIASM

Solution 4 (Less Rigorous Version of Solution 1)

Given that Mary's score is 30+4cw30+4c-w, two other ways to get that score are 30+4(c+1)(w+4)30+4(c+1)-(w+4) and 30+4(c1)(w4)30+4(c-1)-(w-4). Since it is clear that c>1c>1, we must have w<4w<4. In order to minimize the score, assume that w=3w=3. The number of problems left blank must be less than 55 because of the 30+4(c+1)(w+4)30+4(c+1)-(w+4) case. In order to minimize the score, assume that the number of problems left blank is 44, making the number of correct problems 2323. Substituting, we get that s=30+2343s=30+23{\,\cdot\,}4-3, so s=119s=\boxed{119}.

~JeffersonJ

Video Solution

1984 AIME #10

MathProblemSolvingSkills.com