Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 15"

(removed an incorrect solution)
Line 3: Line 3:
Counting all <math>2</math>, <math>3</math>, and <math>4</math> digit combinations and then permuting only those up to <math>2045</math>, we find that there are <math>186</math> numbers whose sums are either <math>11</math> or <math>22</math>. We need not account for the sum <math>33</math>, as it is not achievable with a <math>2</math> as the lowest digit. Since there are a total of <math>2048</math> numbers and <math>186</math> that work, we get <math>186/2048</math> or <math>93/1024</math>. Our sum is then <math>93 + 1024 = 1117</math>. The last three digits are <math>\boxed{117}</math>.

Revision as of 13:36, 30 September 2011


Let $S$ be the set of integers $0,1,2,...,10^{11}-1$. An element $x\in S$ (in) is chosen at random. Let $\star (x)$ denote the sum of the digits of $x$. The probability that $\star(x)$ is divisible by 11 is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Compute the last 3 digits of $m+n$


This problem needs a solution. If you have a solution for it, please help us out by adding it.

Invalid username
Login to AoPS