Difference between revisions of "2018 AMC 12B Problems/Problem 17"
MRENTHUSIASM (talk | contribs) m |
MRENTHUSIASM (talk | contribs) m (→Solution 7) |
||
Line 89: | Line 89: | ||
Once <math>q>14,</math> it is possible for <math>9p-5q</math> to be equal to <math>2,</math> so <math>p</math> could also be equal to <math>\frac{5q+2}{9}.</math> The next value, <math>q=15,</math> is not a solution, but <math>q=16</math> gives <math>p=\frac{5\cdot 16 + 1}{9} = 9.</math> Thus, the smallest possible value of <math>q</math> is <math>16,</math> and the answer is <math>16-9= \boxed{\textbf{(A) } 7}.</math> | Once <math>q>14,</math> it is possible for <math>9p-5q</math> to be equal to <math>2,</math> so <math>p</math> could also be equal to <math>\frac{5q+2}{9}.</math> The next value, <math>q=15,</math> is not a solution, but <math>q=16</math> gives <math>p=\frac{5\cdot 16 + 1}{9} = 9.</math> Thus, the smallest possible value of <math>q</math> is <math>16,</math> and the answer is <math>16-9= \boxed{\textbf{(A) } 7}.</math> | ||
− | ==Solution 7== | + | ==Solution 7 (Trial and Error)== |
− | Start with <math>\frac{5}{9}</math> | + | Start with <math>\frac{5}{9}.</math> Repeat the following process until you arrive at the answer: if the fraction is less than or equal to <math>\frac{5}{9},</math> add <math>1</math> to the numerator; otherwise, if it is greater than or equal to <math>\frac{4}{7},</math> add one <math>1</math> to the denominator. We have <cmath>\frac{5}{9}, \frac{6}{9}, \frac{6}{10}, \frac{6}{11}, \frac{7}{11}, \frac{7}{12}, \frac{7}{13}, \frac{8}{13}, \frac{8}{14}, \frac{8}{15}, \frac{9}{15}, \frac{9}{16}.</cmath> |
− | + | Therefore, the answer is <math>16 - 9 = \boxed{\textbf{(A) } 7}.</math> | |
− | |||
− | <math>16 - 9 = \boxed{\textbf{(A) } 7}</math> | ||
== Solution 8 (Quick inspection) == | == Solution 8 (Quick inspection) == |
Revision as of 00:13, 15 October 2021
Contents
- 1 Problem
- 2 Solution 1 (Generalization)
- 3 Solution 2 (Generalization)
- 4 Solution 3 (Substitution)
- 5 Solution 4 (Substitution)
- 6 Solution 5 (Manipulation)
- 7 Solution 6 (Solves for p)
- 8 Solution 7 (Trial and Error)
- 9 Solution 8 (Quick inspection)
- 10 Solution 9
- 11 Solution 10 (Using answer choices to prove mediant)
- 12 Solution 11 (testing answer choices)
- 13 Solution 12 (requires justification)
- 14 See Also
Problem
Let and be positive integers such that and is as small as possible. What is ?
Solution 1 (Generalization)
More generally, let and be positive integers such that and From we have or From we have or Since note that:
- Multiplying by multiplying by and adding the results, we get
- Multiplying by multiplying by and adding the results, we get
To minimize we set from which Together, we can prove that For this problem, we have and so and The answer is
Remark
We will prove each part of the compound inequality in
- and
Let so The precondition becomes so
It follows that Moreover, the equality case occurs if and only if
We can prove by the same process. Similarly, the equality case occurs if and only if
Let and so and
It follows that Moreover, this part of is independent of the precondition
~MRENTHUSIASM
Solution 2 (Generalization)
Define variables and as Solution 1 does. Moreover, this solution refers to inequalities and in Solution 1.
Note that Multiplying both sides of by we get
For this problem, we have and so At we have from which Therefore, the answer is
Alternatively, refer to the Remark section in Solution 1 for further generalizations.
~pieater314159 ~MRENTHUSIASM
Solution 3 (Substitution)
Inverting the given inequality we get which simplifies to We can now substitute Note we need to find which simplifies to Cleary We will now substitute to get The inequality simplifies to
The inequality simplifies to
Combining the two inequalities, we get Since and are integers, the smallest values of and that satisfy the above equation are and respectively. Substituting these back in, we arrive with an answer of
Solution 4 (Substitution)
Because and are positive integers with we can let where Now, the problem condition reduces to
Our first inequality is which gives us or
Our second inequality is which gives us or
Hence, we have or
It is clear that we are aiming to find the least positive integer value of such that there is at least one value of that satisfies the inequality.
Now, simple casework through the answer choices of the problem reveals that
Solution 5 (Manipulation)
We subtract from both sides of the equation, so Then for to be as small as possible, has to be so is and is
~purplepenguin2
Solution 6 (Solves for p)
Cross-multiply the inequality to get Then, we have or Since and are integers, is an integer. To minimize start from which gives This limits to be greater than so test values of starting from However, to do not give integer values of
Once it is possible for to be equal to so could also be equal to The next value, is not a solution, but gives Thus, the smallest possible value of is and the answer is
Solution 7 (Trial and Error)
Start with Repeat the following process until you arrive at the answer: if the fraction is less than or equal to add to the numerator; otherwise, if it is greater than or equal to add one to the denominator. We have
Therefore, the answer is
Solution 8 (Quick inspection)
Checking possible fractions within the interval can get us to the answer, but only if we do it with more skill. The interval can also be written as . This represents fraction with the numerator a little bit more than half the denominator. Every fraction we consider must not exceed this range.
The denominators to be considered are . We check . At this point we know that we've got our fraction and our answer is
The inspection was made faster by considering the fact that .
So, once a fraction was gotten which was greater than we jump to the next denominator.
We then make sure we consider fractions with higher positive difference between the denominator and numerator. And we also do not forget that the numerator must be greater than half of the denominator.
( was obviously skipped because it is equal to .)
~OlutosinNGA
Solution 9
Graph the regions and . Note that the lattice point is the smallest magnitude one which appears within the region bounded by the two graphs. Thus, our fraction is and the answer is .
Remark: This also gives an intuitive geometric proof of the mediant using vectors.
Solution 10 (Using answer choices to prove mediant)
As the other solutions do, the mediant is between the two fractions, with a difference of . Suppose that the answer was not , then the answer must be or as otherwise would be negative. Then, the possible fractions with lower denominator would be for and for which are clearly not anywhere close to
Solution 11 (testing answer choices)
In ascending order, we can use answer choices, values for , as a method of figuring out our answer through the means of substitution. Let the assumed difference be 7. Then, . We thus have two inequalities: and .
Solving for in these equalities, we get . is between and , making it 16 as is a positive integer (again, at this point, this is still an assumption). This would set . , so the minimum difference is, in fact, indeed .
~ mesmore
Solution 12 (requires justification)
Assume that the difference results in a fraction of the form . Then,
Also assume that the difference results in a fraction of the form . Then,
Solving the system of equations yields and . Therefore, the answer is
See Also
2018 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 16 |
Followed by Problem 18 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.