Difference between revisions of "2015 AIME I Problems/Problem 10"
m |
|||
Line 13: | Line 13: | ||
<cmath>216a + 36b + 6c + d = 12</cmath> | <cmath>216a + 36b + 6c + d = 12</cmath> | ||
<cmath>343a + 49b + 7c + d = -12</cmath> | <cmath>343a + 49b + 7c + d = -12</cmath> | ||
− | Using any four of these functions as a system of equations yields <math>f(0) = 072</math> | + | Using any four of these functions as a system of equations yields <math>|f(0)| = \boxed{072}</math> |
Line 23: | Line 23: | ||
<cmath>a(2)^3 + c(2) = -12</cmath> | <cmath>a(2)^3 + c(2) = -12</cmath> | ||
<math>a=2</math> and <math>c=-14</math> | <math>a=2</math> and <math>c=-14</math> | ||
− | <cmath>|f(0)| = |2(-4)^3 - 14(-4)| = 072</cmath> | + | <cmath>|f(0)| = |2(-4)^3 - 14(-4)| = \boxed{072}</cmath> |
==Solution 3== | ==Solution 3== |
Revision as of 11:15, 8 June 2017
Problem
Let be a third-degree polynomial with real coefficients satisfying Find .
Solution
Let = . Since is a third degree polynomial, it can have at most two bends in it where it goes from up to down, or from down to up. By drawing a coordinate axis, and two lines representing 12 and -12, it is easy to see that f(1)=f(5)=f(6), and f(2)=f(3)=f(7); otherwise more bends would be required in the graph. Since only the absolute value of f(0) is required, there is no loss of generalization by stating that f(1)=12, and f(2)=-12. This provides the following system of equations. Using any four of these functions as a system of equations yields
Solution 2
Express in terms of powers of : By the same argument as in the first Solution, we see that is an odd function about the line , so its coefficients and are 0. From there it is relatively simple to solve (as in the above solution, but with a smaller system of equations): and
Solution 3
Without loss of generality, let . (If , then take as the polynomial, which leaves unchanged.) Because is third-degree, write where clearly must be a permutation of from the given condition. Thus However, subtracting the two equations gives , so comparing coefficients gives and thus both values equal to . As a result, . As a result, and so . Now, we easily deduce that and so removing the without loss of generality gives , which is our answer.
Solution 4
The following solution is similar to solution 3, but assumes nothing. Let . Since has degree 3, has degree 6 and has roots 1,2,3,5,6, and 7. Therefore, for some . Hence . Note that . Since has degree 3, so do and ; and both have the same leading coefficient. Hence and for some (else is not cubic) where is the same as the set . Subtracting the second equation from the first, expanding, and collecting like terms, we have that which must hold for all . Since we have that (1) , (2) and (3) . Since is the sum of 1,2,3,5,6, and 7, we have so that by (1) we have and . We must partition 1,2,3,5,6,7 into 2 sets each with a sum of 12. Consider the set that contains 7. It can't contain 6 or 5 because the sum of that set would already be with only 2 elements. If 1 is in that set, the other element must be 4 which is impossible. Hence the two sets must be and . Note that each of these sets happily satisfy (2). By (3), since the sets have products 42 and 30 we have that . Since is the leading coefficient of , the leading coefficient of is . Thus the leading coefficient of is 4, i.e. . Then from earlier, so that the answer is .
See Also
2015 AIME I (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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.