Difference between revisions of "2023 AIME I Problems/Problem 10"
R00tsofunity (talk | contribs) m |
Genius 007 (talk | contribs) (→Video Solution) |
||
Line 99: | Line 99: | ||
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | ||
+ | |||
+ | |||
+ | |||
+ | ==Solution 4== | ||
+ | |||
+ | We define <math>U' = \sum^{2023}_{n=1} {\frac{n^2-na}{5}}</math>. Since for any real number <math>x</math>, <math>\lfloor x \rfloor \le x \le \lfloor x \rfloor + 1</math>, we have <math>U \le U' \le U + 2023</math>. Now, since <math>-1000 \le U \le 1000</math>, we have <math>-1000 \le U' \le 3023</math>. | ||
+ | |||
+ | Now, we can solve for <math>U'</math> in terms of <math>a</math>. We have: | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | U' &= \sum^{2023}_{n=1} {\frac{n^2-na}{5}} \\ | ||
+ | &= \sum^{2023}_{n=1} {\frac{n^2}{5} - \frac{na}{5}} \\ | ||
+ | &= \sum^{2023}_{n=1} {\frac{n^2}{5}} - \sum^{2023}_{n=1} {\frac{na}{5}} \\ | ||
+ | &= \frac{\sum^{2023}_{n=1} {{n^2}} - \sum^{2023}_{n=1} {na}}{5} \\ | ||
+ | &= \frac{\frac{2023(2023+1)(2023 \cdot 2 + 1)}{6} - \frac{a \cdot 2023(2023+1)}{2} }{5} \\ | ||
+ | &= \frac{2023(2024)(4047-3a)}{30} \\ | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | So, we have <math>U' = \frac{2023(2024)(4047-3a)}{30}</math>, and <math>-1000 \le U' \le 3023</math>, so we have <math>-1000 \le \frac{2023(2024)(4047-3a)}{30} \le 3023</math>, or <math>-30000 \le 2023(2024)(4047-3a) \le 90690</math>. Now, <math>2023 \cdot 2024</math> is much bigger than <math>90690</math> or <math>30000</math>, and since <math>4047-3a</math> is an integer, to satsify the inequalities, we must have <math>4047 - 3a = 0</math>, or <math>a = 1349</math>, and <math>U' = 0</math>. | ||
+ | |||
+ | Now, we can find <math>U - U'</math>. We have: | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | U - U' &= \sum^{2023}_{n=1} {\lfloor \frac{n^2-1349n}{5} \rfloor} - \sum^{2023}_{n=1} {\frac{n^2-1349n}{5}} \\ | ||
+ | &= \sum^{2023}_{n=1} {\lfloor \frac{n^2-1349n}{5} \rfloor - \frac{n^2-1349n}{5}} | ||
+ | \end{align*}. | ||
+ | </cmath> | ||
+ | Now, if <math>n^2-1349n \equiv 0 \text{ (mod 5)}</math>, then <math>\lfloor \frac{n^2-1349n}{5} \rfloor - \frac{n^2-1349n}{5} = 0</math>, and if <math>n^2-1349n \equiv 1 \text{ (mod 5)}</math>, then <math>\lfloor \frac{n^2-1349n}{5} \rfloor - \frac{n^2-1349n}{5} = -\frac{1}{5}</math>, and so on. Testing with <math>n \equiv 0,1,2,3,4, \text{ (mod 5)}</math>, we get <math>n^2-1349n \equiv 0,2,1,2,0 \text{ (mod 5)}</math> respectively. From 1 to 2023, there are 405 numbers congruent to 1 mod 5, 405 numbers congruent to 2 mod 5, 405 numbers congruent to 3 mod 5, 404 numbers congruent to 4 mod 5, and 404 numbers congruent to 0 mod 5. So, solving for <math>U - U'</math>, we get: | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | U - U' &= \sum^{2023}_{n=1} {\lfloor \frac{n^2-1349n}{5} \rfloor - \frac{n^2-1349n}{5}} \\ | ||
+ | &= 404 \cdot 0 - 405 \cdot \frac{2}{5} - 405 \cdot \frac{1}{5} - 405 \cdot \frac{2}{5} - 404 \cdot t0 \\ | ||
+ | &= -405(\frac{2}{5}+\frac{1}{5}+\frac{2}{5}) \\ | ||
+ | &= -405 | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | Since <math>U' = 0</math>, this gives <math>U = -405</math>, and we have <math>a + U = 1349-405 = \boxed{944}</math>. | ||
+ | |||
+ | ~ genius_007 | ||
==See also== | ==See also== |
Revision as of 14:10, 8 February 2023
Contents
Problem 10
There exists a unique positive integer for which the sum is an integer strictly between and . For that unique , find .
(Note that denotes the greatest integer that is less than or equal to .)
Solution (Bounds and Decimal Part Analysis)
Define .
First, we bound .
We establish an upper bound of . We have
We establish a lower bound of . We have
We notice that if , then . Thus,
Because and , we must have either or .
For , we get a unique . For , there is no feasible .
Therefore, . Thus .
Next, we compute .
Let , where .
We have
Therefore,
Therefor, .
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Video Solution by Punxsutawney Phil
Video Solution
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Solution 4
We define . Since for any real number , , we have . Now, since , we have .
Now, we can solve for in terms of . We have: So, we have , and , so we have , or . Now, is much bigger than or , and since is an integer, to satsify the inequalities, we must have , or , and .
Now, we can find . We have: Now, if , then , and if , then , and so on. Testing with , we get respectively. From 1 to 2023, there are 405 numbers congruent to 1 mod 5, 405 numbers congruent to 2 mod 5, 405 numbers congruent to 3 mod 5, 404 numbers congruent to 4 mod 5, and 404 numbers congruent to 0 mod 5. So, solving for , we get: Since , this gives , and we have .
~ genius_007
See also
2023 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
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.