Difference between revisions of "2003 AIME II Problems/Problem 8"
(→Solution 4(Tedious)) |
Boxtheanswer (talk | contribs) m (→Solution 3: ! Looks like factorial) |
||
(4 intermediate revisions by one other user not shown) | |||
Line 12: | Line 12: | ||
Solving gives <math>a=-72, b=492,</math> and <math>c=1020</math>. Thus, the answer is <math>-72(8)^2+492\cdot8+1020= \boxed{348}.</math> | Solving gives <math>a=-72, b=492,</math> and <math>c=1020</math>. Thus, the answer is <math>-72(8)^2+492\cdot8+1020= \boxed{348}.</math> | ||
+ | |||
+ | ==Solution 1 (faster)== | ||
+ | |||
+ | Use the same rationale as in solution 1; instead of using terms <math>1,2,3</math>, we use <math>-1,0,1</math> and solve the <math>6</math>th term. | ||
+ | |||
+ | <math>a-b+c=1440</math> | ||
+ | |||
+ | <math>c=1716</math> | ||
+ | |||
+ | <math>a+b+c=1848</math> | ||
+ | |||
+ | Accordingly we will solve | ||
+ | |||
+ | <math>a=-72, b=204, c=1716</math> | ||
+ | |||
+ | <math>36a+6b+c= \boxed{348}.</math> | ||
+ | |||
+ | -maxamc | ||
== Solution 2 == | == Solution 2 == | ||
Line 58: | Line 76: | ||
<math>C_n - C_{n-1} = n^2(d_1 + d_2) + n(ad_2 + bd_1) + ab - (n-1)^2(d_1 + d_2) - (n-1)(ad_2 + bd_1) - ab = n(2d_1 + 2d_2) + ad_2 + bd_1 - d_1 - d_2</math>, | <math>C_n - C_{n-1} = n^2(d_1 + d_2) + n(ad_2 + bd_1) + ab - (n-1)^2(d_1 + d_2) - (n-1)(ad_2 + bd_1) - ab = n(2d_1 + 2d_2) + ad_2 + bd_1 - d_1 - d_2</math>, | ||
− | a linear equation in <math>n</math> | + | a linear equation in <math>n</math>. Since <math>C_2 - C_1 = 276</math> and <math>C_3 - C_2 = 132</math>, we can see that, in general, we have |
<math>C_n - C_{n-1} = 420 - 144n</math>. | <math>C_n - C_{n-1} = 420 - 144n</math>. |
Latest revision as of 18:55, 10 July 2024
Contents
[hide]Problem
Find the eighth term of the sequence whose terms are formed by multiplying the corresponding terms of two arithmetic sequences.
Solution 1
If you multiply the corresponding terms of two arithmetic sequences, you get the terms of a quadratic function. Thus, we have a quadratic such that , , and . Plugging in the values for x gives us a system of three equations:
Solving gives and . Thus, the answer is
Solution 1 (faster)
Use the same rationale as in solution 1; instead of using terms , we use and solve the th term.
Accordingly we will solve
-maxamc
Solution 2
Setting one of the sequences as and the other as , we can set up the following equalities
We want to find
Foiling out the two above, we have
and
Plugging in and bringing the constant over yields
Subtracting the two yields and plugging that back in yields
Now we find
.
Solution 3
Let the first sequence be
and the second be
,
with . Now, note that the term of sequence is and the term of is . Thus, the term of the given sequence is
,
a quadratic in . Now, letting the given sequence be , we see that
,
a linear equation in . Since and , we can see that, in general, we have
.
Thus, we can easily find
,
,
,
, and finally
.
Solution 4(Tedious)
Start by labeling the two sequences:
Sequence 1:,
Sequence 2:.
Additionally, label the sequence given in the problem the function , such that
.
Then,
and .
In order to find add enough times to get the difference between the and terms, then add and to get the other terms:
Now that the expression is in terms of the given values, insert values and solve:
Video Solution by Sal Khan
https://www.youtube.com/watch?v=ZFN63oTeYzc&list=PLSQl0a2vh4HCtW1EiNlfW_YoNAA38D0l4&index=12 - AMBRIGGS
See also
2003 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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.