There are 15 (not necessarily distinct) integers chosen uniformly at random from the range from 0 to 999, inclusive. Albert then computes the sum of their units digits, while Bob computes the last three digits of their sum. The probability of them getting the same result is , for relatively prime positive integers and . Find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Suppose the sum of the first 14 numbers' units digits is d . Suppose the sum of the first 14 numbers mod 1 0 0 0 is e . Now, for Albert and Bob to get the same result, we are looking for a fifteenth integer n = 1 0 a + b , 0 ≤ a ≤ 9 9 , 0 ≤ b ≤ 9 , such that d + b ≡ e + 1 0 a + b ( m o d 1 0 0 0 ) . This becomes 1 0 a ≡ d − e ( m o d 1 0 0 0 ) . Now d − e is divisible by 1 0 , so this always has a unique solution a . So there are ten possibilities for n = 1 0 a + b , out of one thousand. This means that the probability is 1 0 0 1 , and the answer is 1 1 0 .