Difference between revisions of "2020 AIME I Problems/Problem 11"
(→Problem) |
(→Problem) |
||
Line 2: | Line 2: | ||
== Problem == | == Problem == | ||
+ | For integers <math>a,b,c</math> and <math>d,</math> let <math>f(x)=x^2+ax+b</math> and <math>g(x)=x^2+cx+d.</math> Find the number of ordered triples <math>(a,b,c)</math> of integers with absolute values not exceeding <math>10</math> for which there is an integer <math>d</math> such that <math>g(f(2))=g(f(4))=0.</math> | ||
== Solution == | == Solution == |
Revision as of 17:36, 12 March 2020
Note: Please do not post problems here until after the AIME.
Problem
For integers and let and Find the number of ordered triples of integers with absolute values not exceeding for which there is an integer such that
Solution
Either or not. If it is, note that Vieta's forces . Then, can be anything. However, can also be anything, as we can set the root of (not equal to ) to any integer, producing a possible integer value of . Therefore there are in this case. If it isn't, then are the roots of . This means by Vieta's, that:
Solving these inequalities while considering that to prevent , we obtain possible tuples and adding gives . ~awang11
See Also
2020 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.