Difference between revisions of "2021 Fall AMC 10A Problems/Problem 25"

(Solution 1)
(Tag: New redirect)
 
(23 intermediate revisions by 3 users not shown)
Line 1: Line 1:
== Problem ==
+
#REDIRECT [[2021_Fall_AMC_12A_Problems/Problem_23]]
A quadratic polynomial with real coefficients and leading coefficient <math>1</math> is called <math>\emph{disrespectful}</math> if the equation <math>p(p(x))=0</math> is satisfied by exactly three real numbers. Among all the disrespectful quadratic polynomials, there is a unique such polynomial <math>\tilde{p}(x)</math> for which the sum of the roots is maximized. What is <math>\tilde{p}(1)</math>?
 
 
 
<math>\textbf{(A) } \frac{5}{16} \qquad\textbf{(B) } \frac{1}{2} \qquad\textbf{(C) } \frac{5}{8} \qquad\textbf{(D) } 1 \qquad\textbf{(E) } \frac{9}{8}</math>
 
 
 
== Solution 1==
 
Let <math>r_1</math> and <math>r_2</math> be the roots of <math>\tilde{p}(x)</math>. Then, <math>\tilde{p}(x)=(x-r_1)(x-r_2)=x^2-(r_1+r_2)x+r_1r_2</math>. The solutions to <math>\tilde{p}(\tilde{p}(x))=0</math> is the union of the solutions to <math>x^2-(r_1+r_2)x+(r_1r_2-r_1)=0</math> and <math>x^2-(r_1+r_2)x+(r_1r_2-r_2)=0</math>. It follows that one of these two quadratics has one solution (a double root) and the other has two. WLOG, assume that the quadratic with one root is <math>x^2-(r_1+r_2)x+(r_1r_2-r_1)=0</math>. Then, the discriminant is <math>0</math>, so <math>(r_1+r_2)^2 = 4r_1r_2 - 4r_1</math>. Thus, <math>r_1-r_2=\pm 2\sqrt{-r_1}</math>, but for <math>x^2-(r_1+r_2)x+(r_1r_2-r_2)=0</math> to have two solutions, it must be the case that <math>r_1-r_2=- 2\sqrt{-r_1}</math> *. It follows that the sum of the roots of <math>\tilde{p}(x)</math> is <math>2r_1 + 2\sqrt{-r_1}</math>, whose maximum value occurs when <math>r_1 = - \frac{1}{4}</math>. Solving for <math>r_2</math> yields <math>r_2 = \frac{3}{4}</math>. Therefore, <math>\tilde{p}(x)=x^2 - \frac{1}{2} x - \frac{3}{16}</math>, so <math>\tilde{p}(1)= \boxed{\textbf{(A) } \frac{5}{16}}</math>.
 
 
 
<math>*</math> For <math>x^2-(r_1+r_2)x+(r_1r_2-r_2)=0</math> to have two solutions, the discriminant <math>(r_1+r_2)^2-4r_1r_2+4r_2</math> must be positive. From here, we get that <math>(r_1-r_2)^2>-4r_2</math>, so <math>-4r_1>-4r_2 \rightarrow r_1<r_2</math>. Hence, <math>r_1-r_2</math> is negative, so <math>r_1-r_2=-2\sqrt{-r_1}</math>.
 
 
 
~ Leo.Euler
 
 
 
==Solution 2 (Factored form)==
 
 
 
The disrespectful function <math>p(x)</math> has leading coefficient 1, so it can be written in factored form as <math>(x-r)(x-s)</math>. Now the problem states that all <math>p(x)</math> must satisfy <math>p(p(x)) = 0</math>. Plugging our form in, we get: <cmath> ((x-r)(x-s)-r)((x-r)(x-s)-s) = 0 </cmath>
 
The roots of this equation are <math>(x-r)(x-s) = r, (x-r)(x-s) = s</math>. By the fundamental theorem of algebra, each root must have two roots for a total of four possible values of x yet the problem states that this equation is satisfied by three values of x. Therefore one equation must give a double root. Without loss of generality, let the equation <math>(x-r)(x-s) = r</math> be the equation that produces the double root. Expanding gives <math>x^2-(r+s)x+rs-r = 0</math>. We know that if there is a double root to this equation, the discriminant must be equal to zero, so <math>(r+s)^2-4(rs-r) = 0 \implies r^2+2rs+s^2-4rs+4r = 0 \implies r^2-2rs+s^2+4r = 0 </math>.
 
 
 
From here two solutions can progress.
 
 
 
==Solution 2.1 (Fastest)==
 
 
 
We can rewrite <math>r^2-2rs+s^2+4r = 0</math> as <math>(r-s)^2+4r = 0</math>. Let's keep our eyes on the ball; we want to find the disrespectful quadratic that maximizes the sum of the roots, which is <math>r+s</math>. Let this be equal to a new variable, <math>m</math>, so that our problem is reduced to maximizing this variable.
 
We can rewrite our equation in terms of m as <math>(m-2s)^2 + 4r = 0 \implies m^2 - 4ms+4s^2+4r = 0</math>.
 
 
 
This is a quadratic in m, so we can use the quadratic formula:
 
 
 
<math>m = \frac{4s \pm \sqrt{16s^2-4(4s^2+4r)}}{2}</math>
 
 
 
 
 
Solution in progress
 
 
 
~KingRavi
 

Latest revision as of 22:07, 23 November 2021