Difference between revisions of "1990 AIME Problems/Problem 15"
m (c) |
m (→Solution 4) |
||
(23 intermediate revisions by 11 users not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Find <math> | + | Find <math>ax^5 + by^5</math> if the real numbers <math>a,b,x,</math> and <math>y</math> satisfy the equations |
− | <cmath>ax + by = 3 | + | <cmath>\begin{align*} |
− | + | ax + by &= 3, \\ | |
− | + | ax^2 + by^2 &= 7, \\ | |
− | + | ax^3 + by^3 &= 16, \\ | |
+ | ax^4 + by^4 &= 42. | ||
+ | \end{align*}</cmath> | ||
− | == Solution == | + | == Solution 1 == |
Set <math>S = (x + y)</math> and <math>P = xy</math>. Then the relationship | Set <math>S = (x + y)</math> and <math>P = xy</math>. Then the relationship | ||
Line 26: | Line 28: | ||
(42)(S) & = & (ax^5 + by^5) + (P)(16) \\ | (42)(S) & = & (ax^5 + by^5) + (P)(16) \\ | ||
(42)( - 14) & = & (ax^5 + by^5) + ( - 38)(16) \\ | (42)( - 14) & = & (ax^5 + by^5) + ( - 38)(16) \\ | ||
− | ax^5 + by^5 & = & \boxed{ | + | ax^5 + by^5 & = & \boxed{020}\end{eqnarray*}</cmath> |
+ | |||
+ | == Solution 2 == | ||
+ | |||
+ | A [[linear recurrence | recurrence]] of the form <math>T_n=AT_{n-1}+BT_{n-2}</math> will have the closed form <math>T_n=ax^n+by^n</math>, where <math>x,y</math> are the values of the starting term that make the sequence geometric, and <math>a,b</math> are the appropriately chosen constants such that those special starting terms linearly combine to form the actual starting terms. | ||
+ | |||
+ | Suppose we have such a recurrence with <math>T_1=3</math> and <math>T_2=7</math>. Then <math>T_3=ax^3+by^3=16=7A+3B</math>, and <math>T_4=ax^4+by^4=42=16A+7B</math>. | ||
+ | |||
+ | Solving these simultaneous equations for <math>A</math> and <math>B</math>, we see that <math>A=-14</math> and <math>B=38</math>. So, <math>ax^5+by^5=T_5=-14(42)+38(16)= \boxed{020}</math>. | ||
+ | |||
+ | == Solution 3 == | ||
+ | |||
+ | Using factoring formulas, the terms can be grouped. First take the first three terms and sum them, getting: | ||
+ | |||
+ | <math>a(x^3 + x^2 + x) + b(y^3 + y^2 + y) = 16</math> | ||
+ | <math>ax\left( \frac{x^3-1}{x-1} \right) + by\left( \frac{y^3-1}{y-1} \right) = 16</math>. | ||
+ | |||
+ | Similarly take the first two terms, yielding: | ||
+ | |||
+ | <math>ax \left( \frac{x^2-1}{x-1} \right) + by \left( \frac{y^2-1}{y-1} \right) = 10</math>. | ||
+ | |||
+ | Lastly take an alternating three-term sum, | ||
+ | |||
+ | <math>a(x^3 - x^2 + x) + b(y^3 - y^2 + y) = 12</math> | ||
+ | <math>ax \left( \frac{x^3+1}{x+1} \right) + by \left( \frac{y^3+1}{y+1} \right) = 12</math>. | ||
+ | |||
+ | Now to get the solution, let the answer be <math>k</math>, so | ||
+ | |||
+ | <math>ax \left( \frac{x^4-1}{x-1} \right) + by \left(\frac{y^4-1}{y-1} \right) = 68</math>. | ||
+ | |||
+ | Multiplying out this expression gets the answer term and then a lot of other expressions, which can be eliminated | ||
+ | as done in the first solution. | ||
+ | |||
+ | ~lpieleanu (reformatting and minor edits) | ||
+ | |||
+ | == Solution 4 == | ||
+ | We first let the answer to this problem be <math>k.</math> Multiplying the first equation by <math>x</math> gives <math>ax^2 + bxy=3x</math>. | ||
+ | |||
+ | Subtracting this equation from the second equation gives <math>by^2-bxy=7-3x</math>. Similarly, doing the same for the other equations, we obtain: | ||
+ | <math>by^2-bxy=7-3x</math>, <math>by^3-bxy^2=16-7x</math>, <math>by^4-bxy^3=42-16x</math>, and <math>by^5-bxy^4=k-42x</math> | ||
+ | |||
+ | |||
+ | Now lets take the first equation. Multiplying this by <math>y</math> and subtracting this from the second gives us <math>by^3-bxy^2=(7-3x)y</math>. We can also obtain <math>by^4-bxy^3=(16-7x)y</math>. | ||
+ | |||
+ | Now we can solve for <math>x</math> and <math>y</math>! <math>(7-3x)y = 16-7x</math> and <math>(16-7x)y=42-16x</math>. Solving for <math>x</math> and <math>y</math> gives us <math>(-7+\sqrt{87},-7-\sqrt{87})</math> (It can be switched, but since the given equations are symmetric, it doesn't matter). <math>k-42x= (42-16x)y</math>, and solving for <math>k</math> gives us <math>k= \boxed{020}</math>. | ||
+ | |||
+ | ~pi_is_3.141 | ||
== See also == | == See also == | ||
Line 32: | Line 80: | ||
[[Category:Intermediate Algebra Problems]] | [[Category:Intermediate Algebra Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 15:24, 28 May 2023
Problem
Find if the real numbers and satisfy the equations
Solution 1
Set and . Then the relationship
can be exploited:
Therefore:
Consequently, and . Finally:
Solution 2
A recurrence of the form will have the closed form , where are the values of the starting term that make the sequence geometric, and are the appropriately chosen constants such that those special starting terms linearly combine to form the actual starting terms.
Suppose we have such a recurrence with and . Then , and .
Solving these simultaneous equations for and , we see that and . So, .
Solution 3
Using factoring formulas, the terms can be grouped. First take the first three terms and sum them, getting:
.
Similarly take the first two terms, yielding:
.
Lastly take an alternating three-term sum,
.
Now to get the solution, let the answer be , so
.
Multiplying out this expression gets the answer term and then a lot of other expressions, which can be eliminated as done in the first solution.
~lpieleanu (reformatting and minor edits)
Solution 4
We first let the answer to this problem be Multiplying the first equation by gives .
Subtracting this equation from the second equation gives . Similarly, doing the same for the other equations, we obtain: , , , and
Now lets take the first equation. Multiplying this by and subtracting this from the second gives us . We can also obtain .
Now we can solve for and ! and . Solving for and gives us (It can be switched, but since the given equations are symmetric, it doesn't matter). , and solving for gives us .
~pi_is_3.141
See also
1990 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last question | |
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.