Difference between revisions of "2006 AIME I Problems/Problem 6"
(→Solution) |
(→Solution) |
||
| Line 12: | Line 12: | ||
Alternatively, for every number, .abc there will be exactly one other number, such that when it is summed to .abc, it will equal .999, or, more precisely, 1. | Alternatively, for every number, .abc there will be exactly one other number, such that when it is summed to .abc, it will equal .999, or, more precisely, 1. | ||
| − | Ex. <math>.123+.876=.999 -> 1 </math> | + | Ex. <math>.123+.876=.999 -> 1 </math> |
Thus, the solution can be determined by dividing the total number of permutations by 2. | Thus, the solution can be determined by dividing the total number of permutations by 2. | ||
Revision as of 10:47, 13 March 2007
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
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 
.
Alternatively, for every number, .abc there will be exactly one other number, such that when it is summed to .abc, it will equal .999, or, more precisely, 1.
Ex. 
Thus, the solution can be determined by dividing the total number of permutations by 2.
See also
| 2006 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
