2015 AIME II Problems/Problem 8
Problem
Let and be positive integers satisfying . The maximum possible value of is , where and are relatively prime positive integers. Find .
Solution
Let us call the quantity as for convenience. Knowing that and are positive integers, we can legitimately rearrange the given inequality so that is by itself, which makes it easier to determine the pairs of that work. Doing so, we have Now, observe that if we have that , regardless of the value of . If , we have the same result: that , regardless of the value of . Hence, we want to find pairs of positive integers existing such that neither nor is equal to , and that the conditions given in the problem are satisfied in order to check that the maximum value for is not .
To avoid the possibility that , we want to find values of such that . If we do this, we will have that , where is greater than , and this allows us to choose values of greater than . Again, since is a positive integer, and we want , we can legitimately multiply both sides of by to get . For , we have that , so the only possibility for greater than is obviously . Plugging these values into , we have that . For , we have that . Plugging and in for yields the same result of , but plugging and into yields that . Clearly, is the largest value we can have for , so our answer is .
Solution 2 (Proof without words)
$$ (Error compiling LaTeX. Unknown error_msg)2a - 32b - 3 \in \{x \neq 2k, k \in Z \}; \rightarrow(2a - 3)(2b - 3) = 1, 3 \rightarrow (2a - 3, 2b - 3) = (1, 1), (1, 3), (3, 1).(a, b) = (2, 2), (2, 3), (3, 2).\frac{a^3 b^3 + 1}{a^3 + b^3} = \frac{65}{16}, \frac{31}{5}.\frac{31}{5} \rightarrow \boxed{36}.$$ (Error compiling LaTeX. Unknown error_msg)
See also
2015 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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.