Difference between revisions of "1984 AIME Problems/Problem 10"
MRENTHUSIASM (talk | contribs) m (→Solution 3 (Table)) |
MRENTHUSIASM (talk | contribs) (→Solution 3 (Table)) |
||
Line 41: | Line 41: | ||
For a fixed value of <math>c,</math> note that <math>s_{\min}</math> occurs at <math>w=30-c,</math> and <math>s_{\max}</math> occurs at <math>w=0.</math> Moreover, all integers from <math>s_{\min}</math> through <math>s_{\max}</math> are attainable. <i><b>To find Mary's score, we look for the lowest score <math>\boldsymbol{s}</math> such that <math>\boldsymbol{s\geq80}</math> and <math>\boldsymbol{s}</math> is contained in exactly one interval.</b></i> | For a fixed value of <math>c,</math> note that <math>s_{\min}</math> occurs at <math>w=30-c,</math> and <math>s_{\max}</math> occurs at <math>w=0.</math> Moreover, all integers from <math>s_{\min}</math> through <math>s_{\max}</math> are attainable. <i><b>To find Mary's score, we look for the lowest score <math>\boldsymbol{s}</math> such that <math>\boldsymbol{s\geq80}</math> and <math>\boldsymbol{s}</math> is contained in exactly one interval.</b></i> | ||
− | Let <math>T(c)</math> denote the interval of all possible | + | Let <math>T(c)</math> denote the interval of all possible values <math>s</math> with <math>c</math> correct answers. We need: |
<ol style="margin-left: 1.5em;"> | <ol style="margin-left: 1.5em;"> | ||
<li><math>T(c)\not\subset T(c-1)\cup T(c+1).</math></li><p> | <li><math>T(c)\not\subset T(c-1)\cup T(c+1).</math></li><p> |
Revision as of 21:51, 16 June 2021
Contents
Problem
Mary told John her score on the American High School Mathematics Examination (AHSME), which was over . 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 , John could not have determined this. What was Mary's score? (Recall that the AHSME consists of multiple choice problems and that one's score, , is computed by the formula , where is the number of correct answers and 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 respectively. Then
.
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 , or even .)
It follows that and , so and . So Mary scored at least . To see that no result other than right/ wrong produces , note that so . But if , then , which was the result given; otherwise and , but this implies at least questions, a contradiction. This makes the minimum score .
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 or The maximum number we can get is 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 can be achieved with only method However, , which is a larger number than , can be achieved with multiple methods (e.g. or ), hence is not the number we are trying to find.
If we make a table of adding or adding , we will see we get etc. if we add only s and if we add to those numbers then we will get etc. Now a key observation to getting this problem correct is that if we can add one of those previous base numbers to , then there will be multiple methods (because ).
Hence, the number we are looking for cannot be plus one of those base numbers. Instead, it must be 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 , the number would have only method to solve, but the number would have multiple (because and we are trying to avoid adding ). The largest number we see that is in our base numbers is Hence, our maximum number is
Note that if we have the number , that can be solved via multiple methods, and if we keep repeating our cycle of base numbers, we are basically adding to a previous base number, which we don't want.
And since the maximum number of this game is , that is the number we subtract from the maximum score of , so we get
P.S. didn't think the solution would be this complicated when I first wrote it but it's quite complicated. Look to solution if you want a concise method using inequalities that's probably better than this solution.
Solution 3 (Table)
Based on the value of we construct the following table: For a fixed value of note that occurs at and occurs at Moreover, all integers from through are attainable. To find Mary's score, we look for the lowest score such that and is contained in exactly one interval.
Let denote the interval of all possible values with correct answers. We need:
- and
The least such value of is from which the least such value of is
~MRENTHUSIASM
See also
1984 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |