Difference between revisions of "1971 Canadian MO Problems/Problem 4"
m |
m (→Solution 2) |
||
Line 25: | Line 25: | ||
=== Solution 2 === | === Solution 2 === | ||
− | Let <math>x^2+ax+1 = (x-s)(x-t) </math> and <math> x^2+x+a = (x-s)(x-t)</math> where <math>s</math> is the common root. From Vieta's Formulas, we have: <math>-(s+t) = a, -(s+u) = 1, st = 1, </math> and <math> su = 1</math>. We see that <math>s,t,u \ | + | Let <math>x^2+ax+1 = (x-s)(x-t) </math> and <math> x^2+x+a = (x-s)(x-t)</math> where <math>s</math> is the common root. From Vieta's Formulas, we have: <math>-(s+t) = a, -(s+u) = 1, st = 1, </math> and <math> su = 1</math>. We see that <math>s,t,u \neq 0</math>. |
Dividing <math>su</math> by <math>st</math>, we have: | Dividing <math>su</math> by <math>st</math>, we have: | ||
<cmath> \frac{su}{st} = \frac{a}{1} \Rightarrow u = at</cmath> Also, we have: <cmath>a+t = -s = 1+u \Rightarrow a+t = 1+u</cmath> | <cmath> \frac{su}{st} = \frac{a}{1} \Rightarrow u = at</cmath> Also, we have: <cmath>a+t = -s = 1+u \Rightarrow a+t = 1+u</cmath> |
Latest revision as of 15:35, 20 January 2014
Problem
Determine all real numbers such that the two polynomials and have at least one root in common.
Solutions
Solution 1
Let this root be . Then we have
Now, if , then we're done, since this satisfies the problem's conditions. If , then we can divide both sides by to obtain . Substituting this value into the first polynomial gives
It is easy to see that this value works for the second polynomial as well.
Therefore the only possible values of are and . Q.E.D.
Solution 2
Let and where is the common root. From Vieta's Formulas, we have: and . We see that . Dividing by , we have: Also, we have: Substituting into the above, we have:
Thus either or . We check to see that is indeed a possible value to satisfy the requirements. If , then from , we have , and from , we have , which also satisfies the requirements.
Thus, the only possible a values are: .
See Also
1971 Canadian MO (Problems) | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • | Followed by Problem 5 |