1990 AIME Problems/Problem 13

Revision as of 23:51, 10 March 2019 by Chessmaster3 (talk | contribs) (Problem)

Problem

Let $T = \{9^k : k ~ \mbox{is an integer}, 0 \le k \le 4000\}$. Given that $9^{4000}_{}$ has 3817 digits and that its first (leftmost) digit is 9, how many elements of $T_{}^{}$ have 9 as their leftmost digit?

Solution

Since $9^{4000}$ has 3816 digits more than $9^1$, $4000 - 3816 = \boxed{184}$ numbers have 9 as their leftmost digits.

See also

1990 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 12
Followed by
Problem 14
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