AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

1990 AIME Problems/Problem 13

From AoPSWiki

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

Whenever you multiply a number by 9, the number will have an additional digit over the previous digit, with the exception when the new number starts with a 9, when the number of digits remain the same. Since 9^{4000} has 3816 digits more than 9^1, exactly 4000 - (3817 - 1) = 184 numbers have 9 as their leftmost digits.

See also

1990 AIME (ProblemsResources)
Preceded by
Problem 12
Followed by
Problem 14
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us