Difference between revisions of "2019 AMC 10A Problems/Problem 24"
Sevenoptimus (talk | contribs) m (Fixed formatting and solution numbering) |
Sevenoptimus (talk | contribs) (Improved clarity and formatting, and added more explanation to the solutions) |
||
Line 6: | Line 6: | ||
==Solution 1== | ==Solution 1== | ||
− | Multiplying both sides by <math>(s-p)(s-q)(s-r)</math> | + | Multiplying both sides by <math>(s-p)(s-q)(s-r)</math> yields |
<cmath>1 = A(s-q)(s-r) + B(s-p)(s-r) + C(s-p)(s-q)</cmath> | <cmath>1 = A(s-q)(s-r) + B(s-p)(s-r) + C(s-p)(s-q)</cmath> | ||
− | As this is a polynomial and is true for infinitely many <math>s</math>, it must be true for all <math>s</math>. | + | As this is a polynomial identity, and it is true for infinitely many <math>s</math>, it must be true for all <math>s</math> (since a polynomial with infinitely many roots must in fact be the constant polynomial <math>0</math>). This means we can plug in <math>s = p</math> to find that <math>\frac1A = (p-q)(p-r)</math>. Similarly, we can find <math>\frac1B = (q-p)(q-r)</math> and <math>\frac1C = (r-p)(r-q)</math>. Summing them up, we get that <cmath>\frac1A + \frac1B + \frac1C = p^2 + q^2 + r^2 - pq - qr - pr</cmath> |
− | By Vieta's | + | By Vieta's Formulas, we know that <math>p^2 + q^2 + r^2 = (p+q+r)^2 - 2(pq + qr + pr) = 324</math> and <math>pq + qr + pr = 80</math>. Thus the answer is <math>324 -80 = \boxed{\textbf{(B) } 244}</math>. |
− | ==Solution 2 ( | + | ''Note'': This process of substituting in the 'forbidden' values in the original identity is a standard technique for partial fraction decomposition, as taught in calculus classes. |
− | Multiplying by <math>(s-p)</math> on both sides we find that | + | |
+ | ==Solution 2 (limits)== | ||
+ | Multiplying by <math>(s-p)</math> on both sides, we find that | ||
<cmath>\frac{s-p}{s^3 - 22s^2 + 80s - 67} = A + \frac{B(s-p)}{s-q} + \frac{C(s-p)}{s-r}</cmath> | <cmath>\frac{s-p}{s^3 - 22s^2 + 80s - 67} = A + \frac{B(s-p)}{s-q} + \frac{C(s-p)}{s-r}</cmath> | ||
− | As <math>s\to p</math>, notice that the <math>B</math> and <math>C</math> terms on the right will cancel out and we will be left with only <math>A</math>. | + | As <math>s\to p</math>, notice that the <math>B</math> and <math>C</math> terms on the right will cancel out and we will be left with only <math>A</math>. Hence, <math>A = \lim_{s \to p} \frac{s-p}{s^3 - 22s^2 + 80s - 67}</math>, which by L'Hospital's rule becomes <math>\lim_{s \to p}\frac{1}{3s^2 - 44s + 80} = \frac{1}{3p^2 - 44p + 80}</math>. We can reason similarly to find <math>B</math> and <math>C</math>. Adding up the reciprocals and using Vieta's Formulas, we have that |
<cmath>\frac1A + \frac1B + \frac1C = 3(p^2 + q^2 + r^2) - 44(p + q + r) + 240 = 3(22^2 - 2(80)) - 44(22) + 240 = \boxed{\textbf{(B) } 244}</cmath> | <cmath>\frac1A + \frac1B + \frac1C = 3(p^2 + q^2 + r^2) - 44(p + q + r) + 240 = 3(22^2 - 2(80)) - 44(22) + 240 = \boxed{\textbf{(B) } 244}</cmath> | ||
Revision as of 01:05, 27 February 2019
Problem
Let , , and be the distinct roots of the polynomial . It is given that there exist real numbers , , and such that for all . What is ?
Solution 1
Multiplying both sides by yields As this is a polynomial identity, and it is true for infinitely many , it must be true for all (since a polynomial with infinitely many roots must in fact be the constant polynomial ). This means we can plug in to find that . Similarly, we can find and . Summing them up, we get that By Vieta's Formulas, we know that and . Thus the answer is .
Note: This process of substituting in the 'forbidden' values in the original identity is a standard technique for partial fraction decomposition, as taught in calculus classes.
Solution 2 (limits)
Multiplying by on both sides, we find that As , notice that the and terms on the right will cancel out and we will be left with only . Hence, , which by L'Hospital's rule becomes . We can reason similarly to find and . Adding up the reciprocals and using Vieta's Formulas, we have that
See Also
2019 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.