For , an integer is chosen uniformly at random between 1 and inclusive. Let be the sum of all numbers chosen in this way. If the probability that divides but does not divide can be expressed as , where and are relatively prime positive integers, find the remainder when is divided by 1000.
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.
Let a i denote the integer chosen from between 1 and i. And S / a i denote S − a i .
We see that a 2 0 1 4 is from the set ( 1 , 2 , 3 … , 2 0 1 3 , 2 0 1 4 ) which is equivalent to ( 0 , 1 , 2 , 3 , … , 2 0 1 3 ) ( m o d 2 0 1 4 ) . So for each and every value of S / a 2 0 1 4 , there exists one and only one value of a 2 0 1 4 for which S = S / a 2 0 1 4 + a 2 0 1 4 ≡ 0 ( m o d 2 0 1 4 ) . So the probability of S being divisible by 2 0 1 4 is 2 0 1 4 1 .
Likewise, we can conclude that there exist 2 0 1 2 values of a 2 0 1 3 for which S = S / a 2 0 1 3 + a 2 0 1 3 ≡ 0 ( m o d 2 0 1 3 ) So the probability that S is not divisible by 2 0 1 3 is 2 0 1 3 2 0 1 2
Therefore the probability that S is not divisible by 2013 but divisible by 2014 is 2 0 1 3 2 0 1 2 × 2 0 1 4 1 = 2 0 2 7 0 9 1 1 0 0 6
a + b = 1 0 0 6 + 2 0 2 7 0 9 1 = 2 0 2 8 0 9 7 ≡ 0 9 7 ( m o d 1 0 0 0 )