AIME 2006 I · 第 6 题
AIME 2006 I — Problem 6
题目详情
Problem
Let be the set of real numbers that can be represented as repeating decimals of the form where are distinct digits. Find the sum of the elements of
解析
Solution 1
Numbers of the form can be written as . There are such numbers. Each digit will appear in each place value times, and the sum of the digits, 0 through 9, is 45. So the sum of all the numbers is .
Solution 2
Alternatively, for every number, , there will be exactly one other number, such that when they are added together, the sum is , or, more precisely, 1. As an example, .
Thus, the solution can be determined by dividing the total number of permutations by 2. The answer is .
Another method, albeit a little risky, that can be used is to note that the numbers between 1 and 999 with distinct digits average out to . Then the total sum becomes which reduces to
Solution 3
Another way is to do complementary counting and casework. . Excluding numbers with repeating digits our answer would just be . We subtract off the sum of the numbers with at least two digits being the same:
Case 1: : Sum = .
Case 2: : Sum =
Case 3: : Sum = .
We overcounted the case where twice (the numbers with all 3 digits being the same). The sum of these numbers is .
So, our final answer is .
~grogg007