Solution:
Answer: −501
We claim that
p=5110615112016⋯2010200620152011.
Let pn be the probability that, starting with n rocks, the number of rocks left after each round is a multiple of 5. Indeed, using recursions we have
p5k=5kp5k−5+p5k−10+⋯+p5+p0
for k≥1. For k≥2 we replace k with k−1, giving us
p5k−5=5k−5p5k−10+p5k−15+⋯+p5+p0⟹(5k−5)p5k−5=p5k−10+p5k−15+⋯+p5+p0
Substituting this back into the first equation, we have
5kp5k=p5k−5+(p5k−10+p5k−15+⋯+p5+p0)=p5k−5+(5k−5)p5k−5
which gives p5k=5k5k−4p5k−5. Using this equation repeatedly along with the fact that p0=1 proves the claim.
Now, the power of 5 in the denominator is v5(2015!)=403+80+16+3=502, and 5 does not divide any term in the numerator. Hence a=−502. (The sum counts multiples of 5 plus multiples of 52 plus multiples of 53 and so on; a multiple of 5n but not 5n+1 is counted exactly n times, as desired.)
Noting that 2015=31⋅65, we found that the numbers divisible by 31 in the numerator are those of the form 31+155k where 0≤k≤12, including 312=961; in the denominator they are of the form 155k where 1≤k≤13. Hence b=(13+1)−13=1 where the extra 1 comes from 312 in the numerator. Thus a+b=−501.