2019 AIME I Problems/Problem 1

Revision as of 21:28, 14 March 2019 by Kepy (talk | contribs) (Solution)

Problem 1

Consider the integer \[N = 9 + 99 + 999 + 9999 + \cdots + \underbrace{99\ldots 99}_\text{321 digits}.\]Find the sum of the digits of $N$.

Solution

The above sequence is equivalent to $(10^1-1)+(10^2-1)+(10^3-1)+\cdots+(10^321-1)$. We can take out the ones so that this becomes $[(10^1)+(10^2)+(10^3)+\cdots+(10^321)]-321$. Now, notice that $(10^1)+(10^2)+(10^3)+\cdots+(10^321)$ is equal to $111...11110$, with 321 ones and one zero as digits. Subtract 321 to obtain $111...10790$, with 318 ones, 2 zeros, a 7 and a 9 as digits. This sums to $\boxed{334}$.

2019 AIME I (ProblemsAnswer KeyResources)
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. AMC logo.png