Difference between revisions of "2024 AMC 12A Problems/Problem 21"
m |
|||
Line 64: | Line 64: | ||
and it is clear that <math>\sum^{100}_{n=1} \frac{1}{n^2}<2</math>. ~eevee9406 | and it is clear that <math>\sum^{100}_{n=1} \frac{1}{n^2}<2</math>. ~eevee9406 | ||
+ | |||
+ | |||
+ | ==Solution 2== | ||
+ | <cmath>\frac{a_n - 1}{n - 1} = \frac{a_{n - 1} + 1}{n}</cmath> | ||
+ | |||
+ | <cmath>na_n - n = (n - 1)a_{n - 1} + n - 1</cmath> | ||
+ | |||
+ | <cmath>na_n - (n - 1)a_{n - 1} = 2n - 1</cmath> | ||
+ | |||
+ | Suppose <math>{b_n}</math>, <math>b_n = na_n</math>, then <math>b_n - b_{n - 1} = 2n - 1</math>, where <math>b_1 = 1 \cdot a_1 = 2</math>, then we obtain that | ||
+ | |||
+ | <cmath>b_n = b_1 + (b_2 - b_1) + (b_3 - b_2) + \cdots + (b_n - b_{n - 1})</cmath> | ||
+ | |||
+ | <cmath>b_n = 2 + 3 + 5 + \cdots + (2n - 1) = 1 + n^2</cmath> | ||
+ | |||
+ | <cmath>a_n = \frac{1 + n^2}{n} = n + \frac{1}{n}</cmath> | ||
+ | |||
+ | Hence, | ||
+ | |||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | \sum_{n = 1}^{100} a_n^2 &= \sum_{n = 1}^{100} \left(n + \frac{1}{n}\right)^2\\ | ||
+ | &= \sum_{n = 1}^{100} (n^2 + 2 + \frac{1}{n^2})\\ | ||
+ | &= \sum_{n = 1}^{100} n^2 + \sum_{n = 1}^{100} 2 + \sum_{n = 1}^{100}\frac{1}{n^2}\\ | ||
+ | &= \frac{1}{6} \cdot 100 \cdot (100 + 1) \cdot (100 \cdot 2 + 1) + 100 \cdot 2 + \sum_{n = 1}^{100}\frac{1}{n^2}\\ | ||
+ | &= 338350 + 200 + \sum_{n = 1}^{100}\frac{1}{n^2}\\ | ||
+ | &= 338550 + \sum_{n = 1}^{100}\frac{1}{n^2} | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Notice that, | ||
+ | <cmath>\sum_{n = 1}^{100}\frac{1}{n^2} = 1 + \sum_{n = 2}^{100}\frac{1}{n^2} > 1</cmath> | ||
+ | <cmath>\sum_{n = 1}^{100}\frac{1}{n^2} < 1 + \sum_{n = 2}^{100}\frac{1}{n(n - 1)} = 1 + 1 - \frac{1}{100} < 2~~(\text{telescope})</cmath> | ||
+ | |||
+ | so | ||
+ | |||
+ | <cmath>\sum^{100}_{n=1} a_n^2\in(338551,338552)</cmath> | ||
+ | |||
+ | and thus the answer is <math>\boxed{\textbf{(B) }338551}</math>. | ||
+ | |||
+ | ~[https://artofproblemsolving.com/wiki/index.php/User:Reda_mandymath reda_mandymath] | ||
==See also== | ==See also== | ||
{{AMC12 box|year=2024|ab=A|num-b=20|num-a=22}} | {{AMC12 box|year=2024|ab=A|num-b=20|num-a=22}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 21:58, 8 November 2024
Contents
Problem
Suppose that and the sequence satisfies the recurrence relation for all What is the greatest integer less than or equal to
Solution
Multiply both sides of the recurrence to find that .
Let . Then the previous relation becomes
We can rewrite this relation for values of until and use telescoping to derive an explicit formula:
Summing the equations yields:
Now we can substitute back into our equation:
Thus the sum becomes
We know that , and we also know that , so the requested sum is equivalent to . All that remains is to calculate , and we know that this value lies between and (see the note below for a proof). Thus,
so
and thus the answer is .
~eevee9406
Note: . It is obvious that the sum is greater than 1 (since it contains as one of its terms).
If you forget this and have to derive this on the exam, here is how:
and it is clear that . ~eevee9406
Solution 2
Suppose , , then , where , then we obtain that
Hence,
Notice that,
so
and thus the answer is .
See also
2024 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 20 |
Followed by Problem 22 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.