Difference between revisions of "2018 UMO Problems/Problem 2"
Bigbrain123 (talk | contribs) (→Solution 1) |
Turtleman64 (talk | contribs) m (→Solution 1) |
||
(One intermediate revision by one other user not shown) | |||
Line 7: | Line 7: | ||
== Solution 1 == | == Solution 1 == | ||
− | Plugging in <math>x = 0</math>, we find that <math>abc = 1</math>. Using AM-GM, we have that <math>a+b+c \leq | + | Plugging in <math>x = 0</math>, we find that <math>abc = 1</math>. Using AM-GM, we have that <math>a+b+c \leq 3 \sqrt[3]{abc} = \fbox{3}</math> |
+ | ~bigbrain123 |
Latest revision as of 22:49, 15 July 2023
Problem 2
Let be a cubic polynomial , where and are positive real numbers. Let Q(x) be the polynomial with . If for all , then find the minimum possible value of .
Solution 1
Plugging in , we find that . Using AM-GM, we have that ~bigbrain123