Difference between revisions of "2003 AIME II Problems/Problem 9"
m (→Solution) |
(→Solution) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | <math> | + | When we use long division to divide <math>P(x)</math> by <math>Q(x)</math>, the remainder is <math>x^2-x+1</math>. |
− | <math> | ||
− | + | So, since <math>z_1</math> is a root, <math>P(z_1)=(z_1)^2-z_1+1</math>. | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | So | ||
− | |||
− | |||
− | |||
− | |||
− | |||
Now this also follows for all roots of <math>Q(x)</math> | Now this also follows for all roots of <math>Q(x)</math> |
Revision as of 12:56, 7 October 2018
Problem
Consider the polynomials and Given that and are the roots of find
Solution
When we use long division to divide by , the remainder is .
So, since is a root, .
Now this also follows for all roots of Now
Now by Vieta's we know that , so by Newton Sums we can find
So finally
See also
2003 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
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.