1990 AIME Problems/Problem 13
Since has 3816 digits more than , numbers have 9 as their leftmost digits.
Let's divide all elements of into sections. Each section ranges from to And, each section must have 1 or 2 elements. So, let's consider both cases.
If a section has 1 element, we claim that the number doesn't have 9 as the leftmost digit. Let this element be and the section ranges from to . To the contrary, let's assume the number () does have 9 as the leftmost digit. Thus, . But, if you divide both sides by 9, you get , and because , so we have another number () in the same section (). Which is a contradiction to our assumption that the section only has 1 element. So in this case, the number doesn't have 9 as the leftmost digit.
If a section has 2 elements, we claim one has to have a 9 as the leftmost digit, one doesn't. Let the elements be and , and the section ranges from to . So We know . From , we know , and since . The number()'s leftmost digit must be 9, and the other number()'s leftmost digit is 1.
There are total 4001 elements in and 3817 sections that have 1 or 2 elements. And, no matter how many elements a section has, each section contains exactly one element that doesn't begin with 9. We can take 4001 elements, subtract 3817 elements that don't have 9 as the leftmost digit, and get numbers that have 9 as the leftmost digit.
We know that is very close to . But we also know that for all , has digits. Hence has digits. Now, notice that if a power of has as the leftmost digit, then has as the leftmost digit and will preserve the same number of digits (just due to division). Hence we find that consecutive powers of are "supposed" to increase by one digit, however, when consecutive powers of have leading digit then leading digit they "lose" this one digit. Therefore, it suffices to find the number of times that has "lost" a digit since the number of times that this occurs shows us the number of pairs where the leading digit of is and the leading digit of is . Hence, we find that is "supposed" to have digits, but only has digits. Thus, the number of times has lost a digit is . Thus, elements of T have as their leading digit.
|1990 AIME (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|