Difference between revisions of "2019 AIME I Problems/Problem 1"
(→Solution) |
(→Solution) |
||
Line 8: | Line 8: | ||
-eric2020 | -eric2020 | ||
− | + | ||
+ | |||
+ | A similar, but separate way to consider the initial manipulations is to observe that adding 1 to each term results in <math>10+100+... 10^{320}+10^{321})</math>. There are 321 terms, so it becomes <math>11...0</math>, where there are 322 digits in <math>11...0</math>. Then, subtract the 321 you initially added | ||
+ | |||
+ | ~ BJHHar | ||
==Solution 2== | ==Solution 2== |
Revision as of 19:50, 17 December 2019
Problem 1
Consider the integer Find the sum of the digits of .
Solution
Let's express the number in terms of . We can obtain . By the commutative and associative property, we can group it into . We know the former will yield , so we only have to figure out what the last few digits are. There are currently 1's. We know the last 4 digits are 1110, and that the others will not be affected if we subtract . If we do so, we get that . This method will remove 3 1's, and add a 7, 8 and 9. Therefore, the sum of the digits is .
-eric2020
A similar, but separate way to consider the initial manipulations is to observe that adding 1 to each term results in . There are 321 terms, so it becomes , where there are 322 digits in . Then, subtract the 321 you initially added
~ BJHHar
Solution 2
We can see that , , , all the way to ten nines when we have . Then, when we add more nines, we repeat the same process, and quickly get that the sum of digits is since we have to add to the sum of digits, which is .
Video Solution
https://www.youtube.com/watch?v=JFHjpxoYLDk
See Also
2019 AIME I (Problems • Answer Key • Resources) | ||
Preceded by First Problem |
Followed by Problem 2 | |
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.