It isn't 2013!

For 1 i 10000 1\le i\le 10000 , an integer is chosen uniformly at random between 1 and i i inclusive. Let S S be the sum of all numbers chosen in this way. If the probability that 2014 2014 divides S S but 2013 2013 does not divide S S can be expressed as a b \frac{a}{b} , where a a and b b are relatively prime positive integers, find the remainder when a + b a+b is divided by 1000.


The answer is 97.

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.

1 solution

Let a i a_i denote the integer chosen from between 1 and i. And S / a i S_{/a_i} denote S a i S - a_i .

We see that a 2014 a_{2014} is from the set ( 1 , 2 , 3 , 2013 , 2014 ) (1,2,3\ldots,2013,2014) which is equivalent to ( 0 , 1 , 2 , 3 , , 2013 ) ( m o d 2014 ) (0,1,2,3, \ldots,2013) \pmod{2014} . So for each and every value of S / a 2014 S_{/a_{2014}} , there exists one and only one value of a 2014 a_{2014} for which S = S / a 2014 + a 2014 0 ( m o d 2014 ) S = S_{/a_{2014}} + a_{2014} \equiv 0 \pmod{2014} . So the probability of S being divisible by 2014 2014 is 1 2014 \frac{1}{2014} .

Likewise, we can conclude that there exist 2012 2012 values of a 2013 a_{2013} for which S = S / a 2013 + a 2013 ≢ 0 ( m o d 2013 ) S = S_{/a_{2013}} + a_{2013} \not \equiv 0 \pmod{2013} So the probability that S is not divisible by 2013 2013 is 2012 2013 \frac{2012}{2013}

Therefore the probability that S is not divisible by 2013 but divisible by 2014 is 2012 2013 × 1 2014 = 1006 2027091 \frac{2012}{2013} \times \frac{1}{2014} = \frac{1006}{2027091}

a + b = 1006 + 2027091 = 2028097 097 ( m o d 1000 ) a + b = 1006 + 2027091 = 2028097 \equiv \boxed{097} \pmod{1000}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...